![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter
Energy-Aware Application Code
At several points in the previous chapters, we have alluded to projects that included a role for the applications to provide more information to assist the system in making power management decisions. Users ma...
-
Chapter
Introduction
Managing energy consumption, primarily with the goal of extending the lifetime of battery-powered devices, is widely recognized as a fundamental challenge in mobile computing and wireless communication. The li...
-
Chapter
Management of Device Power States
This chapter begins by considering idleness and the challenges involved in detecting idle periods. We focus on managing power state transitions for a single device, exploiting the idle time offered by the acce...
-
Chapter
Multiple Devices—Interactions and Tradeoffs
While the majority of work in energy management for mobile computing has focused on a single component at a time and the savings in consumption by that device, this chapter discusses the interactions and trade...
-
Chapter
Challenges and Opportunities
There is widespread recognition within the mobile computing R&D community of the importance of energy management. This lecture has focused on the demand side of the energy story. It has highlighted some of the...
-
Chapter
System Energy Models and Metrics
This chapter presents basic energy terminology and widely accepted metrics. It describes mechanisms provided by hardware to allow systems to manage how power is consumed in mobile devices. It addresses the mea...
-
Chapter
Dynamic Voltage Scheduling (DVS)
This chapter discusses scheduling policies that exploit dynamic frequency and voltage scaling in processors. The strength of scaling frequency and voltage together is that it provides quadratic energy savings ...
-
Book
-
Article
Computing: report leaps geographical barriers but stumbles over gender
-
Article
Practical prefetching techniques for multiprocessor file systems
Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor a...
-
Article
Algorithms for parallel memory allocation
Dynamic storage allocation is a vital component of programming systems intended for multiprocessor architectures that support globally shared memory. Highly parallel algorithms for access to system data struct...
-
Article
Concurrent search and insertion in 2–3 trees
The problem being addressed is to allow a number of processes to search and insert concurrently in a 2–3 tree without causing deadlock and without destroying the integrity of the data or structure. We present ...