Optimal latency-throughput tradeoffs for data parallel pipelines

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimal latency-throughput tradeoffs for data parallel pipelines

Full text

Pdf (1.19 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures table of contents

Padua, Italy

Pages: 62 - 71

Year of Publication: 1996

ISBN:0-89791-809-6

Authors

Jaspar Subhlok	School of Computer Science, Carnegie Mellon University, Pittsburg, PA
Gary Vondran	Hewlett Packard Laboratories, Hewlett Packard Company, Cambridge, MA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 38, Citation Count: 13

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237502.237508 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Shahid H. Bokhari, Assignment problems in parallel and distributed computing, Kluwer Academic Publishers, Norwell, MA, 1987
	2	Soumen Chakrabarti , James Demmel , Katherine Yelick, Modeling the benefits of mixed data and task parallelism, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.74-83, June 24-26, 1995, Santa Barbara, California, United States [doi>10.1145/215399.215423]
	3	CHANDY, M., FOSTER, I., KENNEDY, #., KOELBEL, C., AND TSENG, C. Integrated support for task and data parallelism. International dournal of Supercomputer Applicat,ons 8, 2 (1994), 80-98.
	4	Barbara Chapman , Piyush Mehrotra , Author: , and H Zima, A SOFTWARE ARCHITECTURE FOR MULTIDISCIPLINARY APPICATIONS: INTEGRATING TASK AND DATA PARALLELISM, Institute for Computer Applications in Science and Engineering (ICASE), 1994
	5	A. N. Choudhary , B. Narahari , D. M. Nicol , R. Simha, Optimal Processor Assignment for a Class of Pipelined Computations, IEEE Transactions on Parallel and Distributed Systems, v.5 n.4, p.439-445, April 1994 [doi>10.1109/71.273050]
	6	Lawrence A. Crowl , Mark E. Crovella , Thomas J. LeBlanc , Michael L. Scott, The advantages of multiple parallelizations in combinatorial search, Journal of Parallel and Distributed Computing, v.21 n.1, p.110-123, April 1994 [doi>10.1006/jpdc.1994.1045]
	7	DINDA, P., GROSS, T., O'HALLARON, D., SEGALL, E., STICHNOTH, J., SUBHLOK, J., WEBB, J., AND YANG, B. The CMU task parallel program suite. Tech. Rep. CMU-CS-94-131, School of Computer Science, Carnegie Mellon University, Mar. 1994.
	8	FOSTER, I., AVALANI, B., CHOUDHARY, A., AND XU, M. A compilation system that integrates High Performance Fortran and Fortran M. In Proceeding of 1994 Scalable High Performance Comput,ng Conference (Knoxville, TN, October 1994), pp. 293-300.
	9	Thomas Gross , David R. O'Hallaron , Jaspal Subhlok, Task Parallelism in a High Performance Fortran Framework, IEEE Parallel & Distributed Technology: Systems & Technology, v.2 n.3, p.16-26, September 1994 [doi>10.1109/M-PDT.1994.329791]
	10	HICH PERFORMANCE FORTRAN FORUM. High Performance Fortran Language Specification, Version 1.0, May 1993.
	11	RAMASWAMY, S., SAPATNEKAR, S., AND BANERJEE, P. A convex programming approach for exploiting data and functional parallelism. In Proceedings of the 1994 International Conference on Parallel Processing (St Charles, IL, August 1994), vol. 2, pp. 116-125.
	12	Vivek Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, MIT Press, Cambridge, MA, 1989
	13	Jaspal Subhlok , David R. O'Hallaron , Thomas Gross , Peter A. Dinda , Jon Webb, Communication and memory requirements as the basis for mapping task and data parallel programs, Proceedings of the 1994 conference on Supercomputing, p.330-339, December 1994, Washington, D.C., United States
	14	Jaspal Subhlok , James M. Stichnoth , David R. O'Hallaron , Thomas Gross, Exploiting task and data parallelism on a multicomputer, Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.13-22, May 19-22, 1993, San Diego, California, United States
	15	Jaspal Subhlok , Gary Vondran, Optimal mapping of sequences of data parallel tasks, Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.134-143, July 19-21, 1995, Santa Barbara, California, United States
	16	VONDRAN, G. Optimization of latency, throughput and processors for pipelines of data parallel tasks. Master's thesis, Dept. of Electrical and Computer Engineering, Carnegie Mellon University, May 1995.
	17	J. A. Webb, Latency and bandwidth considerations in parallel robotics image processing, Proceedings of the 1993 ACM/IEEE conference on Supercomputing, p.230-239, December 1993, Portland, Oregon, United States [doi>10.1145/169627.169714]
	18	Bwolen Yang , Jon A. Webb , James M. Stichnoth , David R. O'Hallaron , Thomas Gross, Do&Merge: Integrating Parallel Loops and Reductions, Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, p.169-183, August 12-14, 1993
	19	Tao Yang, Scheduling and code generation for parallel architectures, Rutgers University, New Brunswick, NJ, 1993

CITED BY 13

	Kathleen Knobe , James M. Rehg , Arun Chauhan , Rishiyur S. Nikhil , Umakishore Ramachandran, Scheduling constrained dynamic applications on clusters, Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM), p.46-es, November 14-19, 1999, Portland, Oregon, United States
	Salvatore Orlando , Paolo Palmerini , Raffaele Perego, Coordinating HPF programs to mix task and data parallelism, Proceedings of the 2000 ACM symposium on Applied computing, p.240-247, March 2000, Como, Italy
	G. Srinivasa N. Prasanna, Compilation of parallel multimedia computations—extending retiming theory and Amdahl's law, ACM SIGPLAN Notices, v.32 n.7, p.180-192, July 1997
	Henri E. Bal , Matthew Haines, Approaches for Integrating Task and Data Parallelism, IEEE Concurrency, v.6 n.3, p.74-84, July 1998
	Jaspal Subhlok , Peter Lieu , Bruce Lowekamp, Automatic node selection for high performance applications on networks, ACM SIGPLAN Notices, v.34 n.8, p.163-172, Aug. 1999
	Jaspal Subhlok , Bwolen Yang, A new model for integrated nested task and data parallel programming, ACM SIGPLAN Notices, v.32 n.7, p.1-12, July 1997
	Mangala Gowri Nanda , Satish Chandra , Vivek Sarkar, Decentralizing execution of composite web services, ACM SIGPLAN Notices, v.39 n.10, October 2004
	James M. Rehg , Kathleen Knobe , Umakishore Ramachandran , Rishiyur S. Nikhil , Arun Chauhan, Integrated task and data parallel support for dynamic applications, Scientific Programming, v.7 n.3-4, p.289-302, August 1999
	Dong-Ik Ko , Shuvra S. Bhattacharyya, The pipeline decomposition tree:: an analysis tool for multiprocessor implementation of image processing applications, Proceedings of the 4th international conference on Hardware/software codesign and system synthesis, October 22-25, 2006, Seoul, Korea
	Anne Benoit , Yves Robert, Mapping pipeline skeletons onto heterogeneous platforms, Journal of Parallel and Distributed Computing, v.68 n.6, p.790-808, June, 2008
	Bruce Lowekamp , Nancy Miller , Thomas Gross , Peter Steenkiste , Jaspal Subhlok , Dean Sutherland, A resource query interface for network-aware applications, Cluster Computing, v.2 n.2, p.139-151, 1999
	Salvatore Orlando , Paolo Palmerini , Raffaele Perego, Mixed data and task parallelism with HPF and PVM, Cluster Computing, v.3 n.3, p.201-213, 2000
	Anne Benoit , Harald Kosch , Veronika Rehn-Sonigo , Yves Robert, Multi-Criteria Scheduling of Pipeline Workflows (and Application To the JPEG Encoder), International Journal of High Performance Computing Applications, v.23 n.2, p.171-187, May 2009