Optimal schedules for d-D grid graphs with communication delays

Authors:
E. Bampis;C. Delorme;J.-C. König
Affiliations:
-;-;-
Venue:
Parallel Computing
Year:
1998

Citing 0
Cited 3

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

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
An efficient parallel algorithm for solving the Knapsack problem on hypercubes

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract