By Topic

The Computation of Window Operations on a Parallel Organized Computer—A Case Study

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
$33 $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)
Shi-Kuo Chang ; Instituite of Mathematics, Academia Sinica

The computation of window operations and arbitrary local operations on a parallel organized computer is studied. It is shown that for the window operations, the computation time can be minimized, subject to the restriction of memory accessibility. It is also shown that the computation time increases as the degree of disorderliness of a local operation increases.

Published in:

IEEE Transactions on Computers  (Volume:C-22 ,  Issue: 1 )