Article

Free access

The power of processor consistency

Authors:

Gil NeigerAuthors Info & Claims

SPAA '93: Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures

Pages 251 - 260

https://doi.org/10.1145/165231.165264

Published: 01 August 1993 Publication History

PDF eReader

References

[1]

$. V. Adve and M. D. Hill. Weak ordering -- a new deftnition. In Proceedings of the Seventeenth Annual/nternational Symposium on Computer Architecture, pages 2-14, 1990.

Digital Library

Google Scholar

[2]

M. Ahamad, J. E. Burns, P. W. Hutto, and G. Neiger. Causal memory. In S. Toueg, P. G. $pirakis, and L. Kirousis, editors, Proceedings of the FiSh International Workshop on Distributed Algorithms, volume 579 of Lecture Notes on Computer Science, pages 9-30. Springer-Verlag, October 1991.

Digital Library

Google Scholar

[3]

M. Ahamad, P. W. Hutto, and R. John. Implementing and programming causal distributed shared memory. In Prx#c.eedings of the Eleventh International Conference on Distributed Computing, pages 274-281, May 1991.

Google Scholar

[4]

H. Attiya, August 1992. Personal communication.

Google Scholar

[5]

H. Attiya and R. Friedman. A correctness condition for high performance multiprocessors. In Proceedings of the Twenty.Fourth A CM Symposium on Theory of Computing, pages 679-690. ACM Press, May 1992.

Digital Library

Google Scholar

[6]

P. Bitar. MIMD synchronization and coherence. Technical Report 90/605, Department of Computer Science, University of California at Berkeley, November 1990.

Google Scholar

[7]

M. Dubois, C. Scheurich, and F. Briggs. Memory access buffering ia multiprocessors. In Proceedings of the Thlrteenth I#zternatlonal #ymposi#tm ovt Comported. A#.- chiteeture, pages 434-442, June 1986.

Digital Library

Google Scholar

[8]

1%. Friedman, March 1993. Personal communication.

Google Scholar

[9]

K. Gharachorloo, S. V. Adve, A. Gupta, J. L. Hennessy, and M. D. Kill. Programming for different memory consistency models. Journal of Parallel and Distributed Systems, 15(4):399-407, August 1992.

Crossref

Google Scholar

[10]

K. Gharachorloo, A. Gupta, and J. Henaessy. Revision to "Memory consistency and event ordering in scalable shared-memory multiprocessors." Unpublished manuscript, March 1993.

Google Scholar

[11]

K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in sealable shared-memory multiprocessots. In Proceedings of the Seventeenth International Symposium on Computer Architecture, pages 15-26, May 1990.

Digital Library

Google Scholar

[12]

P. B. Gibbons and M. Merritt. SpecLfyiag aonblocki#g shared memories (extended abstract). In Proceedings of the Fourth Symposium on Parallel Algorithms and Architectures, pages 306-315. ACM Press, june 1992.

Digital Library

Google Scholar

[13]

P.B. Gibbons, M. Merritt, and K. Gharachorloo. Proving sequential consistency of high-performance shared memories (extended abstract). In Proceedings of the Third Symposium on Parallel Algorithms and Architectures, pages 292-303. ACM Press, J#.ly 1991.

Digital Library

Google Scholar

[14]

J. R. Goodman. Cache consistency and sequential consistency. Technical Report 61, IEEE Scalable Coherent Interface Working Group, March 1989.

Google Scholar

[15]

M. P. Herli_hy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. A CM Transactions on Prograrnmin9 Languages and Systems, 12(3):463-492, July 1990.

Digital Library

Google Scholar

[16]

P. W. Hutto and M. Ahamad. Slow memory: Weakening consistency to enhance concurrency in distributed shared memories. In Proceedings of the Tenth International Conference on Distributed Computing Systems, May 1990. A complete version appears as Technical Report 89/39, School of Information and Computer Science, Georgia Institute of Technology.

Crossref

Google Scholar

[17]

P. Kohli, G. Neiger, and M. Ahamad. A characterization of scalable shared memories. Technical Report 93/04, CoUege of Computing, Georgia Institute of Technoloffy, January 1993.

Digital Library

Google Scholar

[18]

L. Lamport. A new solution of Dijkstra's concurrent prograznmmg problem. Communications of the A CM, 17(8):453-455, August 1974.

Digital Library

Google Scholar

[19]

L. Laznport. How to make a multiprocessor computer that correct executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690--691, September 1979.

Digital Library

Google Scholar

[20]

L. Lamport. On interprocess communication; part I: Basic formalism. Distributed Computing, 1(2):77-85, 1986.

Crossref

Google Scholar

[21]

R. J. Lipton and J. S. Sandberg. PRAM: A scalable shared memory. Technical Report 180-88, Department of Computer Science, Princeton University, September 1988.

