
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Srikanta Tirthapura, Maurice Herlihy, "SelfStabilizing Distributed Queuing," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 7, pp. 646655, July, 2006.  
BibTex  x  
@article{ 10.1109/TPDS.2006.94, author = {Srikanta Tirthapura and Maurice Herlihy}, title = {SelfStabilizing Distributed Queuing}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {17}, number = {7}, issn = {10459219}, year = {2006}, pages = {646655}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.94}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  SelfStabilizing Distributed Queuing IS  7 SN  10459219 SP646 EP655 EPD  646655 A1  Srikanta Tirthapura, A1  Maurice Herlihy, PY  2006 KW  Distributed queue KW  arrow protocol KW  selfstabilization. VL  17 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Distributed queuing is a fundamental coordination problem arising in a variety of applications, including distributed shared memory, distributed directories, and totally ordered multicast. A distributed queue can be used to order events, user operations, or messages in a distributed system. This paper presents a new selfstabilizing distributed queuing protocol. This protocol adds selfstabilizing actions to the
[1] S. Aggarwal and S. Kutten, “Time Optimal SelfStabilizing Spanning Tree Algorithm,” Proc. 13th Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 400410, 1993.
[2] G. Antonoiu and P. Srimani, “Distributed SelfStabilizing Algorithm for Minimum Spanning Tree Construction,” Proc. EuroPar Conf. Parallel Processing, pp. 480487, 1997.
[3] B. Awerbuch, B. PattShamir, and G. Varghese, “SelfStabilization by Local Checking and Correction,” Proc. 31st Ann. IEEE Symp. Foundations of Computer Science (FOCS), pp. 268277, 1991.
[4] M. Demmer and M. Herlihy, “The Arrow Directory Protocol,” Proc. 12th Int'l Symp. Distributed Computing (DISC), pp. 119133, 1998.
[5] E. Dijkstra, “Self Stabilizing Systems in Spite of Distributed Control,” Comm. ACM, vol. 17, pp. 643644, 1974.
[6] S. Dolev, SelfStabilization. MIT Press, 2000.
[7] S. Dolev, A. Israeli, and S. Moran, “SelfStabilization of Dynamic Systems Assuming Only Read/Write Atomicity,” Distributed Computing, vol. 7, no. 1, pp. 316, 1993.
[8] M. Gouda and N. Multari, “Stabilizing Communication Protocols,” IEEE Trans. Computers, vol. 40, no. 4, pp. 448458, Apr. 1991.
[9] M. Herlihy, “The Aleph Toolkit: Support for Scalable Distributed Shared Objects,” Proc. Workshop Comm., Architecture, and Applications for NetworkBased Parallel Computing (CANPC), pp. 137149, 1999.
[10] M. Herlihy and S. Tirthapura, “SelfStabilizing Distributed Queuing,” Proc. 15th Int'l Symp. Distributed Computing (DISC), pp. 209223, 2001.
[11] M. Herlihy, S. Tirthapura, and R. Wattenhofer, “Competitive Concurrent Distributed Queuing,” Proc. 20th ACM Symp. Principles of Distributed Computing (PODC), pp. 127133, 2001.
[12] M. Herlihy, S. Tirthapura, and R. Wattenhofer, “Ordered Multicast and Distributed Swap,” Operating Systems Rev., vol. 35, no. 1, pp. 8596, 2001.
[13] M. Herlihy and M. Warres, “A Tale of Two Directories: Implementing Distributed Shared Objects in Java,” Concurrency: Practice and Experience, vol. 12, no. 7, pp. 555572, 2000.
[14] T. Hu, “Optimum Communication Spanning Trees,” SIAM J. Computing, vol. 3, no. 3, pp. 188195, 1974.
[15] F. Kuhn and R. Wattenhofer, “Dynamic Analysis of the Arrow Distributed Protocol,” Proc. 16th ACM Symp. Parallelism in Algorithms and Architectures (SPAA), pp. 294301, 2004.
[16] M. Nesterenko and M. Mizuno, “A QuorumBased SelfStabilizing Distributed Mutual Exclusion Algorithm,” J. Parallel Parallel and Distributed Computing, vol. 62, no. 2, pp. 284305, 2002.
[17] D. Peleg and E. Reshef, “A Variant of the Arrow Distributed Directory Protocol with Low Average Complexity,” Proc. 26th Int'l Colloquium Automata Languages and Programming (ICALP), July 1999.
[18] K. Raymond, “A TreeBased Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no. 1, pp. 6177, 1989.
[19] M. Schneider, “SelfStabilization,” ACM Computing Surveys, vol. 25, pp. 4567, 1993.
[20] S. Tirthapura, “Distributed Queuing and Applications,” PhD thesis, Brown Univ., 2002.
[21] G. Varghese, “SelfStabilization by Counter Flushing,” Proc. 13th Ann. ACM Symp. Principles of Distributed Computing (PODC), pp. 244253, 1994.
[22] G. Varghese, A. Arora, and M. Gouda, “SelfStabilization by Tree Correction,” Chicago J. Theoretical Computer Science, vol. 3, pp. 132, 1997.