REPLICATED MODULE ALLOCATION IN LAN-BASED CONCURRENT PROCESSING SYSTEMS

NCUIR > School of Management at National Central University > Graduate Institute of Information Management > journal & Dissertation > Item 987654321/29691

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29691

Title:	REPLICATED MODULE ALLOCATION IN LAN-BASED CONCURRENT PROCESSING SYSTEMS
Authors:	PARK,JS;HO,CY;LOWE,TJ
Contributors:	資訊管理研究所
Keywords:	TASK ALLOCATION;DISTRIBUTED SYSTEMS;ASSIGNMENT;TIME
Date:	1995
Issue Date:	2010-06-29 20:38:21 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	TELECOMMUNICATION SYSTEMS
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

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

社群 sharing