Sciweavers

706 search results - page 79 / 142
» Loop Scheduling for Heterogeneity
Sort
View
ICC
2008
IEEE
109views Communications» more  ICC 2008»
14 years 3 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang
CLUSTER
2007
IEEE
14 years 3 months ago
Dynamic scheduling of multi-processor tasks on clusters of clusters
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
Sascha Hunold, Thomas Rauber, Gudula Rünger
HPDC
2008
IEEE
14 years 3 months ago
The performance of bags-of-tasks in large-scale distributed systems
Ever more scientists are employing large-scale distributed systems such as grids for their computational work, instead of tightly coupled high-performance computing systems. Howev...
Alexandru Iosup, Omer Ozan Sonmez, Shanny Anoep, D...
IFIP
1998
Springer
14 years 1 months ago
Combining Static Partitioning with Dynamic Distribution of Threads
This paper presents a hybrid approach to automatic parallelization of computer programs which combines static extraction of threads (tasks) with dynamic scheduling for parallel an...
Ronald Moore, Melanie Klang, Bernd Klauer, Klaus W...
GLOBECOM
2007
IEEE
14 years 3 months ago
Opportunistic Relaying in Cellular Network for Capacity and Fairness Improvement
— In this paper, we study how the cooperative relaying can improve both capacity and fairness in cellular network. The capacity and fairness have a trade-off relationship, so inc...
Seungho Song, Kyuho Son, Hyang-Won Lee, Song Chong