Abstract
A cornerstone of scientific progress is the ability to reproduce experimental results. However, in the context of network benchmarking, system complexity impedes a researcher’s attempts to record all of the information needed to exactly reconstruct a network-benchmarking experiment. Without this information, results may be misinterpreted and are unlikely to be reproducible.
This paper presents a tool called coNCePTuaL which simplifies most aspects of recording and presenting network performance data. coNCePTuaL includes two core components: (1) a compiler for a high-level, domain-specific programming language that makes it possible to specify arbitrary communication patterns tersely but precisely and (2) a complementary run-time library that obviates the need for writing (and debugging!) all of the mundane but necessary routines needed for benchmarking, such as those that calibrate timers, compute statistics, or output log files. The result is that coNCePTuaL makes it easy to present network-performance data in a form that promotes reproducibility.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Butler, R.M., Lusk, E.L.: Monitors, messages, and clusters: The p4 parallel programming system. Parallel Computing 20, 547–564 (1994)
LAN/MAN Standards Committee: Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications. IEEE Standard 802.3, IEEE Computer Society, Technical Committee on Computer Communications, New York (2002)
Petrini, F., Feng, W., Hoisie, A., Coll, S., Frachtenberg, E.: The Quadrics network: High-performance clustering technology. IEEE Micro 22, 46–57 (2002)
Message Passing Interface Forum: MPI: A Message-Passing Interface Standard (1995)
Gropp, W., Lusk, E., Doss, N., Skjellum, A.: A high-performance, portable implementation of the MPI message passing interface standard. Parallel Computing 22, 789–828 (1996)
Aycock, J.: Compiling little languages in Python. In: Proceedings of the Seventh International Python Conference, Houston, Texas, pp. 69–77 (1998)
Pakin, S.: coNCePTuaL user’s guide. Los Alamos Unclassified Report 03-7356, Los Alamos National Laboratory, Los Alamos, New Mexico pakin/papers/conceptual.pdf (2003), Available from http://www.c3.lanl.gov/
Drake, J.B., Hammond, S., James, R., Worley, P.H.: Performance tuning and evaluation of a parallel community climate model. In: Proceedings of SC 1999, Portland, Oregon (1999)
Monk, L., Games, R., Ramsdell, J., Kanevsky, A., Brown, C., Lee, P.: Real-time communications scheduling: Final report. Technical Report MTR 97B0000069, The MITRE Corporation, Bedford, Massachusetts (1997)
Pallas, GmbH: Pallas MPI Benchmarks—PMB, Part MPI-1. (2000)
Reussner, R., Sanders, P., Prechelt, L., Müller, M.: SKaMPI: A detailed, accurate MPI benchmark. In: Alexandrov, V.N., Dongarra, J. (eds.) PVM/MPI 1998. LNCS, vol. 1497, pp. 52–62. Springer, Heidelberg (1998)
Hoisie, A., Lubeck, O., Wasserman, H.: Performance and scalability analysis of teraflop-scale parallel architectures using multidimensional wavefront applications. The International Journal of High Performance Computing Applications 14 (2000)
Petrini, F., Kerbyson, D.J., Pakin, S.: The case of the missing supercomputer performance: Achieving optimal performance on the 8,192 processors of ASCI Q. In: Proceedings of SC 2003, Phoenix, Arizona (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pakin, S. (2004). Reproducible Network Benchmarks with coNCePTuaL . In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive