H. Garcia-Molina: "Performance of the Update Algorithms for Replicated Data in a Distributed Database", Ph.D. Dissertation, revised, Computer Science Dept., Stanford University, North Holland, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Performance Modeling of Distributed and Replicated Databases - Nicola, Jarke (2000) (6 citations) (Correct)
....messages per read or write operation, Gray et al. 96] calculate the probability and rate with which transactions wait and deadlocks or reconciliation occur. Ciciani et al. 90] estimate the processing power in MIPS required at each database node to handle a given workload, and similarly [Barbara, Garcia Molina 82] investigate the hardware costs of a distributed database systems to fulfill specific response time requirements. Mukkamala 92] Saha et al. 96] Triantafillou 96] and [Noe, Andressian 87] consider availability under certain replica control protocols as a primary performance criterion. These ....
....75] Open queueing networks allow a varying number of jobs in the system, i.e. the arrival rate does not depend on the number of jobs already in the system. Open networks have been used in many studies [Mc Dermott, Mukkamala 94] Mariasoosai, Singhal 90] Jenq et al. 89] Singhal 86] Garcia Molina 82] Barbara, Garcia Molina 82] Closed queueing networks consider a fixed number of jobs in the system, i.e. a completed job is immediately replaced by a new job. Such networks have been deployed in [Carey, Livny 88,96] Liang, Tripathi 96] Open queueing networks are more realistic than closed ....
[Article contains additional citation context not shown here]
H. Garcia-Molina: "Performance of the Update Algorithms for Replicated Data in a Distributed Database", Ph.D. Dissertation, revised, Computer Science Dept., Stanford University, North Holland, 1982.
Fast Allocation Of Nearby Resources In A Distributed System - Lynch (1980) (18 citations) (Correct)
....C and all A admissible timings t for e, of the quantity t(j) t(i) where reguests( e,i,u) k, where grants(e,j,u) k and grants(e. j l,u) k. Let T(A) denote SuU p 7. The Solution We consider solutions in which each resource process maintains a FIFO queue of waiting users. It is easy to see [G] that deadlock is prevented in a distributed resource allocation system if the resources are linearly ordered (say by ) if each user waits on queues fo all of his rources in increasing order of resources, if he only waits for one resource at a time ( i.e. until reaching the front of the ....
Garcia-Molina, H., "Performance of Update. Algorithms for Replicated Data in a Dis tribeted Database", PhD Thesis, Stanford University, 1979.
Nested Transactions: An Approach to Reliable Distributed Computing - Eliot, Moss (1981) (38 citations) (Correct)
....novel combinations of timestamp and lock methods. A difference between their model and ours is that they were considering replication of objects at different nodes. In addition to the distinction between locking and timestamps, concurrency control may be distributed or centralized. Garcia Molina [Garcia Molina79] has investigated the theoretical performance of both centralized and distributed locking in some detail. He indicates that the simplicity of centralized locking and the lower total number of messages required (compared with distributed schemes) make centralized locking attractive. Centralized ....
....pre analysis of transaction classes and four different protocols for different cases. Gifford uses locking instead of fimest but does use majority consensus similar to Thomas scheme. However, Gilford generalized Thomas one site, one vote rule to weighted voting. Garcia Molina s report [Garcia Molina79] presents a number of different methods for processing updates to a replicated distributed data base. He concludes that centralized locking may promise better performance than a distributed voting algorithm such as Thomas or Gifford s, at least in a number of interesting cases. On the other ....
[Article contains additional citation context not shown here]
Hector Garcia-Molina, "Performance of Update Algorithms for Replicated Data in a Distributed Database", Ph.D. Thesis, Stanford Dept. of Computer Science, available as Stanford Univ. Dept. of Computer Science Report STAN-CS-79-744, June 1979.
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