Skip Navigation

The Computer Journal 2005 48(1):115-125; doi:10.1093/comjnl/bxh067
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by d'Auriol, B. J.
Right arrow Articles by Molakaseema, R.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?



Grand Challenges

A Parameterized Linear Array with a Reconfigurable Pipelined Bus System: LARPBS(p)

Brian J. d'Auriol * and Rajesh Molakaseema

Department of Computer Science, The University of Texas at El Paso, El Paso, TX 79968-0518, USA

The linear array with a reconfigurable pipelined bus system (LARPBS) is an optical bus-based theoretical parallel computation model. Many parallel algorithms have been proposed using this model of computation. However, a current limitation of the LARPBS model is that it does not provide for performance prediction of these algorithms running on realistic implementations of the LARPBS model. This paper investigates the parameterization of the LARPBS model so as to overcome this limitation. Specifically, a new parameterized parallel computation model, the LARPBS(p) model, is proposed in this paper. The LARPBS(p) model captures computational costs through six abstract parameters: the number of processors, the communication latency, the communication overhead, the network capacity, the computation time and the synchronization time. The proposed parameters and, subsequently, the cost analysis on the LARPBS(p) model are presented. In addition applications of the cost analysis to some primitive operations and to two matrix multiplication algorithms on the LARPBS(p) are also presented. LARPBS(p) is intended to serve as a basis for a more accurate estimation of execution time of algorithms by providing greater detail of the costs involved on the LARPBS.


Received 25 November 2003. Revised 27 September 2004.

* dauriol{at}acm.org


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.