The FG programming environment

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The FG programming environment: good and good for you

Full text

Pdf (43 KB)

Source

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

Cambridge, Massachusetts, USA

SESSION: Parallel programming models: need, study & position papers table of contents

Pages: 115 - 115

Year of Publication: 2006

ISBN:1-59593-452-9

Author

Elena Riccio Davidson

Dartmouth College

Sponsors

ACM: Association for Computing Machinery
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): 2, Downloads (12 Months): 10, Citation Count: 0

Additional Information:

references 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/1148109.1148128 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	Elena Riccio Davidson and Thomas H. Cormen. The FG programming environment: Reducing source code size for parallel programs running on clusters. In Second Workshop on Productivity and Performance in High-End Computing (P-PHEC), pages 27--34, February 2005.
	2	Tom Leighton, Tight bounds on the complexity of parallel sorting, IEEE Transactions on Computers, v.34 n.4, p.344-354, April 1985