default search action
John L. Hennessy
- > Home > Persons > John L. Hennessy
Publications
- 1999
- [j33]John L. Hennessy, Mark A. Heinrich, Anoop Gupta:
Cache-coherent distributed shared memory: perspectives on its development and future challenges. Proc. IEEE 87(3): 418-429 (1999) - [j32]Mark A. Heinrich, Vijayaraghavan Soundararajan, John L. Hennessy, Anoop Gupta:
A Quantitative Analysis of the Performance and Scalability of Distributed Shared Memory. IEEE Trans. Computers 48(2): 205-217 (1999) - 1998
- [c60]Vijayaraghavan Soundararajan, Mark A. Heinrich, Ben Verghese, Kourosh Gharachorloo, Anoop Gupta, John L. Hennessy:
Flexible Use of Memory for Replication/Migration in Cache-Coherent DSM Multiprocessors. ISCA 1998: 342-355 - [c58]Kourosh Gharachorloo, Daniel Lenoski, James Laudon, Phillip B. Gibbons, Anoop Gupta, John L. Hennessy:
Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. 25 Years ISCA: Retrospectives and Reprints 1998: 376-387 - [c57]Daniel Lenoski, James Laudon, Truman Joe, David Nakahira, Luis Stevens, Anoop Gupta, John L. Hennessy:
The DASH Prototype: Implementation and Performance. 25 Years ISCA: Retrospectives and Reprints 1998: 418-429 - [c56]Jeffrey Kuskin, David Ofelt, Mark A. Heinrich, John Heinlein, Richard Simoni, Kourosh Gharachorloo, John Chapin, David Nakahira, Joel Baxter, Mark Horowitz, Anoop Gupta, Mendel Rosenblum, John L. Hennessy:
The Stanford FLASH Multiprocessor. 25 Years ISCA: Retrospectives and Reprints 1998: 485-496 - 1995
- [j28]Jaswinder Pal Singh, Chris Holt, Takashi Totsuka, Anoop Gupta, John L. Hennessy:
Load Balancing and Data locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Rasiosity. J. Parallel Distributed Comput. 27(2): 118-141 (1995) - [j27]Jaswinder Pal Singh, John L. Hennessy, Anoop Gupta:
Implications of Hierarchical N-Body Methods for Multiprocessor Architectures. ACM Trans. Comput. Syst. 13(2): 141-202 (1995) - 1994
- [j26]Rohit Chandra, Anoop Gupta, John L. Hennessy:
COOL: An Object-Based Language for Parallel Programming. Computer 27(8): 13-26 (1994) - [c49]Mark A. Heinrich, Jeffrey Kuskin, David Ofelt, John Heinlein, Joel Baxter, Jaswinder Pal Singh, Richard Simoni, Kourosh Gharachorloo, David Nakahira, Mark Horowitz, Anoop Gupta, Mendel Rosenblum, John L. Hennessy:
The Performance Impact of Flexibility in the Stanford FLASH Multiprocessor. ASPLOS 1994: 274-285 - [c47]Jeffrey Kuskin, David Ofelt, Mark A. Heinrich, John Heinlein, Richard Simoni, Kourosh Gharachorloo, John Chapin, David Nakahira, Joel Baxter, Mark Horowitz, Anoop Gupta, Mendel Rosenblum, John L. Hennessy:
The Stanford FLASH Multiprocessor. ISCA 1994: 302-313 - 1993
- [j23]Jaswinder Pal Singh, John L. Hennessy, Anoop Gupta:
Scaling Parallel Programs for Multiprocessors: Methodology and Examples. Computer 26(7): 42-50 (1993) - [j20]Daniel Lenoski, James Laudon, Truman Joe, David Nakahira, Luis Stevens, Anoop Gupta, John L. Hennessy:
The DASH Prototype: Logic Overhead and Performance. IEEE Trans. Parallel Distributed Syst. 4(1): 41-61 (1993) - [c46]Rohit Chandra, Anoop Gupta, John L. Hennessy:
Data Locality and Load Balancing in COOL. PPoPP 1993: 249-259 - [c45]Jaswinder Pal Singh, Chris Holt, John L. Hennessy, Anoop Gupta:
A parallel adaptive fast multipole method. SC 1993: 54-65 - [c44]Jaswinder Pal Singh, Truman Joe, Anoop Gupta, John L. Hennessy:
An empirical comparison of the Kendall Square Research KSR-1 and Stanford DASH multiprocessors. SC 1993: 214-225 - 1992
- [j19]Daniel Lenoski, James Laudon, Kourosh Gharachorloo, Wolf-Dietrich Weber, Anoop Gupta, John L. Hennessy, Mark Horowitz, Monica S. Lam:
The Stanford Dash Multiprocessor. Computer 25(3): 63-79 (1992) - [j17]Kourosh Gharachorloo, Sarita V. Adve, Anoop Gupta, John L. Hennessy, Mark D. Hill:
Programming for Different Memory Consistency Models. J. Parallel Distributed Comput. 15(4): 399-407 (1992) - [c42]Josep Torrellas, Anoop Gupta, John L. Hennessy:
Characterizing the Caching and Synchronization Performance of a Multiprocessor Operating System. ASPLOS 1992: 162-174 - [c41]Kourosh Gharachorloo, Anoop Gupta, John L. Hennessy:
Hiding Memory Latency using Dynamic Scheduling in Shared-Memory Multiprocessors. ISCA 1992: 22-33 - [c40]Daniel Lenoski, James Laudon, Truman Joe, David Nakahira, Luis Stevens, Anoop Gupta, John L. Hennessy:
The DASH Prototype: Implementation and Performance. ISCA 1992: 92-103 - 1991
- [c38]Kourosh Gharachorloo, Anoop Gupta, John L. Hennessy:
Performance Evaluation of Memory Consistency Models for Shared Memory Multiprocessors. ASPLOS 1991: 245-257 - [c35]Kourosh Gharachorloo, Anoop Gupta, John L. Hennessy:
Two Techniques to Enhance the Performance of Memory Consistency Models. ICPP (1) 1991: 355-364 - [c34]Anoop Gupta, John L. Hennessy, Kourosh Gharachorloo, Todd C. Mowry, Wolf-Dietrich Weber:
Comparative Evaluation of Latency Reducing and Tolerating Techniques. ISCA 1991: 254-263 - 1990
- [c29]Daniel Lenoski, Kourosh Gharachorloo, James Laudon, Anoop Gupta, John L. Hennessy, Mark Horowitz, Monica Lam:
Design of scalable shared-memory multiprocessors: the DASH approach. Compcon 1990: 62-67 - [c26]Kourosh Gharachorloo, Daniel Lenoski, James Laudon, Phillip B. Gibbons, Anoop Gupta, John L. Hennessy:
Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. ISCA 1990: 15-26 - [c25]Daniel Lenoski, James Laudon, Kourosh Gharachorloo, Anoop Gupta, John L. Hennessy:
The Directory-Based Cache Coherence Protocol for the DASH Multiprocessor. ISCA 1990: 148-159
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint