800 search results - page 18 / 160 » Understanding Algorithm Performance on an Oversubscribed Sch... |
EGC
2005
Springer
14 years 27 days ago
2005
Springer
In this paper we propose a new approach for scheduling data parallel applications on the Grid using irregular array distributions. We implement the scheduler as a new case study fo...
ISPASS
2003
IEEE
14 years 20 days ago
2003
IEEE
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...
MTA
2002
13 years 7 months ago
2002
Robotic tape libraries are popular for applications with very high storage requirements, such as video servers. Here, we study the throughput of a tape library system, we design a...
IPPS
2003
IEEE
14 years 20 days ago
2003
IEEE
Load balancing is a key concern when developing parallel and distributed computing applications. The emergence of computational grids extends this problem, where issues of cross-d...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...