Cart (Loading....) | Create Account
Close category search window

Experience with Multiprocessor Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

This paper presents results of experiments with parallel algorithms. Several versions of four different programs, each representing a class of applications, were tested. All the experiments were performed on Cm*,l a 50-processor computer with a hierarchical structure. The results show that when the structure of an algorithm corresponds well to the structure of the computer, a close-to-linear speedup may be achieved. An attempt was made to analyze the reference patterns and interprocess cooperation and their influence on the performance of the algorithms. Several still-open questions are formulated in the paper and some further research directions are suggested.

Published in:

Computers, IEEE Transactions on  (Volume:C-31 ,  Issue: 4 )

Date of Publication:

April 1982

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.