Sciweavers

1792 search results - page 76 / 359
» Improved scheduling in rings
Sort
View
TSP
2008
100views more  TSP 2008»
13 years 9 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
CSCW
2012
ACM
12 years 5 months ago
Towards self-optimizing collaborative systems
Two important performance metrics in collaborative systems are local and remote response times. Previous analytical and simulation work has shown that these response times depend ...
Sasa Junuzovic, Prasun Dewan
DSD
2006
IEEE
83views Hardware» more  DSD 2006»
14 years 1 months ago
Resource-Efficient Routing and Scheduling of Time-Constrained Network-on-Chip Communication
Abstract. Network-on-chip-based multiprocessor systems-onchip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel p...
Sander Stuijk, Twan Basten, Marc Geilen, Amir Hoss...
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
13 years 11 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
PDP
2008
IEEE
14 years 4 months ago
Just-In-Time Scheduling for Loop-based Speculative Parallelization
Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several ‘dry-runs’...
Diego R. Llanos Ferraris, David Orden, Belé...