Sciweavers

1316 search results - page 120 / 264
» A New Scheduling Algorithm for Servers
Sort
View
CN
2007
141views more  CN 2007»
13 years 10 months ago
Designing an overload control strategy for secure e-commerce applications
Uncontrolled overload can lead e-commerce applications to considerable revenue losses. For this reason, overload prevention in these applications is a critical issue. In this pape...
Jordi Guitart, David Carrera, Vicenç Beltra...
PODC
2004
ACM
14 years 4 months ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan
RTCSA
2005
IEEE
14 years 4 months ago
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
RTSS
2003
IEEE
14 years 3 months ago
Quick-release Fair Scheduling
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
James H. Anderson, Aaron Block, Anand Srinivasan
ICCAD
2009
IEEE
93views Hardware» more  ICCAD 2009»
13 years 8 months ago
An efficient wakeup scheduling considering resource constraint for sensor-based power gating designs
Power gating has been a very effective way to reduce leakage power. One important design issue for a power gating design is to limit the surge current during the wakeup process. N...
Ming-Chao Lee, Yu-Ting Chen, Yo-Tzu Cheng, Shih-Ch...