By Topic

Allocating processing power to minimize time costs in parallel software systems

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

3 Author(s)
Qin, B. ; Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA ; Sholl, H.A. ; Ammar, R.A.

Several optimal allocation methods based on the modified computation structure model are proposed. These methods are general, and they achieve optimal processing power allocation in most cases. It is assumed that the underlying computer system has a finite number of processors, all the processors have the same speed and that they communicate with each other through a shared memory. The basic ideas behind these methods are to allocate more processing power to operations having higher time costs and containing more parallel paths. In this way, operations with lower time costs are forced to wait for operations with higher time costs. The time cost can be minimized if all the operations performed in parallel are completed at the same time. It is shown how a computation achieves its minimum time costs while minimizing the required overall processing power

Published in:

System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on  (Volume:i )

Date of Conference:

2-5 Jan 1990