research-article

Trends in Shared Memory Multiprocessing

Authors:

Madan VenugopalAuthors Info & Claims

Computer, Volume 30, Issue 12

Pages 44 - 50

https://doi.org/10.1109/2.642814

Published: 01 December 1997 Publication History

Publisher Site

Abstract

Shared memory multiprocessing is recognized by industry as a key technology for domains such as decision support systems and multimedia processing. Like uniprocessors, shared memory multiprocessors are often built from high-performance microprocessors, so there is a clear transition path from uniprocessor to multiprocessor program implementations. The challenge lies in making this transition as smooth as possible, both in performance and the programming required to achieve it. The first step is to examine the current use of shared memory multiprocessing and arrive at intelligent projections of future use. The second step is to begin filling gaps in programming models and architectures for shared memory multiprocessing. The third step-possibly taken concurrently with the second-is to make the development of parallel software more feasible. Perhaps the greatest challenge is to develop new techniques in the face of a moving hardware target. The community must somehow improve the software and keep pace with constant increases in integration level, on-chip parallelism, and memory hierarchy complexity.

References

[1]

A. Grizzaffi Maynard, et al., "Contrasting Characteristics and Cache Performance of Technical and Multi-User Commercial Workload," in Proc. Int'l Conf. Architectural Support for Programming Languages and Operating Systems, IEEE CS Press, Los Alamitos, Calif., 1994, pp. 145-155.

Crossref

Google Scholar

[2]

M. Venugopal D. Slack and R. Walters, "A Commercial CFD Application on a Shared Memory Multiprocessor," in High Performance Computing, S. Sahni, V. Prasanna, and V. Bhatkar, eds., McGraw-Hill, New York, 1995, pp. 305-310.

Google Scholar

[3]

B. Carlile, "Seeking the Balance: Large SMP Warehouses," Database Programming Design, Aug. 1996, pp. 44-48.

Google Scholar

[4]

S. VanderWiel D. Nathanson and D. Lilja, "Complexity and Performance in Parallel Programming Languages," in Proc. Int'l Workshop High-Level Parallel Programming Models and Supportive Environments, IEEE CS Press, Los Alamitos, Calif., 1997, pp. 3-12.

Crossref

Google Scholar

[5]

R. Wilson, et al., "An Infrastructure for Research on Parallelizing and Optimizing Compilers," SIGPlan Notices, Dec. 1994, pp. 31-37.

Crossref

Google Scholar

[6]

J. Anderson and M. Lam, "Global Optimizations for Parallelism and Locality on Scalable Parallel Machines," in Proc. SIGPlan Conf. Programming Language Design and Implementation, ACM Press, New York, 1993, pp. 112-125.

Crossref

Google Scholar

[7]

P. Stenström, et al., "Boosting the Performance of Shared Memory Multiprocessors," Computer, July 1997, pp. 63-70.

Crossref

Google Scholar

[8]

E. Rothberg J. Pal Singh and A. Gupta, "Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors," in Proc. Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., 1993, pp. 14-25.

Crossref

Google Scholar

[9]

Computer, special issue on billion-transistor architectures, D. Burger and J. Goodman, eds., Sept. 1997, pp. 46-93.

Google Scholar

[10]

G. Sohi S. Breach and T. Vijaykumar, "Multiscalar Processors," in Proc. Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., 1995, pp. 414-425.

Crossref

Google Scholar

[11]

J.-Y. Tsai and P.-C. Yew, "The Superthreaded Architecture: Thread Pipelining with Runtime Data Dependence Checking and Control Speculation," in Proc. Int'l Conf. Parallel Architectures and Compilation Techniques, IEEE CS Press, Los Alamitos, Calif., 1996, pp. 35-46.

Crossref

Google Scholar

[12]

P. Dubey, et al., "Single-Program Speculative Multithreading (SPSM) Architecture: Compiler-Assisted Fine-Grained Multithreading, in Proc. IFIP WG 10.3 Conf. Parallel Architectures and Compilation Techniques, IEEE CS Press, Los Alamitos, Calif., 1995, pp. 109-121.

Crossref

Google Scholar

[13]

L. Smarr and C. Catlett, "Metacomputing," Comm. ACM, June 1992, pp. 45-52.

Crossref

Google Scholar

Cited By

View all

