Sciweavers

223 search results - page 14 / 45
» Scheduling Memory Constrained Jobs on Distributed Memory Par...
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
ICPADS
2006
IEEE
14 years 1 months ago
Loop Scheduling with Complete Memory Latency Hiding on Multi-core Architecture
The widening gap between processor and memory performance is the main bottleneck for modern computer systems to achieve high processor utilization. In this paper, we propose a new...
Chun Xue, Zili Shao, Meilin Liu, Mei Kang Qiu, Edw...
ICS
2000
Tsinghua U.
13 years 11 months ago
Hardware-only stream prefetching and dynamic access ordering
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...
Chengqiang Zhang, Sally A. McKee
ICPP
1999
IEEE
13 years 12 months ago
Access Descriptor Based Locality Analysis for Distributed-Shared Memory Multiprocessors
Most of today's multiprocessors have a DistributedShared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming...
Angeles G. Navarro, Rafael Asenjo, Emilio L. Zapat...
PDP
2005
IEEE
14 years 1 months ago
Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...
Olivier Beaumont, Arnaud Legrand, Loris Marchal, Y...