𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Algorithms for Dynamic Allocation of Distributed Memory

✍ Scribed by T. Leighton; E. J. Schwabe

Publisher
Springer
Year
1999
Tongue
English
Weight
285 KB
Volume
24
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithms of distributed task allocatio
Algorithms of distributed task allocation for cooperative agents
✍ Sarit Kraus; Tatjana Plotkin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 173 KB

This paper considers the problem of distributed dynamic task allocation by a set of cooperative agents. The paper describes a rather speciΓΏc situation. However, its methods have wide application and, thus, it can be useful to solve general problems of computer science. One of its main ideas is to co

Efficient distributed channel allocation
Efficient distributed channel allocation for cellular networks
✍ G Cao; M Singhal πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 292 KB

The performance of a distributed dynamic channel allocation algorithm is measured by the call blocking rate, the number of messages exchanged per channel acquisition and the delay incurred in acquiring a channel. In general, there are two approaches in designing distributed channel allocation algori

Adaptive Distributed Dynamic Channel All
Adaptive Distributed Dynamic Channel Allocation for Wireless Networks
✍ Anurag Kahol; Sumit Khurana; Sandeep K.S. Gupta; Pradip K. Srimani πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 286 KB

Channel allocation schemes in a mobile computing (wireless) environment can be either static or dynamic. Static allocation offers negligible channel acquisition time and zero message complexity and works well at a low system load; the performance steadily decreases as system load increases since man