Chishti ZPowell MVijaykumar T(2005)Optimizing Replication, Communication, and Capacity Allocation in CMPsACM SIGARCH Computer Architecture News10.1145/1080695.107000133:2(357-368)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1145/1080695.1070001
Chishti ZPowell MVijaykumar T(2005)Optimizing Replication, Communication, and Capacity Allocation in CMPsProceedings of the 32nd annual international symposium on Computer Architecture10.1109/ISCA.2005.39(357-368)Online publication date: 4-Jun-2005
https://dl.acm.org/doi/10.1109/ISCA.2005.39
Foglia PGiorgi RPrete C(2005)Reducing coherence overhead and boosting performance of high-end SMP multiprocessors running a DSS workloadJournal of Parallel and Distributed Computing10.1016/j.jpdc.2004.10.00365:3(289-306)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1016/j.jpdc.2004.10.003
Show More Cited By

Index Terms

Trends in Shared Memory Multiprocessing

Recommendations

Multigrain shared memory
Multigrain shared memory

Parallel workstations, each comprising tens of processors based on shared memory, promise cost-effective scalable multiprocessing. This article explores the coupling of such small- to medium-scale shared-memory multiprocessors through software over a ...
Automatic fence insertion for shared memory multiprocessing
ICS '03: Proceedings of the 17th annual international conference on Supercomputing

In general, the hardware memory consistency model in a multiprocessor system is not identical to the memory model at the programming language level. Consequently, the programming language memory model must be mapped onto the hardware memory model. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Computer Volume 30, Issue 12

December 1997

89 pages

ISSN:0018-9162

Issue’s Table of Contents

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 December 1997

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 24 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chishti ZPowell MVijaykumar T(2005)Optimizing Replication, Communication, and Capacity Allocation in CMPsACM SIGARCH Computer Architecture News10.1145/1080695.107000133:2(357-368)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1145/1080695.1070001
Chishti ZPowell MVijaykumar T(2005)Optimizing Replication, Communication, and Capacity Allocation in CMPsProceedings of the 32nd annual international symposium on Computer Architecture10.1109/ISCA.2005.39(357-368)Online publication date: 4-Jun-2005
https://dl.acm.org/doi/10.1109/ISCA.2005.39
Foglia PGiorgi RPrete C(2005)Reducing coherence overhead and boosting performance of high-end SMP multiprocessors running a DSS workloadJournal of Parallel and Distributed Computing10.1016/j.jpdc.2004.10.00365:3(289-306)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1016/j.jpdc.2004.10.003
Foglia PGiorgi RPrete C(2004)Speeding-up multiprocessors running DBMS workloads through coherence protocolsInternational Journal of High Performance Computing and Networking10.1504/IJHPCN.2004.0075621:1-3(17-32)Online publication date: 1-Aug-2004
https://dl.acm.org/doi/10.1504/IJHPCN.2004.007562
Na J(2004)A parallel electro-optical computer architecture for artificial intelligenceProceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies10.1007/978-3-540-30501-9_8(30-33)Online publication date: 8-Dec-2004
https://dl.acm.org/doi/10.1007/978-3-540-30501-9_8
Na J(2004)A parallel optical computer architecture for large database and knowledge based systemsProceedings of the First international conference on Computational and Information Science10.1007/978-3-540-30497-5_144(934-939)Online publication date: 16-Dec-2004
https://dl.acm.org/doi/10.1007/978-3-540-30497-5_144
Zhu W(2003)Cluster Queue Structure for Shared-Memory Multiprocessor SystemsThe Journal of Supercomputing10.1023/A:102424702703925:3(215-236)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1023/A%3A1024247027039
Karlsson MStenström P(2000)An analytical model of the working-set sizes in decision-support systemsACM SIGMETRICS Performance Evaluation Review10.1145/345063.33942328:1(275-285)Online publication date: 1-Jun-2000
https://dl.acm.org/doi/10.1145/345063.339423
Karlsson MStenström PBrandwajn AKurose JNain P(2000)An analytical model of the working-set sizes in decision-support systemsProceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems10.1145/339331.339423(275-285)Online publication date: 17-Jun-2000
https://dl.acm.org/doi/10.1145/339331.339423
Giorgi RPrete C(1999)PSCRIEEE Transactions on Parallel and Distributed Systems10.1109/71.78086810:7(742-763)Online publication date: 1-Jul-1999
https://dl.acm.org/doi/10.1109/71.780868
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Multigrain shared memory

Multigrain shared memory

Automatic fence insertion for shared memory multiprocessing

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations