More Web Proxy on the site http://driver.im/

article

Performance analysis on a CC-NUMA prototype

Authors:

J. P. WeigelAuthors Info & Claims

IBM Journal of Research and Development, Volume 41, Issue 3

Pages 205 - 214

https://doi.org/10.1147/rd.413.0205

Published: 01 May 1997 Publication History

Abstract

No abstract available.

References

[1]

J. KusKln, D. Ofelt, M. Heinrich, J. Heilein, R. Simoni K. Gharachorloo, J. Chapin, D. Nakahira, J. Baxter, M. Horowitz, A. Gupta, M. Rosenblum, and J. Hennessy, "The Stanford FLASH Multiprocessor," Proceedings of the 21st Annual Symposium on Computer Architecture, Chicago, April 1993, pp. 302-313.

[2]

A. Agarwal, B. Bianchini, D. Chaiken, K. L. Johnson, D. Kranz, J. Kubiatowicz, B.-H. Lim, K. Mackenzie, and D. Yeung, "The MIT Alewife Machine: Architecture and Performance," Proceedings of the 22nd Annual Symposium on Computer Architecture, Santa Margherita, Italy, June 1995, pp. 2-13.

[3]

J. P. Singh, A. Gupta, and M. Levoy, "Parallel Visualization Algorithms: Performance and Architectural Implications," IEEE Computer 27, No. 7, 45-55 (July 1994).

Digital Library

[4]

S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta, "The SPLASH-2 Programs: Characterization and Methodological Considerations," Proceedings of the 22nd Annual Symposium on Computer Architecture, Santa Margherita, Italy, June 1995, pp. 24-36.

[5]

W. Berg, M. Cline, and M. Girou, "Lessons Learned from the OS/400 OO Project," Commun. ACM 38, No. 10, 54-64 (October 1995).

Digital Library

[6]

M. J. Flynn, "Very High-Speed Computing Systems," Proc. IEEE 54, No. 12, 1901-1909 (December 1966).

[7]

P. Stenstrom, T. Joe, and A. Gupta, "Comparative Performance Evaluation of Cache-Coherent NUMA and COMA Architectures," Proceedings of the 19th Annual International Symposium on Computer Architecture, Gold Coast, Australia, May 1992, pp. 80-91.

[8]

J. Gray, The Benchmark Handbook, 2nd Edition, Morgan Kaufmann, San Mateo, CA, 1993.

[9]

"TPC Benchmark, a Standard," Transaction Processing Performance Council (TPC), Los Altos, CA, ITOM International Co., 1989.

[10]

IBM Application System/400 Commercial Performance, IBM manual ZZ20-5871, June 1988; available through IBM branch offices.

[11]

S. J. Eggers, D. R. Keppel, E. J. Koldinger, and H. M. Levy, "Techniques for Efficient Tracing on a Shared-Memory Multiprocessor," Proceedings of Sigmetrics '90, May 1990, pp. 37-46.

[12]

Z. Cvetanovic and D. Bhandarkar, "Characterization of Alpha AXP Performance Using TP and SPEC Workloads," Proceedings of the 21st Annual International Symposium on Computer Architecture, Chicago, April 1994, pp. 60-70.

[13]

V. S. Iyengar, L. H. Trevillyan, and P. Bose, "Representative Traces for Processor Models with Infinite Caches," Proceedings of HPCA-2, San Jose, CA, February 1996, pp. 62-72.

[14]

A. J. Smith, "Cache Memories," ACM Computing Surv. 14, No. 3, 473-530 (September 1982).

Digital Library

[15]

T. Yeh and Y. Patt, "A Comparison of Dynamic Branch Predictors That Use Two Levels of Branch History," Proceedings of the 20th international Symposium on Computer Architecture, May 1993, pp. 257-266.

[16]

M. S. Squillante, D. R. Kaeli, and H. Sinha, "Analytical Models of Workload Behavior and Pipeline Performance," Proceedings of IEEE MASCOTTS, January 1997, pp. 91-96.

[17]

