论文信息 - Making a Packet: Cost-Effective Communication for a Parallel Graph Reducer

Making a Packet: Cost-Effective Communication for a Parallel Graph Reducer

This paper studies critical runtime-system issues encountered when packing data for transmission in a lazy, parallel graph reduction system. In particular, we aim to answer two questions: How much graph should go into a packet? How aggressively should a processor look for work after requesting remote data?

Hans-Wolfgang Loidl | Kevin Hammond

[1] M.H.G. Kesseler,et al. The implementation of functional languages on parallel machines with distributed memory , 1996 .

[2] Cormac Flanagan,et al. pHluid: the design of a parallel functional language implementation on workstations , 1996, ICFP '96.

[3] Robert H. Halstead,et al. Lazy task creation: a technique for increasing the granularity of parallel programs , 1990, IEEE Trans. Parallel Distributed Syst..

[4] David R. Lester,et al. The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer Network , 1991, Comput. J..

[5] Simon L. Peyton Jones,et al. Parallel Implementations of Functional Programming Languages , 1989, Comput. J..

[6] L. Harbird,et al. A functional database system for road accident analysis , 1996 .

[7] Alan J. Dix,et al. Efficient binary transfer of pointer structures , 1994, Softw. Pract. Exp..

[8] Simon L. Peyton Jones,et al. High-Performance parallel graph reduction , 1989, PARLE.

[9] Simon L. Peyton Jones,et al. GRIP - A high-performance architecture for parallel graph reduction , 1987, FPCA.

[10] Simon L. Peyton Jones,et al. GUM: a portable parallel implementation of Haskell , 1996, PLDI '96.

[11] Gerald Ostheimer. Parallel functional programming for message-passing multiprocessors , 1993 .

[12] Seth Copen Goldstein,et al. TAM - A Compiler Controlled Threaded Abstract Machine , 1993, J. Parallel Distributed Comput..