Sciweavers

841 search results - page 99 / 169
» Job Scheduling in Rings
Sort
View
IPPS
1999
IEEE
15 years 4 months ago
Communication-Intensive Parallel Applications and Non-dedicated Clusters of Workstations
Time-sharing operating systems may delay application processing of incoming messages because other processes are scheduled when the messages arrive. In this paper, we present a sim...
Kritchalach Thitikamol, Peter J. Keleher
HICSS
2009
IEEE
104views Biometrics» more  HICSS 2009»
15 years 6 months ago
Celebrating Diversity in Volunteer Computing
The computing resources in a volunteer computing system are highly diverse in terms of software and hardware type, speed, availability, reliability, network connectivity, and othe...
David P. Anderson, Kevin Reed
CP
2009
Springer
15 years 6 months ago
Closing the Open Shop: Contradicting Conventional Wisdom
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert
89
Voted
JSSPP
1995
Springer
15 years 3 months ago
The Interaction between Memory Allocation and Adaptive Partitioning in Message-Passing Multicomputers
Abstract. Most studies on adaptive partitioning policies for scheduling parallel jobs on distributed memory parallel computers ignore the constraints imposed by the memory requirem...
Sanjeev Setia
PDPTA
2008
15 years 1 months ago
A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems
- Load balancing is a crucial issue in parallel and distributed systems to ensure fast processing and optimum utilization of computing resources. Load balancing strategies try to e...
Bibhudatta Sahoo, Sudipta Mohapatra, Sanjay Kumar ...