Open Access Open Access  Restricted Access Subscription Access

Dynamic Pagination for Efficient Memory Management over Distributed Computational Architecture for Swarm Robotics

Ankush Rai

Abstract


In the problem of predetermined paging there involves cost for fetching each page into the cache. We design a dynamic paging algorithm which competes with the available memory for the effective implementation of dynamic paging, devoid of problems associated with memory management. This is the first dynamic paging algorithm for collectively competing with other unused memory stacks and operational register units varying from instance to instance. The proposed algorithm also offers the online sharing of memory storage for ubiquitous computing and by far stretch proves to be effective for implementing cutting edge networking tools for implementation of swarm operations over distributed computer architecture for micro robotic devices.


Keywords


Dynamic Paging, Swarm Robotic, Distributed Computer Architecture

Full Text:

PDF

References


Sleator D. D., Tarjan R. E. Amortized Efficiency of List Update and = Paging Rules. Comm. ACM 1985; 28(2): 202– 208p.

Fiat A., Karp R. M., Luby M., et al. Competitive Paging Algorithms. J. Algorithm. 1991; 12(4): 685–699p.

Sandy Irani. Page Replacement with Multi-size Pages and Applications toWeb Caching. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, New York, 1997, 701–710p.

Irani S.. Randomized Weighted Caching with Two Page Weights. Algorithmica 2002; 32(4): 624–640p.

Koutsoupias E., Papadimitriou C. H. On the K-server Conjecture. J. ACM 1995; 42(5): 971–983p.

McGeoch L.A., Sleator D.D. A Strongly Competitive Randomized Paging Algorithm. Algorithmica 1991; 6(6): 816– 825p.

Achlioptas D., Chrobak M., Noga J. Competitive Analysis of Randomized Paging Algorithms. Theor. Comp. Sc. 2000; 234(1-2): 203–218p.

Borodin A., R. El-Yaniv, Online Computation and Competitive Analysis,

Cambridge University Press, 1998.

Chrobak M., Karloff H. J., Payne T. H., et al. New Results on Server Problems. SIAM J. Discrete Math 1991; 4(2): 172– 181p.

Borodin A., Linial N., Saks M. An Optimal Online Algorithm for Metrical

Task Systems. In Proceedings of the 19th Annual ACM Symosium on Theory of Computing, New York City, NY, 1987, 373–382p.

Mark S. Manasse, Lyle A. McGeoch, Daniel D. Sleator. Competitive Algorithms for Server Problems. J. Algorithm. 1990; 11(2): 208–230p.

Albers S. Online Algorithms: A Survey. Math. Program. 2003; 97: 3–26p.

Young N. E. The K-server Dual and Loose Competitiveness for Paging.

Algorithmica 1994; 11(6): 525–541p.


Refbacks

  • There are currently no refbacks.


This site has been shifted to https://stmcomputers.stmjournals.com/