D. R. Kaeli, "Issues in Trace-Driven Simulation," Lecture Notes in Computer Science, No. 729, Performance Evaluation of Computer and Communication Systems, L. Donatiello and R. Nelson, Eds., Springer-Verlag, 1993, pp. 224-244.

[18]

S. R. Goldschmidt and J. L. Hennessy, "The AcCuracy of Trace-Driven Simulations of Multiprocessors," Proceedings of Sigmetrics 1993, Santa Clara, CA, May 1993, pp. 146-157.

[19]

D. R. Kaeli, O. LaMaire, W. White, P. Hennet, and W. Starke, "Real-Time Trace Generation," Int. J. Computer Simulation Special Issue on Tracing Tools 6, No. 1, 53-68 (1996).

[20]

M. Devarakonda and A. Mukherjee, "Issues in Implementation of Cache-Affinity Scheduling," Proceedings of the Winter 1992 USENIX Conference, January 1992, pp. 345-357.

[21]

J. Feldman and C. Retter, Computer Architecture: A Designer's Text Based on a Generic RISC, McGraw-Hill Book Co., Inc., New York, 1994.

Cited By

Appavoo JSilva DKrieger OAuslander MOstrowski MRosenburg BWaterland AWisniewski RXenidis JStumm MSoares L(2007)Experience distributing objects in an SMMP OSACM Transactions on Computer Systems10.1145/1275517.127551825:3(6-es)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1145/1275517.1275518
Wang YKaeli DBanerjee UGallivan KGonzalez A(2003)Profile-guided I/O partitioningProceedings of the 17th annual international conference on Supercomputing10.1145/782814.782850(252-260)Online publication date: 23-Jun-2003
https://dl.acm.org/doi/10.1145/782814.782850
Wang YKaeli DYang K(2003)Source level transformations to improve I/O data partitioningProceedings of the international workshop on Storage network architecture and parallel I/Os10.1145/1162618.1162622(27-35)Online publication date: 28-Sep-2003
https://dl.acm.org/doi/10.1145/1162618.1162622

Index Terms

Performance analysis on a CC-NUMA prototype

Recommendations

Memory system performance of UNIX on CC-NUMA multiprocessors

This study characterizes the performance of a variant of UNIX SVR4 on a large shared-memory multiprocessor and analyzes the effects of possible OS and architectural changes. We use a nonintrusive cache miss monitor to trace the execution of an OS-...
Memory system performance of UNIX on CC-NUMA multiprocessors
SIGMETRICS '95/PERFORMANCE '95: Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems

This study characterizes the performance of a variant of UNIX SVR4 on a large shared-memory multiprocessor and analyzes the effects of possible OS and architectural changes. We use a nonintrusive cache miss monitor to trace the execution of an OS-...
A Two-Level Directory Architecture for Highly Scalable cc-NUMA Multiprocessors

One important issue the designer of a scalable shared-memory multiprocessor must deal with is the amount of extra memory required to store the directory information. It is desirable that the directory memory overhead be kept as low as possible, and that ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IBM Journal of Research and Development

IBM Journal of Research and Development Volume 41, Issue 3

Special issue: performance analysis and its impact on design

May 1997

162 pages

ISSN:0018-8646

Issue’s Table of Contents

Publisher

IBM Corp.

United States

Publication History

Published: 01 May 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Appavoo JSilva DKrieger OAuslander MOstrowski MRosenburg BWaterland AWisniewski RXenidis JStumm MSoares L(2007)Experience distributing objects in an SMMP OSACM Transactions on Computer Systems10.1145/1275517.127551825:3(6-es)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1145/1275517.1275518
Wang YKaeli DBanerjee UGallivan KGonzalez A(2003)Profile-guided I/O partitioningProceedings of the 17th annual international conference on Supercomputing10.1145/782814.782850(252-260)Online publication date: 23-Jun-2003
https://dl.acm.org/doi/10.1145/782814.782850
Wang YKaeli DYang K(2003)Source level transformations to improve I/O data partitioningProceedings of the international workshop on Storage network architecture and parallel I/Os10.1145/1162618.1162622(27-35)Online publication date: 28-Sep-2003
https://dl.acm.org/doi/10.1145/1162618.1162622

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents