Baruch Awerbuch
Amos Fiat
- AP89.Baruch Awerbuch and David Peleg. Online tracking of mobile users. Technical Memo TM-4 I0, MIT, Lab. for Computer Science, August 1989.Google Scholar
- AP90.Baruch Awerbuch and David Peleg. Sparse partitions. In Prec. 31st IEEE Syrup. on Foundations of Computer Science, pages 503-513, 1990.Google ScholarDigital Library
- AP91.Baruch Awerbuch and David Peleg. Concurrent online tracking of mobile users. In Proceedings of the Annual ACM SIGCOMM Symposium on Communication Architectures and Protocols, Zurich, Switzerland, September 1991. Google ScholarDigital Library
- BBK+90.S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, and A. Wigderson. On the power of randomization in online algorithms. In Proc.of the 22nd Ann. ACM Syrup. on Theory of Computing, pages 379-386, may 1990. Google ScholarDigital Library
- BFR92.Yair Bartal, Amos Fiat, and Yuval Rabani. Competitive algorithms for distributed data management. In Prec. 24th ACM Syrup. on Theory of Computing, pages 39-50, 1992. Google ScholarDigital Library
- BS89.D.L. Black and D.D. Sleator. Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Carnegie-Mellon, 1989.Google Scholar
- CLRW.M. Chrobak, L. Larmore, N. Reingold, and J. Westbrook. Optimal multlproeessor migration algorithm# u#ing work functions, manuscript.Google Scholar
- DF82.D. Dowdy and D. Foster. Comparative models of the file assignment problem. Computing Surveys, 14(2), Jun 1982. Google ScholarDigital Library
- IW.M. lmaze and B.M. Waxman. Dynamic steiner tree problem. SlAM Journal on Discrete Mathematics, 4(3):369- 384, August 1991.Google ScholarDigital Library
- KMRS88.Karlin, Manasse, Rudolpoh, and Sleator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.Google ScholarDigital Library
- MMS88.M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive algorithms or on-line problems. In Prec. 20th ACM Syrup. on Theory of Computing, pages 322-333. ACM SIGACT, ACM, May 1988. Google ScholarDigital Library
- ST85.D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ofthe ACM, 28(2):202- 208, 1985. Google ScholarDigital Library
- Wes.J. Westbrook. Randomized algorithms for multiprocessot page migration, to appear in Prec. of DIMACS Workshop on On-Line Algorithms.Google Scholar
- WY.J. Westbrook and D.K. Yan. Personal communication. unpublished.Google Scholar
Index Terms
- Competitive distributed file allocation
Recommendations
Competitive distributed file allocation
This paper deals with the file allocation problem [6] concerning the dynamic optimization of communication costs to access data in a distributed environment. We develop a dynamic file re-allocation strategy that adapts on-line to a sequence of read and ...
Competitive proportional resource allocation policy for computational grid
Special issue: Computational science of lattice Boltzmann modellingThis paper presents a competitive proportional resource allocation in computational grid. A system model is described that allows agents representing various grid resources, which owned by different real world enterprises, to coordinate their resource ...
An Agent-Based Approach to Full Interoperability and Allocation Transparency in Distributed File Systems
MATA '01: Proceedings of the Third International Workshop on Mobile Agents for Telecommunication ApplicationsModern distributed file system realizations offer only partially resource location transparency, resource location independence, fault tolerance, load balancing, heterogeneity, self-configuration, and simplified user access. Traditional portability ...
Comments