Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

An asynchronous communication library for accessing and managing dynamic hash tables over a network of Symmetric Multiprocessors (SMP) is presented. A blocking factor is shown experimentally to reduce the variance of the wall clock time. It is also shown that remote accesses to a distributed hash table can be as effective and scalable as the one-sided operations of the low-level communication middleware on an IBM SP.

REFERENCES

• 1: Ronald F. Boisvert , Roldan Pozo , Karin Remington , Richard F. Barrett , Jack J. Dongarra, Matrix market: a web resource for test matrix collections, Proceedings of the IFIP TC2/WG2.5 working conference on Quality of numerical software: assessment and enhancement, p.125-137, January 1997, Oxford, United Kingdom
• 2: S. Browne , J. Dongarra , N. Garner , G. Ho , P. Mucci, A Portable Programming Interface for Performance Evaluation on Modern Processors, International Journal of High Performance Computing Applications, v.14 n.3, p.189-204, August 2000 [doi>10.1177/109434200001400303]
• 3: Alexandre Carissimi , Marcelo Pasin, Athapascan: An Experience on Mixing MPI Communications and Threads, Proceedings of the 5th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface, p.137-144, September 07-09, 1998
• 4: Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989 [doi>10.1145/63334.63337]
• 5: Giovanni Chiola , Giuseppe Ciaccio, Architectural Issues and Preliminary Benchmarking of a Low-cost Network of Workstations based on Active Messages, Architektur von Rechensystemen, Arbeitsteilige Systemarchitekturen: Konzepte, Lösungen, Anwendungen, Trends - Vorträge der 14. ITG/GI-Fachtagung ARCS '97, p.301-310, September 08-11, 1997
• 6: Gianfranco Ciardo , Joshua Gluckman , David Nicol, DISTRIBUTED STATE-SPACE GENERATION OF DISCRETE-STATE STOCHASTIC MODELS, Institute for Computer Applications in Science and Engineering (ICASE), 1995
• 7: E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM, v.13 n.6, p.377-387, June 1970 [doi>10.1145/362384.362685]
• 8: Geist A., Gropp W., Huss-Lederman S., Lumsdaine A., Lusk E., Saphir W., Skjellum T., and Snir M., "MPI-2: Extending the message-passing interface", Argonne National Laboratory, MCS-P568--0296, 1996.
• 9: Maurice Herlihy, A methodology for implementing highly concurrent data objects, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.5, p.745-770, Nov. 1993 [doi>10.1145/161468.161469]
• 10: High Performance Fortran Forum, "High Performance Fortran Language Specification, version 1.0", CRPC-TR92225. 1993.
• 11: ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets, Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium, p.573, March 30-April 03, 1998
• 12: Knuth D.E. "Linear Probing and Graphs", Algorithmica, 22{4}, 561--568, 1998.
• 13: Malard J.M. and Stewart R.D., "Hidden cost of memory management in asynchronous communication: A Distributed Hash Table Example", poster at Scaling to New Heights Workshop, 2002.
• 14: Richard P. Martin, HPAM: An Active Message Layer for a Network of HP Workstations, University of California at Berkeley, Berkeley, CA, 1996
• 15: Paul E. McKenney, Selecting locking primitives for parallel programming, Communications of the ACM, v.39 n.10, p.75-82, Oct. 1996 [doi>10.1145/236156.236174]
• 16: Miller K., "Moving Finite Element II", SIAM J. Numerical Analysis, 18, 1033--1057, 1981.
• 17: Miller K. and Miller R. N., "Moving Finite Element I", SIAM J. Numerical Analysis, 18, 1019--1032, 1981.
• 18: Bradford Nichols , Dick Buttlar , Jacqueline Proulx Farrell, Pthreads programming, O'Reilly & Associates, Inc., Sebastopol, CA, 1996
• 19: Nieplocha J. and Carpenter B., "ARMCI: A portable remote memory copy library for distributed array libraries and compiler run-time systems", in Springer-Verlag. Lecture Notes in Computer Science 1586, 1999.
• 20: Jaroslaw Nieplocha , Robert J. Harrison , Richard J. Littlefield, Global arrays: a portable “shared-memory” programming model for distributed memory computers, Proceedings of the 1994 conference on Supercomputing, p.340-ff., December 1994, Washington, D.C., United States
• 21: Parashar M. and Browne J.C., "System Engineering for High Performance Computing Software: The HDDA/DAGH Infrastructure for Implementation of Parallel Structured Adaptive Mesh Refinement.", in IMA Volume 117: Structured Adaptive Mesh Refinement (SAMR) Grid Methods, 1--18, 2000.
• 22: Manish Parashar , James C. Browne , Carter Edwards , Kenneth Klimkowski, A common data management infrastructure for adaptive algorithms for PDE solutions, Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM), p.1-22, November 15-21, 1997, San Jose, CA [doi>10.1145/509593.509649]
• 23: Kirk Schloegel , George Karypis , Vipin Kumar, A unified algorithm for load-balancing adaptive scientific simulations, Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM), p.59-es, November 04-10, 2000, Dallas, Texas, United States
• 24: G. Shah , C. Bender, Performance and Experience with LAPI -- A New High-Performance Communication Library for the IBM RS/6000 SP, Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium, p.260, March 30-April 03, 1998
• 25: Hongzhang Shan , Jaswinder P. Singh , Leonid Oliker , Rupak Biswas, A comparison of three programming models for adaptive applications on the Origin2000, Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM), p.11-es, November 04-10, 2000, Dallas, Texas, United States
• 26: Alan Stagg , Jackie Hallberg , Joseph Schmidt, A Parallel, Adaptive Refinement Scheme for Tetrahedral and Triangular Grids, Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing, p.512-518, May 01-05, 2000
• 27: Thomas A. Standish, Data Structure Techniques, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1980
• 28: M. S. Warren , J. K. Salmon, A parallel hashed Oct-Tree N-body algorithm, Proceedings of the 1993 ACM/IEEE conference on Supercomputing, p.12-21, December 1993, Portland, Oregon, United States [doi>10.1145/169627.169640]
• 29: Yelick K., Chakrabarti S., Deprit E., Jones J., Krishnamurthy A., and Wen C., "Parallel Data Structures for Symbolic Computation", in Workshop on Parallel Symbolic Languages and Systems, 1995.
• 30: Zuberek W.M. and Rada I., "Distributed generation of state space for timed Petri Nets", in High Performance Computing Symposium 2001 (HPC'01), 219--227, 2001.

INDEX TERMS

Primary Classification:
  E. Data
  E.2 DATA STORAGE REPRESENTATIONS
      Subjects: Hash-table representations

Additional Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES
      C.1.2 Multiple Data Stream Architectures (Multiprocessors)

  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.4 Systems and Software
          Subjects: Distributed systems

General Terms:
Design, Measurement, Performance