Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Optimal allocation of file servers in a local network environment
IEEE Transactions on Software Engineering
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Optimal Selection of CPU Speed, Device Capacities, and File Assignments
Journal of the ACM (JACM)
Optimal routing in closed queuing networks
ACM Transactions on Computer Systems (TOCS)
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A General Model for Optimal Static Load Balancing in Star Network Configurations
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Load Balancing in Distributed Systems with Multiple Classes and Site Constraints
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Optimal allocation of multiple class resources in computer systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Single-class bounds of multi-class queuing networks
Journal of the ACM (JACM)
Optimal probabilistic allocation of customer types to servers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Bounding errors introduced by clustering of customers in closed product-form queuing networks
Journal of the ACM (JACM)
Resource Allocation for Primary-Site Fault-Tolerant Systems
IEEE Transactions on Software Engineering
Research: Optimal allocation of clients to file servers
Computer Communications
Heavy-traffic revenue maximization in parallel multiclass queues
Performance Evaluation
| Hi-index | 0.00 |
A product-form queuing network with multiple open and closed chains is considered. Some of the closed chains, which have a single customer each, require allocation of resources in the network so as to maximize a weighted throughput performance criterion. Chains with more than one customer can be decomposed into many chains of one customer each. It is proved that an optimal allocation of resources lies on a vertex (extreme points) of the set of feasible allocations. This considerably reduces the search space for an optimal allocation. Applications of this result in distributed computing are discussed.