Task Migration in n-dimensional Wormhole-Touted Mesh Multicomputers

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/59979

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/59979

Title:	Task Migration in n-dimensional Wormhole-Touted Mesh Multicomputers
Authors:	張志勇;Chang, Chih-yung;Yu, G.Y.;Chen, T.S.
Contributors:	淡江大學資訊工程學系
Date:	2004-03-01
Issue Date:	2011-10-05 22:32:27 (UTC+8)
Abstract:	In a mesh multicomputer, performing jobs needs to schedule submeshes according to some processor allocation scheme. In order to assign the incoming jobs to a free submesh, a task compaction scheme is needed to generate a larger contiguous free region. The overhead of compaction depends on the efficiency of the task migration scheme. In this paper, two simple task migration schemes are first proposed in n-dimensional mesh multicomputers with supporting dimension-ordered wormhole routing in one-port communication model. Then, a hybrid scheme which combines advantages of the two schemes is discussed. Finally, we evaluate the performance of all of these proposed approaches.
Relation:	Journal of Systems Architecture 50, pp.177-192
DOI:	10.1016/S1383-7621(03)00098-5
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	47	View/Open