Article

Free access

Integrating parallel algorithm design with parallel machine models

Authors:

Lan Yang,

Lan JinAuthors Info & Claims

SIGCSE '95: Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education

Pages 131 - 135

https://doi.org/10.1145/199688.199754

Published: 15 March 1995 Publication History

PDF eReader

Abstract

In teaching of Parallel Algorithms, emphasis is usually placed on algorithms that are based on parallel random access machine (PRAM) model, but those algorithms may or may not be efficiently implementable on real parallel machines. In this paper we design parallel algorithms in relation with the actual parallel machine models and show the importance of integrating parallel algorithms with parallel machine models. We discuss this approach using traveling salesperson problem (TSP) as an example.

References

[1]

Brassard, G. and Bratley, P. 1988. Algorithmics: Theory and Practice. Prentice Hall.

Digital Library

Google Scholar

[2]

Hartman, J. and Sanders, D. 1993. Data Parallel Programming: A Transition from Sequential to Parallel Computing. Proceedings of the 1993 ACM Computer Science Education Conference, pp.96-100.

Digital Library

Google Scholar

[3]

Kumar, V. ~t. al. 1994. Introduction to Parallel Computing. The Benjamin/Cummings Publishing Co.

Digital Library

Google Scholar

[4]

Jaja, J. 1992. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Co.

Digital Library

Google Scholar

[5]

Jin, L. et. al. 1992. Parallel Solution of Hough Transform and Convolution Problems- A Novel Multimodal Approach. Proceedings of the 1992 A CM/SIGAPP Symposium on Applied Computing, pp775-781.

Digital Library

Google Scholar

[6]

Stone, H. S. 1993. High-Performance Computer Architecture. Addison-Wesley Publishing Co.

Digital Library

Google Scholar

[7]

Yang, L. et. al. 1993. Solution of Traveling Salesperson Problem (TSP) on Parallel Machine Models. Computer Science Department Technical Report TR1993-07, Cal Poly Pomona.

Google Scholar

Cited By

View all

Shirvani Moghaddam SMoghaddam K(2022)A General Framework for Sorting Large Data Sets Using Independent Subarrays of Approximately Equal LengthIEEE Access10.1109/ACCESS.2022.314598110(11584-11607)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3145981
Carr SMayo JShene C(2003)ThreadMentorJournal on Educational Resources in Computing10.1145/958795.9587963:1(1-es)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/958795.958796
Aziz IHaron NMehat MJung LMustapa AAkhir E(2009)Solving traveling salesman problem on cluster compute nodesWSEAS Transactions on Computers10.5555/1639496.16395098:6(1020-1029)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.5555/1639496.1639509
Show More Cited By

Recommendations

Integrating parallel algorithm design with parallel machine models

In teaching of Parallel Algorithms, emphasis is usually placed on algorithms that are based on parallel random access machine (PRAM) model, but those algorithms may or may not be efficiently implementable on real parallel machines. In this paper we ...
Parallel compilation for a parallel machine
PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation

An application for a parallel computer with multiple, independent processors often includes different programs (functions) for the individual processors; compilation of such functions can proceed independently. We implemented a compiler that exploits ...
Parallel compilation for a parallel machine
Proceedings of the SIGPLAN '89 symposium on Interpreters and interpretive techniques

An application for a parallel computer with multiple, independent processors often includes different programs (functions) for the individual processors; compilation of such functions can proceed independently. We implemented a compiler that exploits ...

Comments

Information & Contributors

Information

Published In

SIGCSE '95: Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education

March 1995

436 pages

ISBN:089791693X

DOI:10.1145/199688

Chairman:
Cary Laxer
Rose-Hulman Institute of Technology, Terre Haute, IN
,
Editors:
Curt M. White
Indiana Univ., Fort Wayne and Purdue Univ., West Lafayette, IN
,
James E. Miller
Univ. of Southern Mississippi, Hattiesburg
,
Judy Gersting
Univ. of Hawaii at Hilo, Hilo

ACM SIGCSE Bulletin Volume 27, Issue 1
March 1995
402 pages
ISSN:0097-8418
DOI:10.1145/199691
Editors:
Curt M. White
Indiana Univ., Fort Wayne and Purdue Univ., West Lafayette, IN
,
James E. Miller
Univ. of Southern Mississippi, Hattiesburg
,
Cary Laxer
Rose-Hulman Institute of Technology, Terre Haute, IN
,
Judy Gersting
Univ. of Hawaii at Hilo, Hilo
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 March 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCSE95

Sponsor:

SIGCSE

SIGCSE95: 26th SIGCSE Technical Symposium on Computer Science Education

March 2 - 4, 1995

Tennessee, Nashville, USA

Acceptance Rates

Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

Upcoming Conference

SIGCSE Virtual 2024

Sponsor:
sigcse

1st ACM Virtual Global Computing Education Conference

December 5 - 8, 2024

Virtual Event , NC , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
447
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)6

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shirvani Moghaddam SMoghaddam K(2022)A General Framework for Sorting Large Data Sets Using Independent Subarrays of Approximately Equal LengthIEEE Access10.1109/ACCESS.2022.314598110(11584-11607)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3145981
Carr SMayo JShene C(2003)ThreadMentorJournal on Educational Resources in Computing10.1145/958795.9587963:1(1-es)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/958795.958796
Aziz IHaron NMehat MJung LMustapa AAkhir E(2009)Solving traveling salesman problem on cluster compute nodesWSEAS Transactions on Computers10.5555/1639496.16395098:6(1020-1029)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.5555/1639496.1639509
Hughes CBuckley JExton CO'Carroll D(SVCR Group) (2005)Towards a Framework for Characterising Concurrent ComprehensionComputer Science Education10.1080/0899340050005652215:1(7-24)Online publication date: Mar-2005
https://doi.org/10.1080/08993400500056522
Schaller NKitchen A(1995)Experiences in teaching parallel computing—five years laterACM SIGCSE Bulletin10.1145/209849.20985227:3(15-20)Online publication date: 1-Sep-1995
https://dl.acm.org/doi/10.1145/209849.209852

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Integrating parallel algorithm design with parallel machine models

Parallel compilation for a parallel machine

Parallel compilation for a parallel machine