223 search results - page 3 / 45 » Improving First-Come-First-Serve Job Scheduling by Gang Sche... |
ISPA
2007
Springer
2007
Springer
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers
14 years 1 months ago
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contigu...
PE
2010
Springer
13 years 5 months ago
2010
Springer
Correlations in traffic patterns are an important facet of the workloads faced by real systems, and one that has far-reaching consequences on the performance and optimization of t...
EOR
2006
13 years 7 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. In this paper we present a migration scheme which reduces the fragmentation ...
JSSPP
1997
Springer
13 years 11 months ago
1997
Springer
This paper examinestheimplicationsofgang schedulingfor generalpurpose multiprocessors. The workloads in these environments include both compute-bound parallel jobs, which often re...