Marshall Bern, Daniel H. Greene, Arvind Raghunathan, and Madhu Sudan. Online algorithms for locating checkpoints. In STOC, pages 359--368, 1990. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Space Bounded Server Algorithms - Baliga, Hughes, Shende (1993) (Correct)
....of the current request. Furthermore, our characterization yields an algorithm for deciding whether a given space bounded k server algorithm is competitive on a given finite metric space. The server problem has been used as a model to study algorithms for various other problems. For example, [4] motivated by applications in data compression, debugging and physical simulation, studied on line algorithms for locating checkpoints in long computations, by formulating this as a server problem. 14] studied the specific problem of paging and proved that the competitivity of certain ....
Marshall Bern, Daniel H. Greene, Arvind Raghunathan, and Madhu Sudan. Online algorithms for locating checkpoints. In STOC, pages 359--368, 1990.
Worst Case Analysis for On-Line Scheduling in Real-Time Systems - Wang, Mao (1991) (8 citations) (Correct)
....paging problems [17] Borodin, Linial, and Saks studied the metrical task system problem [5] Manasse, McGeock, and Sleator presented results on the K sever problem. Both the metrical task system and the K sever are abstract models. Other work on the theory of on line algorithms can be found in [9, 3, 7, 2]. From the above discussion, it is clear that on line algorithms is an important research issue. On line algorithms can be applied to many important applications, such as dynamic control and operations research. In this paper, we study on line scheduling in a real time environment. We consider ....
M. Bern, D. H. Greene, A. Raghunathan, and M. Sudan. Online algorithms for locating checkpoints. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 359--368, 1990.
Dynamic Maintenance of Kinematic Structures - Halperin Latombe (1996) (2 citations) (Correct)
....is required to pay a rental cost depending upon the number of servers in use at any given time. This bears some similarity to the data migration and replication problem studied in the online literature [6] Another aspect of the online problem is that servers are allowed to perform excursions [4, 29]. We expect to give our model and results for the online setting in a subsequent paper. ffl In Section 4.3 we outlined a strategy for maintaining the kinematic data structure for tree topologies under the TOTAL cost measure. This was based on applying the BREAK operation to vertices rather than ....
M. BERN, D.H. GREENE, A. RAGHUNATHAN, AND M. SUDAN, Online Algorithms for Locating Checkpoints, Algorithmica, 11 (1994), pp. 33--52.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC