
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
José Alberto FernándezZepeda, Ramachandran Vaidyanathan, Jerry L. Trahan, "Scaling Simulation of the FusingRestricted Reconfigurable Mesh," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 9, pp. 861871, September, 1998.  
BibTex  x  
@article{ 10.1109/71.722220, author = {José Alberto FernándezZepeda and Ramachandran Vaidyanathan and Jerry L. Trahan}, title = {Scaling Simulation of the FusingRestricted Reconfigurable Mesh}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {9}, issn = {10459219}, year = {1998}, pages = {861871}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.722220}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Scaling Simulation of the FusingRestricted Reconfigurable Mesh IS  9 SN  10459219 SP861 EP871 EPD  861871 A1  José Alberto FernándezZepeda, A1  Ramachandran Vaidyanathan, A1  Jerry L. Trahan, PY  1998 KW  Reconfigurable mesh KW  scaling simulation KW  simulation overhead KW  concurrent write rules KW  model simulation KW  parallel algorithms. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—This paper deals with the ability of a model to adapt algorithm instances of different sizes to run on a given model size without significant loss of efficiency. The overhead in simulating a step of a large instance of the model on a smaller instance can quantify this ability. A reconfigurable mesh (RMesh) can use its bus structure as a computational resource, presenting an obstacle to efficiently scaling down algorithms to run on a smaller RMesh. We construct a scaling simulation of a FusingRestricted Reconfigurable Mesh (FRMesh), a version of the RMesh. The overhead of this simulation depends only on the simulating machine size and not on the simulated machine size. Previously, the RMesh was not known to admit such a simulation overhead without significantly reducing its computational power. The small overhead holds importance for flexibility in algorithm design and for running algorithms with various input sizes on an available model of given size. The results of this paper extend to a variety of concurrent write rules and also translate to an improved scaling simulation of an unrestricted RMesh.
[1] H.M. Alnuweiri, "Parallel ConstantTime Connectivity Algorithms on a Reconfigurable Network of Processors," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 105110, Jan. 1995.
[2] Y. BenAsher, D. Gordon, and A. Schuster, “Efficient SelfSimulation Algorithms for Reconfigurable Arrays,” J. Parallel Distributed Computing, vol. 30, no. 1, pp. 1–22, 1995.
[3] Y. BenAsher, K.J. Lange, D. Peleg, and A. Schuster, “The Complexity of Reconfiguring Network Models,” Information and Computation, vol. 121, pp. 41–58, 1995.
[4] Y. BenAsher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139153, Oct. 1991.
[5] J. Bruck, L. De Coster, N. Dewulf, C.T. Ho, and R. Lauwereins, "On the Design and Implementation of Broadcast and Global Combine Operations Using the Postal Model," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 256265, Mar. 1996.
[6] J.A. FernándezZepeda, J.L. Trahan, and R. Vaidyanathan, "Scaling the FRMesh under Different Concurrent Write Rules," Proc. World Multiconference Systemics, Cybernetics, and Informatics, pp. 437444, 1997.
[7] J. Gunnels, C. Lin, G. Morrow, and R. van de Geijn, "A Flexible Class of Parallel Matrix Multiplication Algorithms," Proc. 12th Int'l Parallel Processing Symp. and Ninth Symp. Parallel and Distributed Processing, pp. 110116, 1998.
[8] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: AddisonWesley, 1992.
[9] J. Jang, M. Nigam, V.K. Prasanna, and S. Sahni, “Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1, pp. 1–12, Jan. 1997.
[10] R.M. Karp and V. Ramachandran, "Parallel Algorithms for SharedMemory Machines," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, pp. 869941.Amsterdam: NorthHolland, 1990.
[11] T.H. Lai and M.J. Sheng, "Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 806817, Aug. 1996.
[12] H. Li and Q.F. Stout, "Reconfigurable SIMD Massively Parallel Computers," IEEE Proc., vol. 79, no. 4, pp. 429443, Apr. 1991.
[13] R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching: Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 93102, Jan. 1995.
[14] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490506, 1993.
[15] Y. Matias and A. Schuster, "Fast, Efficient Mutual and Self Simulations for Shared Memory and Reconfigurable Mesh," Proc. Seventh Symp. Parallel and Distributed Processing, pp. 238246, 1995.
[16] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678692, June 1993.
[17] M.M. Murshed and R.P. Brent, "Algorithms for Optimal SelfSimulation of Some Restricted Reconfigurable Meshes," Proc. Second Int'l Conf. Computational Intelligence and Multimedia Applications, pp. 734744, 1998.
[18] K. Nakano, "A Bibliography of Published Papers on Dynamically Reconfigurable Architectures," Parallel Processing Letters, vol. 5, no. 1, pp. 111124, Mar. 1995.
[19] N. Nisan and A. TaShma, "Symmetric Logspace Is Closed Under Complement," Proc. 27th ACM Symp Theory of Computing, pp. 140146, 1995.
[20] S. Sahni, "Computing Reconfigurable Bus Architectures," Computer Systems and Education, Balakrishnan et al., eds., pp. 386398.New Delhi, India: Tata McGrawHill, 1994.
[21] J.L. Trahan, A.G. Bourgeois, and R. Vaidyanathan, "Tighter and Broader Complexity Results for Reconfigurable Models," Parallel Processing Letters, to appear.
[22] J.L. Trahan, Y. Pan, R. Vaidyanathan, and A.G. Bourgeois, "Scalable Basic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System," Proc. 10th ISCA Int'l Conf. Parallel and Distributed Computer Systems, pp. 564569, 1997.
[23] J.L. Trahan, R. Vaidyanathan, and R.K. Thiruchelvan, "On the Power of Segmenting and Fusing Buses," J. Parallel and Distributed Computing, vol. 34, no. 1, pp. 8294, Apr. 1996.
[24] J.L. Trahan and R. Vaidyanathan, "Relative Scalability of the Reconfigurable Multiple Bus Machine," Proc. Workshop Reconfigurable Architecture and Algorithms, 1996.
[25] U. Vishkin, "Structural Parallel Algorithmics," Proc. Int'l Colloquium Automata, Languages, and Programming, pp. 363380, 1991.
[26] B. F. Wang and G. H. Chen,“Constant time algorithms for the transitive closure problem and some related graph problems on processor arrays with reconfigurable bus systems,” IEEE Trans. on Parallel and Distributed Systems, vol. 1, no. 4, pp. 500507, 1991.