題名: An Efficient Tree-Based Processor Allocation Scheme For Mesh Connected Systems
作者: Tsai, Shuen-Fu
Lei, Chin-Laung
Lai, I-Chi
期刊名/會議名稱: 2000 ICS會議
摘要: Processor allocation is one of the key issues in the management of mesh connected systems. In this paper, we propose an efficient tree-based processor allocation scheme, called Tree-Allocation (TA), and an Earliest-Available-First-Reserved (EAFR) strategy for mesh connected systems. The TA scheme uses a binary tree to keep the processor allocation information, and its time complexity is O(NB) where NB is the number of busy meshes. The EAFR strategy reserves an earliest available submesh for the incoming task which cannot be executed immediately. Our simulation results indicate that the TA scheme outperforms other allocation schemes in the literature in terms of the average allocation time, system utilization and average waiting time.
日期: 2006-10-30T02:26:44Z
分類:2000年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002000000123.pdf206.02 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。