Sciweavers

1257 search results - page 156 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
CISS
2008
IEEE
15 years 4 months ago
Incorporating retransmission diversity in quality-of-service guaranteed multi-user scheduling
Abstract— A cross-layer optimization combining retransmission diversity with multi-user diversity is investigated for wireless communications. To this end, a joint design of adap...
Xin Wang, Di Wang, Irena Li, Hanqi Zhuang, Salvato...
JSSPP
2005
Springer
15 years 3 months ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
INFOCOM
2010
IEEE
14 years 8 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
EMSOFT
2008
Springer
14 years 12 months ago
Portioned EDF-based scheduling on multiprocessors
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. Th...
Shinpei Kato, Nobuyuki Yamasaki
ATAL
2003
Springer
15 years 3 months ago
Scheduling tasks with precedence constraints to solicit desirable bid combinations
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
Alexander Babanov, John Collins, Maria L. Gini