Optimum Allocation of Processes in a Distributed Environment: A Process-to-Process Approach

The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residin...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of the Operational Research Society Ročník 41; číslo 4; s. 329 - 337
Hlavní autor: Sofianopoulou, Stella
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 01.04.1990
Macmillan Press
Palgrave Macmillan UK
Palgrave
Pergamon Press
Taylor & Francis Ltd
Témata:
Algorithms
Allocations
Applied sciences
Business and Management
Communications processors
Computer systems
Cost allocation
Datasets
Distributed
Distributed computing
distributed processing
Exact sciences and technology
implicit enumeration
Management
Mathematical analysis
Mathematical programming
Objective functions
Operations research
Operations Research/Decision Theory
optimization
Optimum
Processes
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Theoretical Paper
Theoretical Papers
distributed processing
implicit enumeration
optimization
Enumeration
Processor
Resource allocation
Telecommunication switching
Theoretical study
Distributed system
Algorithm
Optimization
ISSN:0160-5682, 1476-9360
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residing on different processors subject to constraints on the processing power and storage c apacity (code-, data-storage and occupancy) of the processors. Constraints imposed on the co-location of certain processes on the same processor are also included. The problem is formulated as a 0-1 linear maximization problem, taking into account only the number of processes involved, while the number of processors required is produced automatically with the optimum solution. An implicit enumeration algorithm is developed which produces an optimum message-passing allocation. Computational results of a set of random problems which have similar characteristics to a real-world application in telecommunications are also presented.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
content type line 23
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.1990.54