Throughput concavity and response time convexity
Information Processing Letters
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
A vertex-allocation theorem for resources in queuing networks
Journal of the ACM (JACM)
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
Journal of the ACM (JACM)
An Algorithm for the K Best Solutions of the Resource Allocation Problem
Journal of the ACM (JACM)
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
Convexity and Concavity Properties of Analytic Queuing Models for Computer Systems
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
Scheduling parallelizable tasks: putting it all on the shelf
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal Partitioning of Cache Memory
IEEE Transactions on Computers
A Hierarchical Approach to Parallel Multiquery Scheduling
IEEE Transactions on Parallel and Distributed Systems
DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Disk load balancing for video-on-demand systems
Multimedia Systems
An effective algorithm for parallelizing sort merge joins in the presence of data skew
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
On maximizing service-level-agreement profits
Proceedings of the 3rd ACM conference on Electronic Commerce
On balancing the load in a clustered web farm
ACM Transactions on Internet Technology (TOIT)
Load balancing for clustered web farms
ACM SIGMETRICS Performance Evaluation Review
A Parallel Sort Merge Join Algorithm for Managing Data Skew
IEEE Transactions on Parallel and Distributed Systems
Provisioning servers in the application tier for e-commerce systems
ACM Transactions on Internet Technology (TOIT)
Research: Optimal allocation of clients to file servers
Computer Communications
| Hi-index | 0.01 |
A class-constrained resource allocation problem is considered. In this problem, a set of M heterogeneous resources is to be allocated optimally among a set of L users belonging to K user classes. A set of class allocation constraints, which limit the number of users of a given class that could be allocated to a given resource, is imposed. An algorithm with worst case time complexity O(M (LM + M2 + LK)) is presented along with a proof of its correctness. This problem arises in many areas of resource management in computer systems, such as load balancing in distributed systems, transaction processing in distributed database systems, and session allocation in time-shared computer systems. We illustrate the behavior of this algorithm with an example where file servers are to be allocated to workstations of multiple classes.