REPLICATED MODULE ALLOCATION IN LAN-BASED CONCURRENT PROCESSING SYSTEMS

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29691

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29691

题名:	REPLICATED MODULE ALLOCATION IN LAN-BASED CONCURRENT PROCESSING SYSTEMS
作者:	PARK,JS;HO,CY;LOWE,TJ
贡献者:	資訊管理研究所
关键词:	TASK ALLOCATION;DISTRIBUTED SYSTEMS;ASSIGNMENT;TIME
日期:	1995
上传时间:	2010-06-29 20:38:21 (UTC+8)
出版者:	中央大學
摘要:	We consider a problem involving the design of a system for concurrent processing of application software using multiple processors on a local area network. The task control-flow graph which graphically describes the software logic is allowed to be an arbitrary directed multigraph. We establish equations of flow conservation which arise in the execution of modules on the set of interconnected processors. Incorporating these equations, we develop a mixed integer programming model to find an optimal allocation of program modules, with possible replications, to the set of capacitated processors. The objective is to minimize the total interprocessor communication cost and module execution cost subject to the capacity constraints of processors and the broadcast channel. The decisions involved are: how many copies of each module should be maintained; how to allocate module copies across processors; and how to distribute invocations of each module across its copies on different processors. We report numerical results from solving the model.
關聯:	TELECOMMUNICATION SYSTEMS
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	391	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing