Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Queue processor architecture for novel queue computing paradigm based on produced order scheme

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Abderazek, B.A. ; Graduate Sch. of Inf. Syst., Electro-Commun. Univ., Tokyo, Japan ; Arsenji, M. ; Shigeta, S. ; Yoshinaga, T.
more authors

This work proposes a novel produced order parallel queue processor architecture. To store intermediate results, the proposed system uses a FIFO queue registers instead of random access registers. Datum is inserted in the queue in produced order scheme and can be reused. We show that this feature has a profound implication in the areas of parallel execution, programs compactness, hardware simplicity and high execution speed. Our preliminary performance evaluations have shown a significant performance improvement (e.g., 10% to 26% decrease in program size and 6% to 46% decrease in execution time over a range of benchmark programs) when compared with the earlier proposed architecture.

Published in:

High Performance Computing and Grid in Asia Pacific Region, 2004. Proceedings. Seventh International Conference on

Date of Conference:

20-22 July 2004