Computing on the restricted LARPBS model

  • Authors:
  • Yi Pan

  • Affiliations:
  • Georgia State University, Atlanta, GA

  • Venue:
  • ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many algorithms have been designed on models using pipelined optical buses by several research groups. Linear array with a reconfigurable pipelined bus system (LARPBS) is one such model. The results in the literature show that most of the basic operations can be executed in O(1) bus cycles on the LARPBS model. However, since a bus cycle time is proportional to the number of processors attached to it, a bus cycle is not really a constant time when the number of processors is large. In this paper, a more realistic model called restricted-LARPBS (RLARPBS) model is proposed, where a bus cycle can only accommodate a limited number of messages. We use a parameter to characterize this feature. Under the new model, we propose several basic data movement operations. Their time complexities are also analyzed.