AU Abstracts 2009 - AU Journal - Assumption University of Thailand

More documents

Recommendations

Info

Permuting Ability of Uniaxial 2D and 3D Tori under Dimension-Order Routing Gennady Veselovsky Faculty of Engineering, Assumption University Permutations belong to communications patterns demanded frequently in massively-parallel computers especially of the SIMD type. A permutation is said “admissible” to a given interconnection network if it does not cause blockings in that network under a chosen routing algorithm. Determining the admissibility of a given permutation to various static connecting topologies is a fundamental problem. Based on congruence notion from number theory, this paper presents a simple method which solves admissibility problem for regular permutations to uniaxial 2D and 3D tori under deterministic dimension-order routing commonly used in practice. Here “uniaxial” means that in every routing step all data items participating in a permutation can move along the same axis only. It is assumed that all nodes of a system work in a synchronous fashion what is also characteristic to SIMDs. The efficiency of the method is illustrated by the examples with determining admissibility of some frequently used in parallel programming permutations which belong either to Omega or BPC (bit-permutecomplement) classes. Keywords: Interconnection network, torus, dimension-order routing, permutation admissibility. Presented at: The International Association of Science and Technology for Development (IASTED) International Conference on Parallel and Distributed Computing and Networks (PDCN 2009), Innsbruck, Austria, 17-18 February 2009. Published in: Proc. PDCN 2009. Full paper requisition: 8
Graduate School of Information Technology 9
Page 3 and 4: Abstracts of Scientific Papers Pres
Page 5 and 6: Preface Being an institute of highe
Page 7 and 8: Faculty of Biotechnology 1
Page 9: The Study of Biosurfactant as a Cle
Page 12 and 13: Faculty of Engineering 21 st Inter-
Page 16 and 17: Graduate School of Information Tech
Page 19 and 20: Office of the President 13
Page 21 and 22: Other Uses, and Utilization of Veti
Page 23 and 24: Faculty of Science and Technology 1
Page 25 and 26: A Subjective Scheduler Based on Neu
Page 27 and 28: An Incremental Learning Algorithm f

AU Abstracts 2009 - AU Journal - Assumption University of Thailand

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?