
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ronald F. DeMara, Yili Tseng, Abdel Ejnioui, "Tiered Algorithm for Distributed Process Quiescence and Termination Detection," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 11, pp. 15291538, November, 2007.  
BibTex  x  
@article{ 10.1109/TPDS.2007.1066, author = {Ronald F. DeMara and Yili Tseng and Abdel Ejnioui}, title = {Tiered Algorithm for Distributed Process Quiescence and Termination Detection}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {18}, number = {11}, issn = {10459219}, year = {2007}, pages = {15291538}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.1066}, 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  Tiered Algorithm for Distributed Process Quiescence and Termination Detection IS  11 SN  10459219 SP1529 EP1538 EPD  15291538 A1  Ronald F. DeMara, A1  Yili Tseng, A1  Abdel Ejnioui, PY  2007 KW  Synchronization KW  Multitasking KW  Distributed Architectures KW  Distributed Programming KW  Parallel Processing VL  18 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] J. Matocha and T. Camp, “A Taxonomy of Distributed Termination Detection Algorithms,” J. Systems and Software, vol. 43, no. 3, pp. 207221, Nov. 1998.
[2] F. Mattern, “Global Quiescence Detection Based on Credit Distribution and Discovery,” Information Processing Letters, vol. 30, no. 4, pp. 195200, Feb. 1989.
[3] W.E. Cohen, D.W. Hyde, and R.K. Gaede, “An Optical BusBased Distributed Dynamic Barrier Mechanism,” IEEE Trans. Computers, vol. 49, no. 12, pp. 13541365, Dec. 2000.
[4] Y. Tseng, R.F. DeMara, and P. Wilder, “DistributedSum Termination Detection Supporting Multithreaded Execution,” Parallel Computing, vol. 29, no. 7, pp. 953968, July 2003.
[5] J. Matocha, “Distributed Termination Detection in a Mobile Wireless Network,” Proc. 36th Ann. ACM Southeast Regional Conf., pp. 207213, 1998.
[6] S. Moh, C. Yu, B. Lee, H.Y. Youn, D. Han, and D. Lee, “FourAry TreeBased Barrier Synchronization for 2D Meshes without Nonmember Involvement,” IEEE Trans. Computers, vol. 50, no. 8, pp. 811823, Aug. 2001.
[7] S. Shang and K. Hwang, “Distributed Hardwired Barrier Synchronization for Scalable Multiprocessor Clusters,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, pp. 591605, June 1995.
[8] A.B. Sinha and L.V. Kale, “A Dynamic and Adaptive Quiescence Detection Algorithm,” Univ. of Illinois, UrbanaChampaign, http://citeseer.ist.psu.edusinha93dynamic.html , 1993.
[9] S. Chandrasekaran and S. Venkatesan, “A MessageOptimal Algorithm for Distributed Termination Detection,” J. Parallel and Distributed Computing, vol. 8, no. 3, pp. 245252, Mar. 1990.
[10] T.H. Lai, Y.C. Tseng, and X. Dong, “A More Efficient MessageOptimal Algorithm for Distributed Termination Detection,” Proc. Sixth Int'l Parallel Processing Symp. (IPPS '92), pp. 646649, 1992.
[11] T.H. Lai, “Termination Detection for Dynamic Distributed Systems with NonFirstInFirstOut Communication,” Parallel and Distributed Computing, vol. 3, no. 4, pp. 577599, Dec. 1986.
[12] D.M. Dhamdhere, S.R. Iyer, and E.K.K. Reddy, “Distributed Termination Detection for Dynamic Systems,” Parallel Computing, vol. 22, no. 14, pp. 20252045, Mar. 1997.
[13] S. Cohen and D. Lehman, “Dynamic Systems and Their Distributed Termination,” Proc. First Ann. ACM Symp. Principles of Distributed Computing (PODC '82), pp. 2933, 1982.
[14] G. Tel and F. Mattern, “The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes,” Proc. Parallel Architectures and Languages in Europe, pp. 137149, 1991.
[15] N.C. Juul and E. Jul, “Comprehensive and Robust Garbage Collection in a Distributed System,” Proc. Int'l Workshop Memory Management (IWMM '92), pp. 103115, Sept. 1992.
[16] G. Stupp, “Stateless Termination Detection,” Proc. 16th Int'l Symp. Distributed Computing (DISC '02), pp. 163172, 2002.
[17] R. DeMara, B. Motlagh, C. Lin, and S. Kuo, “Barrier Synchronization Techniques for Distributed Process Creation,” Proc. Eighth Int'l Parallel Processing Symp. (IPPS '94), pp. 597603, Apr. 1994.
[18] T.W. Crockett and T. Orloff, “Parallel Polygon Rendering for MessagePassing Architectures,” IEEE Parallel and Distributed Technology: Systems and Applications, vol. 2, no. 2, pp. 1728, Summer 1994.
[19] M.P. Herlihy and M.S. McKendry, “TimestampBased Orphan Elimination,” IEEE Trans. Software Eng., vol. 15, no. 7, pp. 825831, July 1989.
[20] L. Svobodova, “FileServers for NetworkBased Distributed Systems,” ACM Computing Surveys, vol. 16, no. 4, pp. 353396, Dec. 1984.
[21] X. Wang and J. Mayo, “A General Model for Detecting Distributed Termination in Dynamic Systems,” Proc. 18th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '04), pp. 2630, Apr. 2004.
[22] A.H. Baker, S. Crivelli, and E.R. Jessup, “An Efficient Parallel Termination Detection Algorithm,” Lawrence Berkeley Laboratory, http://www.cs.colorado.edu/~jessupselected_publications. htm. , 2000.
[23] A. Khokhar, S. Hambrusch, and E. Kocalar, “Termination Detection in DataDriven Parallel Computations/Applications,” J. Parallel and Distributed Computing, vol. 63, no. 3, pp. 312326, Mar. 2003.
[24] K.M. Chandy and J. Misra, “How Processes Learn,” Distributed Computing, vol. 1, no. 1, pp. 4052, Mar. 1986.
[25] E.W. Dijkstra and C.S. Scholten, “Termination Detection for Diffusing Computations,” Information Processing Letters, vol. 11, no. 1, pp. 14, Aug. 1980.
[26] N. Mittal, S. Venkatesan, and S. Peri, “MessageOptimal and LatencyOptimal Termination Detection Algorithms for Arbitrary Topologies,” Proc. 18th Ann. Conf. Distributed Computing (DISC '04), Oct. 2004.
[27] M. Filali, P. Mauran, and G. Padiou, “Refinement Based Validation of an Algorithm for Detecting Distributed Termination,” Proc. 14th Int'l Parallel and Distributed Processing Symp. (IPDPS '00), Workshop Formal Methods for Parallel Programming, pp.10271036, 2000.
[28] D. Kumar, “Development of a Class of Distributed Termination Detection Algorithms,” IEEE Trans. Knowledge and Data Eng., vol. 4, no. 2, pp. 145155, Apr. 1992.
[29] N.R. Mahapatra and S. Dutt, “An Efficient DelayOptimal Distributed Termination Detection Algorithm,” Univ. of Minnesota, http://www.ece.uic.edu/~dutt/papers/parallel jpdctermdetn2003.pdf., 1994.
[30] C. Xu and F.C.M. Lau, “Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 537544, May 1996.
[31] F. Mattern, “Algorithms for Distributed Termination Detection,” Distributed Computing, vol. 2, no. 3, pp. 167175, Sept. 1987.
[32] I. Lavallee and G. Roucairol, “A Fully Distributed Spanning Tree Algorithm,” Information Processing Letters, vol. 23, no. 2, pp. 5562, Aug. 1986.
[33] S.P. Rana, “A Distributed Solution to the Distributed Termination Problem,” Information Processing Letters, vol. 17, no. 1, pp. 4346, July 1983.
[34] J. Mayo and P. Kearns, “Distributed Termination Detection with Roughly Synchronized Clocks,” Information Processing Letters, vol. 52, no. 2, pp. 105108, Oct. 1994.
[35] J. Misra and K.M. Chandy, “Termination Detection of Diffusing Computations in Communicating Sequential Processes,” ACM Trans. Programming Languages and Systems, vol. 4, no. 1, pp. 3743, Jan. 1982.
[36] K. Drake, “Time and Space Efficient Multiprocessor Synchronization and Quiescence Detection,” MS thesis, Dept. of Electrical and Computer Eng., Univ. of Central Florida, 1995.