David Ofelt

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Anoop Gupta

> Home > Persons > David Ofelt

Publications

1998
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/isca/KuskinOHHS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isca/KuskinOHHS98
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
1994
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/asplos/HeinrichKOHBSSGNHGRH94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/asplos/HeinrichKOHBSSGNHGRH94
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
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/isca/KuskinOHHSGCNBHGRH94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isca/KuskinOHHSGCNBHGRH94
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

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.