Space efficient execution of deterministic parallel programs

IEEE Transactions on Software Engineering

Volumn 25, Issue 6, 1999, Pages 870-882

  Simpson, David J ^a   Warren Burton, F ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; GRAPH THEORY; RESOURCE ALLOCATION; STORAGE ALLOCATION (COMPUTER);

MEMORY BOUNDS; MEMORY MANAGEMENT; PARALLEL PROGRAMMING; SCHEDULING ALGORITHM; SHARED MEMORY; WORST CASE PERFORMANCE;

PARALLEL PROCESSING SYSTEMS;

EID: 0033332944     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.824415     Document Type: Article

References (13)

1. N.S. Arora, R.D. Blumofe, and G.G. Plaxton, Thread Scheduling for Mulliprograinmed Multiprocessors, 1998, to appear.
2. G. Blelloch, P, Gibbons, and Y, Mafias, Piovably Efficient Scheduling for Languages with Fine-Grained Parallelism/' Proc. Symp. Parallel Algorithms and Architectures, pp. 1-12, July 1995.
3. G.E. Blelloch, P.D. Gibbons, Y. Matws, and G.J. Narlikar, SpaceEfficient Scheduling of Parallelism with Synchronization Variables, ACM Symp. Parallel Algorithm ana Architectures, June 1997.
4. R.D. Blumofe, Executing Multithreaded Programs Efficiently, PhD thesis, Dept. of Electrical Eng. and Computer Science, MIT, Sept. 1995.
5. R.D. Blumofe and C.E. Leiserson, Space-Efficient Scheduling of Multithreaded Computations, Proc. 25th Ann. ACM Symp. Theory of Computing, pp. 362-371, San Diego Calif., May 1993.
6. R.D. Blumofe and C.E. Leiserson, Scheduling Multithreaded Computations by Work Stealing, Proc. 35th Symp. Foundations of Computer Science, 1994.
7. R.D. Blumofe and D. Papadopoulos, The Performance of Work Stealing in Multiprogrammed Environments, 1998, to appear.
8. F.W. Burton, Storage Management in Virtual Tree Machines, IEEE Trans. Computers, vol. 37, no. 3, Mar. 1988.
9. F.W. Burton, Guaranteeing Good Space Bounds for Parallel Programs, IEEE Trans. Software Eng., vol. 22, no. 10, Oct. 1996.
10. F.W. Burton, G. McKeown, V.J. Rayward-Smith, and D.J. Simpson, Bounding the Worst-Case Memory Requirement for Garbage Collection in Series-Parallel Programs, to appear.
11. F.W. Burton and V.J. Rayward-Smith, Worst Case Scheduling for Parallel Functional Programs, J. Functional Programming, vol. 4, no. 1, pp. 65-75, Jan. 1994.
12. F.W- Burton and M.R. Sleep, Executing Functional Programs on a Virtual Tree of Processors, Proc. Conf, Functional Programming Languages and Computer Architecture, pp. 187-194, Portsmouth N.H., Oct. 1981.
13. D.L. Eager, J. Zahorian, and E.D. Lazowska, Speedup versus Efficiency in Parallel Systems, IEEE Trans, Computers, vol. 38, no. 3, pp. 408-423, Mar. 1989.