Relating the power of the Multiple Associative Computing (MASC) model to that of reconfigurable bus-based models

  • Authors:
  • Jerry L. Trahan;Mingxian Jin;Wittaya Chantamas;Johnnie W. Baker

  • Affiliations:
  • Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA 70803, United States;Department of Mathematics and Computer Science, Fayetteville State University, Fayetteville, NC 28301, United States;Department of Computer Science, Kent State University, Kent, OH 44242, United States;Department of Computer Science, Kent State University, Kent, OH 44242, United States

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The MASC (Multiple ASsociative Computing) model is a multi-SIMD model that uses control parallelism to coordinate the interaction of data parallel threads and supports associative SIMD computing on each of its threads. There have been a wide range of algorithms developed for this model. Research on using this model in real-time system applications and building a scalable MASC architecture is currently quite active. In this paper, we present simulations between MASC and reconfigurable bus-based models, e.g., various versions of the Reconfigurable Multiple Bus Machine (RMBM). Constant time simulations of the basic RMBM by MASC and vice versa are obtained. Simulations of the segmenting RMBM, fusing RMBM, and extended RMBM by MASC in non-constant time are also discussed. By taking advantage of previously established relationships between RMBM and two other popular parallel computational models, namely, the Reconfigurable Mesh (RM) and the Parallel Random Access Machine (PRAM), we extend our simulation results to further categorize the power of the MASC model in relation to RM and PRAM.