Timely and Energy-Efficient Multi-Step Update Processing

This work explores systems that deliver source updates requiring multiple sequential processing steps. We model and analyze the Age of Information (AoI) performance of various system designs under both parallel and series server setups. In parallel setups, each processor executes all computation steps with multiple processors working in parallel, while in series setups, each processor performs a specific step in sequence. In practice, processing faster is better in terms of age but it also consumes more power. To address this age-power trade-off, we formulate and solve an optimization problem to determine the optimal service rates for each processing step under a given power budget. Our analysis focuses on a special case where updates require two computational steps. The results show that the service rate of the second step should generally be faster than that of the first step to achieve minimum AoI and reduce power wastage. Furthermore, parallel processing is found to offer a better age-power trade-off compared to series processing.

Authors

Institutions

Publication Details

Published
2024-10-27
DOI
https://doi.org/10.1109/ieeeconf60004.2024.10943018
Citations
1
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.78
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Timely and Energy-Efficient Multi-Step Update Processing

Vishakha Ramani, Roy D. Yates, Ivan Seskar
1 citations
Cloud Computing and Resource Management
0.78
article

Timely and Energy-Efficient Multi-Step Update Processing

Vishakha Ramani, Roy D. Yates, Ivan Seskar
article en
1 citations

Abstract

This work explores systems that deliver source updates requiring multiple sequential processing steps. We model and analyze the Age of Information (AoI) performance of various system designs under both parallel and series server setups. In parallel setups, each processor executes all computation steps with multiple processors working in parallel, while in series setups, each processor performs a specific step in sequence. In practice, processing faster is better in terms of age but it also consumes more power. To address this age-power trade-off, we formulate and solve an optimization problem to determine the optimal service rates for each processing step under a given power budget. Our analysis focuses on a special case where updates require two computational steps. The results show that the service rate of the second step should generally be faster than that of the first step to achieve minimum AoI and reduce power wastage. Furthermore, parallel processing is found to offer a better age-power trade-off compared to series processing.

Rutgers Sexual and Reproductive Health and Rights (NL)
Affordable and clean energy
Openalex Percentile: Top 17%
Cloud Computing and Resource Management
0.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Timely and Energy-Efficient Multi-Step Update Processing — Vishakha Ramani, Roy D. Yates, et al. · (2024) | TGRS Research Map | TGRS