New complexity results on scheduling with small communication delays

Authors:
C. Picouleau
Affiliations:
-
Venue:
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Year:
1995

Citing 0
Cited 6

An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Minimizing the volume in scheduling an out-tree with communication delays and duplication

Parallel Computing
Scheduling unitary task systems with zero-one communication delays for quasi-interval orders

Discrete Applied Mathematics
An efficient parallel algorithm for solving the Knapsack problem on hypercubes

Journal of Parallel and Distributed Computing
Complexity and approximation for precedence constrained scheduling problems with large communication delays

Theoretical Computer Science
Complexity and approximation for the precedence constrained scheduling problem with large communication delays

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract