CAPABILITY CLASSES OF MULTIPROCESSOR SYNCHRONIZATION TECHNIQUES

R.F. DeMara, Y. Tseng, K. Drake, and A. Ejnioui

References

  1. [1] F. Mattern, Global quiescence detection based on credit distribution and discovery, Information Processing Letters, 30 (4),1989, 195–200. doi:10.1016/0020-0190(89)90212-3
  2. [2] E.D. Brooks III, The butterfly barrier, International Journalof Parallel Programming, 15 (14), 1986, 295–307. doi:10.1007/BF01407877
  3. [3] N.S. Arenstorf & H.F. Jordan, Comparing barrier algorithms,Parallel Computing, 12, 1989, 157–170. doi:10.1016/0167-8191(89)90050-1
  4. [4] D. Hensgen, R. Kinkel, & U. Manber, Two algorithms forbarrier synchronization, International Journal of Parallel Programming, 17 (1), 1988, 1–17. doi:10.1007/BF01379320
  5. [5] K. Hwang & F.A. Briggs, Computer architecture and parallelprocessing (New York: McGraw-Hill, 1984).
  6. [6] H. Xu, P.K. McKinley, & L.M. Ni, Efficient implementationsof barrier synchronization in wormhole-routed hypercube multicomputers, Journal of Parallel and Distributed Computing,15 (2), 1992, 172–184. doi:10.1016/0743-7315(92)90031-H
  7. [7] S. Chandrasekaran & S. Venkatesan, A message-optimal algorithm for distributed termination detection, Journal of Paralleland Distributed Computing, 8 (3), 1990, 245–252. doi:10.1016/0743-7315(90)90099-B
  8. [8] T.-H. Lai, Y.-C. Tseng, & X. Dong, A more efficient message-optimal algorithm for distributed termination detection, Proc.6th Int. Parallel Processing Symp., Beverly Hills, CA, 1992,646–649. doi:10.1109/IPPS.1992.222991
  9. [9] J.-S. Yang & C.-T. King, Designing tree-based barrier synchronization on 2D meshes networks, IEEE Trans. on Paralleland Distributed Systems, 9 (6), 1998, 526–533. doi:10.1109/71.689440
  10. [10] Y. Sun, P.Y.S. Cheung, & X. Lin, Barrier synchronizationon wormhole-routed networks, IEEE Trans. on Parallel andDistributed Systems, 12 (6), 2001, 583–597. doi:10.1109/71.932712
  11. [11] K. Ghose & D.-C. Cheng, Efficient synchronization schemes forlarge-scale shared-memory multiprocessors, Proc. Int. Conf.on Parallel Processing, Austin, Texas, 1991, 153–158.
  12. [12] H.G. Dietz, R. Hoare, & T. Mattox, A fine-grain parallelarchitecture based on barrier synchronization, Proc. Int. Conf.on Parallel Processing, Bloomingdale, IL, 1996, 247–250.
  13. [13] T. Muhammad, Hardware barrier synchronization for a clusterof personal computers, Department of Electrical Engineering,Purdue University, West Lafayette, Indiana, 1995.
  14. [14] K.H. Cheng & Q. Wang, A simultaneous access design for idleprocessor reactivation and the detection of the terminationof a parallel activity, Journal of Parallel and DistributedComputing, 17 (4), 1993, 370–373. doi:10.1006/jpdc.1993.1036
  15. [15] A.B. Sinha & L.V. Kale, A dynamic and adaptive quiescencedetection algorithm, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana-Champaign,IL, 1993.
  16. [16] S. Shang & K. Hwang, Distributed hardwired barrier synchronization for scalable multiprocessor clusters, IEEE Trans. onParallel and Distributed Systems, 6 (6), 1995, 591–605. doi:10.1109/71.388040
  17. [17] C.J. Beckmann & C.D. Polychronopoulos, Fast barrier synchronization hardware, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana-Champaign,IL, 1990, Report No. 986.
  18. [18] Y. Tseng, R.F. DeMara, & P. Wilder, Distributed-sum termination detection supporting multithreaded execution, ParallelComputing, 29 (7), 2003, 953–968. doi:10.1016/S0167-8191(03)00062-0
  19. [19] Y. Tseng & R.F. DeMara, Communication pattern basedmethodology for performance analysis of termination detectionschemes, Proc. 9th Int. Conf. on Parallel and DistributedSystems, Chungli Taoyuan, Taiwan, December 2002, pp. 535–541.

Important Links:

Go Back