NDLI: A queueing network approach to the module allocation problem in distributed systems

Content Provider	ACM Digital Library
Author	Bryant, R. M. Agre, J. R.
Abstract	Given a collection of distributed programs and the modules they use, the module allocation problem is to determine an assignment of modules to processors that minimizes the total execution cost of the programs. Standard approaches to this problem are based on solving either a network flow problem or a constrained 0-1 integer programming problem. In this paper we discuss an alternative approach to the module allocation problem where a closed, multiclass queueing network is solved to determine the cost of a particular module allocation. The advantage of this approach is that the execution cost can be expressed in terms of performance measures of the system such as response time. An interchange heuristic is proposed as a method of searching for a good module allocation using this model and empirical evidence for the success of the heuristic is given. The heuristic normally finds module allocations with costs within 10 percent of the optimal module allocation. Fast, approximate queueing network solution techniques based on mean-value-analysis allow each heuristic search to be completed in a few seconds of CPU time. The computational complexity of each search is O (M K (K + N) C) where M is the number of modules, K is the number of sites in the network, N is the number of communications processors, and C is the number of distributed program types. It appears that substantial problems of this type could be solved using the methods we describe.
Starting Page	191
Ending Page	204
Page Count	14
File Format	PDF
ISSN	01635999
DOI	10.1145/1010629.805490
Journal	ACM SIGMETRICS Performance Evaluation Review (PERV)
Volume Number	10
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-01-10
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Task allocation problem Distributed computer systems Mean-value analysis File assignment problem Multiclass queueing network model
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A queueing network approach to the module allocation problem in distributed systems

Multiclass queueing networks with population constrainted subnetworks

Improved lineariser methods for queueing networks with queue dependent centres

Performance analysis of multiclass queueing networks

The solution of separable queueing network models using mean value analysis

Performance analysis of an algorithm for concurrency control in replicated database systems

Task allocation in distributed computing systems

On the properties of approximate mean value analysis algorithms for queueing networks

A Better Model for Task Assignment in Server Farms:How Replication can Help

A queueing network approach to the module allocation problem in distributed systems

Similar Documents

A queueing network approach to the module allocation problem in distributed systems

Multiclass queueing networks with population constrainted subnetworks

Improved lineariser methods for queueing networks with queue dependent centres

Performance analysis of multiclass queueing networks

The solution of separable queueing network models using mean value analysis

Performance analysis of an algorithm for concurrency control in replicated database systems

Task allocation in distributed computing systems

On the properties of approximate mean value analysis algorithms for queueing networks

A Better Model for Task Assignment in Server Farms:How Replication can Help

A queueing network approach to the module allocation problem in distributed systems