Sciweavers

1257 search results - page 38 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
81
Voted
CORR
2004
Springer
153views Education» more  CORR 2004»
14 years 11 months ago
Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection Scheme in Evolutionary Algorithms
Abstract-Boltzmann selectionis an important selection mechanism in evolutionary algorithms as it has theoretical properties which help in theoretical analysis. However, Boltzmann s...
Ambedkar Dukkipati, M. Narasimha Murty, Shalabh Bh...
98
Voted
HIPC
2003
Springer
15 years 5 months ago
Double-Loop Feedback-Based Scheduling Approach for Distributed Real-Time Systems
The use of feedback control techniques has been gaining importance in real-time scheduling as a means to provide predictable performance in the face of uncertain workload. In this ...
Suzhen Lin, G. Manimaran
ECRTS
1999
IEEE
15 years 4 months ago
Handling sporadic tasks in off-line scheduled distributed real-time systems
Many industrial applications mandate the use of a timetriggered paradigm and consequently the use of off-line scheduling for reasons such as predictability, certification, cost, o...
Damir Isovic, Gerhard Fohler
100
Voted
IPPS
2002
IEEE
15 years 4 months ago
Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
Hongtu Chen, Muthucumaru Maheswaran
WIOPT
2006
IEEE
15 years 5 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar