Sciweavers

2544 search results - page 414 / 509
» Process pipeline scheduling
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 1 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
EMSOFT
2006
Springer
15 years 1 months ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...
IPPS
1998
IEEE
15 years 1 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
MASCOTS
2001
14 years 11 months ago
Generalized Processor Sharing with Long-Range Dependent Traffic Input
In this paper, we develop an upper bound on the individual session queue length of long range dependent (LRD) traffic under the generalized processor sharing (GPS) scheduling disc...
Xiang Yu, Ian Li-Jin Thng, Yuming Jiang
PPSC
2001
14 years 11 months ago
Airline Crew Pairing Generation in Parallel
Crew pairing generation is a time consuming part of the complex process of airline crew scheduling. We present a parallel algorithm for this problem's solution and several im...
Diego Klabjan, Karsten Schwan