Sciweavers

7065 search results - page 87 / 1413
» Iterative Scheduling Algorithms
Sort
View
129
Voted
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 5 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
MOC
2011
14 years 7 months ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont
WDAG
2007
Springer
127views Algorithms» more  WDAG 2007»
15 years 6 months ago
A Distributed Maximal Scheduler for Strong Fairness
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
Matthew Lang, Paolo A. G. Sivilotti
ECRTS
2008
IEEE
15 years 7 months ago
Period and Deadline Selection for Schedulability in Real-Time Systems
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems. Existing frameworks assume that only task periods are adjustable and that ta...
Thidapat Chantem, Xiaofeng Wang, Michael D. Lemmon...
94
Voted
SAC
2004
ACM
15 years 6 months ago
L0 buffer energy optimization through scheduling and exploration
Clustered L0 buffers are an interesting alternative to reduce energy consumption in the instruction memory hierarchy of embedded VLIW processors. Currently, the synthesis of L0 cl...
Murali Jayapala, Tom Vander Aa, Francisco Barat, G...