Sciweavers

254 search results - page 38 / 51
» Approximation Algorithms for Scheduling Parallel Jobs
Sort
View
COCOON
1999
Springer
15 years 9 months ago
Multi-coloring Trees
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
Magnús M. Halldórsson, Guy Kortsarz,...
ICPPW
2006
IEEE
15 years 11 months ago
Grid Resource Allocation and Task Scheduling for Resource Intensive Applications
Evolution of grid has drawn attention from various resource intensive applications addressing domains of bio-informatics, astrology and multimedia, to name a few. Image analysis a...
Abdul Aziz, Hesham El-Rewini
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
15 years 9 months ago
Minimizing Stall Time in Single and Parallel Disk Systems
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
Susanne Albers, Naveen Garg, Stefano Leonardi
CCGRID
2007
IEEE
15 years 11 months ago
Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
While a grid represents a computing infrastructure for cross domain sharing of computational resources, the cyberinfrastructure, proposed by the US NSF Blue – Ribbon advisory pa...
Jie Yin, Junwei Cao, Yuexuan Wang, Lianchen Liu, C...
JSSPP
1997
Springer
15 years 9 months ago
Modeling of Workload in MPPs
In this paper we have characterized the inter-arrival time and service time distributions for jobs at a large MPP supercomputing center. Our findings show that the distributions ...
Joefon Jann, Pratap Pattnaik, Hubertus Franke, Fan...