Algorithms of distributed task allocation for cooperative agents
From MaRDI portal
Publication:1575532
DOI10.1016/S0304-3975(98)00175-3zbMath0944.68005MaRDI QIDQ1575532
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Artificial intelligence (68T99)
Related Items
Locality-sensitive task allocation and load balancing in networked multiagent systems: talent versus centrality ⋮ A proposed solution for the load balancing problem on heterogeneous clusters based on a delayed neural network
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable algorithm for two server queue models
- Scheduling subject to resource constraints: Classification and complexity
- Symmetry property of the throughput in closed tandem queueing networks with finite buffers
- PDAC: A data parallel algorithm for the performance analysis of closed queueing networks
- Multiagent negotiation under time constraints
- Collaborative plans for complex group action
- Two Similar Queues in Parallel
- The autostrada queueing problem
- Computational aspects of aggregation in multiple class queueing networks
- A note on waiting times in systems with queues in parallel
- Queuing Network Models with State-Dependent Routing
- Invariance Properties Of Queueing Networks And Their Application To Computer/Communications Systems
- Optimal Selection of CPU Speed, Device Capacities, and File Assignments
- Characteristics of optimal workload allocation for closed queueing networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Optimality of the shortest line discipline
- Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An efficient algorithm for a task allocation problem
- Optimality of the round-robin routing policy
- Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
- Computational algorithms for closed queueing networks with exponential servers
