Cost semantics for space usage in a parallel language

Authors:
Daniel Spoonhower
Affiliations:
Carnegie Mellon University
Venue:
Proceedings of the 2007 workshop on Declarative aspects of multicore programming
Year:
2007

Citing 4
Cited 1

A provable time and space efficient implementation of NESL

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Space-Efficient Scheduling of Multithreaded Computations

SIAM Journal on Computing
Provably efficient scheduling for languages with fine-grained parallelism

Journal of the ACM (JACM)
Space-efficient scheduling of nested parallelism

ACM Transactions on Programming Languages and Systems (TOPLAS)

Resource bound analysis for database queries

Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a framework for better understanding scheduling policies for fine-grained parallel computations and their effect on space usage. We define a profiling semantics that can be used to determine the asymptotic space taken by any schedule. A nondeterministic parallel transition semantics is used to describe all possible parallel executions. Refinements of that semantics can be used to model the behavior of particular schedulers. We use the framework to show that different schedules can lead to asymptotic differences in space usage.