Fundamental Ideas for a Parallel Computing Course P. TAKIS METAXAS Computer Science Department, Wellesley College, Wellesley, Massachusetts, { pmetaxas@wellesley. edu) PROPOSED TOPICS In this note we analyze an introductory undergraduate (or early graduate) course that spans the spectrum of what we call parallel computing. Topics should ininterconnection netclude algorithms, work architectures, theory, and programming. The focus of the course should be on the undergraduate level, that is, it should make no unreasonable assumptions about student background, and it should build on top of the core CS courses, in particular data structures and fundamental algorithms. Some knowledge of machine organization is useful but not required. Even though the field of parallel processing is rather young, many of its fundamental ideas have been known for a long time in other fields. Recognizing this fact is essential to our approach, as we to teach parallelism using propose metaphors and knowledge with which students are familiar, either because they appear in real life or because they were learned in other courses. As a general aphorism we may say that the basic idea behind parallelism is to employ many resources to solve a particular problem. For this approach to work, it is necessary
End of preview. The entire article is 3 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/fundamental-ideas-for-a-parallel-computing-course-SixDjg0IUZ
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Fundamental ideas for a parallel computing course
Metaxas, P. Takis
Follow ACM Computing Surveys (CSUR)
, Volume 27 (2)
Association for Computing Machinery – Jun 1, 1995
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
