Competitive implementation of parallel programs

Authors:
Xiaotie Deng;Elias Koutsoupias
Affiliations:
Department of Computer Science, York University, North York, Ontario, M3J 1P3;Department of Computer Science and Engineering, UCSD, Jolla, CA
Venue:
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Year:
1993

Amortized efficiency of list update and paging rules

Communications of the ACM
A communication-time tradeoff

SIAM Journal on Computing
Towards an architecture-independent analysis of parallel algorithms

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Communication complexity for parallel divide-and-conquer

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Efficient Parallel Divide-and-Conquer for a Class of Interconnection Topologies

ISA '91 Proceedings of the 2nd International Symposium on Algorithms

On multiprocessor system scheduling

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling in the dark

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Preemptive scheduling of parallel jobs on multiprocessors

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On-line scheduling mesh jobs with dependencies

Theoretical Computer Science

Hi-index	0.00