Google Scholar

[22]

J. Misra. Axioms for memory access in asynchronous hardware systems. A CM Transactions on Programming Languages and Systems, 8(1):142-153, January 1986.

Digital Library

Google Scholar

[23]

G. L. Peterson. Myths about the mutual exclusion problem, information Processing ~etters, 12(3):115- 116, June 1981.

Google Scholar

Cited By

View all

Bushkov VDziuma DFatourou PGuerraoui R(2018)The PCL TheoremJournal of the ACM10.1145/326614166:1(1-66)Online publication date: 12-Dec-2018
https://dl.acm.org/doi/10.1145/3266141
Wickerson JBatty MSorensen TConstantinides G(2017)Automatically comparing memory consistency modelsACM SIGPLAN Notices10.1145/3093333.300983852:1(190-204)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009838
Wickerson JBatty MSorensen TConstantinides GCastagna GGordon A(2017)Automatically comparing memory consistency modelsProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009838(190-204)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009838
Show More Cited By

Index Terms

The power of processor consistency
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
2. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Parallel computing models

Recommendations

The design of a low-power processor
Data filter cache with word selection cache for low power embedded processor
RACS '13: Proceedings of the 2013 Research in Adaptive and Convergent Systems

Filter cache was proposed to reduce power consumption. The proposers inserted a small and fast cache, which is called Filter Cache, between core and L1 cache. Filter cache reduced the number of accesses to L1 cache and a significant power savings is ...
Selective word reading for high performance and low power processor
RACS '11: Proceedings of the 2011 ACM Symposium on Research in Applied Computation

In this paper, we propose Selective Word Reading (SWR) technique for a low power processor without a loss of performance. The development of this technique was motivated by the differences between store unit sizes per storage level. In typical cases, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SPAA '93: Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures

August 1993

399 pages

ISBN:0897915992

DOI:10.1145/165231

Chairman:
Lawrence Snyder

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

5SPAA93

Sponsor:

European Comp Soc
SIGACT
SIGARCH

5SPAA93: 1993 5th Annual ACM Symposium on Parallel

June 30 - July 2, 1993

Velen, Germany

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

53
Total Citations
View Citations
800
Total Downloads

Downloads (Last 12 months)109
Downloads (Last 6 weeks)9

Reflects downloads up to 30 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bushkov VDziuma DFatourou PGuerraoui R(2018)The PCL TheoremJournal of the ACM10.1145/326614166:1(1-66)Online publication date: 12-Dec-2018
https://dl.acm.org/doi/10.1145/3266141
Wickerson JBatty MSorensen TConstantinides G(2017)Automatically comparing memory consistency modelsACM SIGPLAN Notices10.1145/3093333.300983852:1(190-204)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009838
Wickerson JBatty MSorensen TConstantinides GCastagna GGordon A(2017)Automatically comparing memory consistency modelsProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009838(190-204)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009838
Fatourou P(2017)Concurrency for the Masses: The Paradigm of Software Transactional Memory2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)10.1109/SYNASC.2017.00012(17-22)Online publication date: Sep-2017
https://doi.org/10.1109/SYNASC.2017.00012
Viotti PVukolić M(2016)Consistency in Non-Transactional Distributed Storage SystemsACM Computing Surveys10.1145/292696549:1(1-34)Online publication date: 29-Jun-2016
https://dl.acm.org/doi/10.1145/2926965
Furbach FMeyer RSchneider KSenftleben M(2015)Memory-Model-Aware TestingACM Transactions on Embedded Computing Systems10.1145/275376114:4(1-25)Online publication date: 24-Sep-2015
https://dl.acm.org/doi/10.1145/2753761
Bushkov VDziuma DFatourou PGuerraoui RBlelloch GSanders P(2014)The PCL theoremProceedings of the 26th ACM symposium on Parallelism in algorithms and architectures10.1145/2612669.2612690(178-187)Online publication date: 23-Jun-2014
https://dl.acm.org/doi/10.1145/2612669.2612690
Cheng SHigham LKawash J(2014)Partition consistencyDistributed Computing10.1007/s00446-013-0205-027:5(363-389)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1007/s00446-013-0205-0
Rutgers JBekooij MSmit G(2013)Portable Memory Consistency for Software Managed Distributed Memory in Many-Core SoCProceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum10.1109/IPDPSW.2013.14(212-221)Online publication date: 20-May-2013
https://dl.acm.org/doi/10.1109/IPDPSW.2013.14
Batty MMemarian KOwens SSarkar SSewell PField JHicks M(2012)Clarifying and compiling C/C++ concurrencyProceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2103656.2103717(509-520)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2103656.2103717
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

The design of a low-power processor

Data filter cache with word selection cache for low power embedded processor

Selective word reading for high performance and low power processor