Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Relative Performance of Hardware and Software-Only Directory Protocols Under Latency Tolerating and Reducing Techniques
Responsible organisation
1997 (English)Conference paper, (Refereed) Published
Abstract [en]

In both hardware-only and software-only directory protocols the performance is often limited by memory access stall times. To increase the performance, several latency tolerating and reducing techniques have been proposed and shown effective for hardware-only directory protocols. For software-only directory protocols, the efficiency of a technique depends not only on how effective it is as seen by the local processor, but also on how it impacts the software handler execution overhead in the node where a memory block is allocated. Based on architectural simulations and case studies of three techniques, we find that prefetching can degrade the performance of software-only directory protocols due to useless prefetches. A relaxed memory consistency model hides all write latency for software-only directory protocols, but the software handler overhead is virtually unaffected and now constitutes a larger portion of the execution time. Overall, latency tolerating techniques for software-only directory protocols must be chosen with more care than for hardware-only directory protocols.

Place, publisher, year, edition, pages
Geneva, Switzerland: IEEE , 1997.
Keyword [en]
Network protocols, Data reduction, Storage allocation (computer), Program processors, Computer hardware, Computer simulation, Computer networks, Optimization, Data acquisition
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-9973ISI: A1997BH56G00073Local ID: oai:bth.se:forskinfo5E603E0C3EA3A860C12568A3002CAB53ISBN: 0818677937 (print)OAI: oai:DiVA.org:bth-9973DiVA: diva2:837978
Conference
11th International Parallel Processing Symposium, IPPS 97 Apr 1-5 1997
Note
Also presented at 6th Workshop on Scalable Shared-Memory Multiprocessors, October 1996Available from: 2012-09-18 Created: 2000-03-15 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(58 kB)60 downloads
File information
File name FULLTEXT01.pdfFile size 58 kBChecksum SHA-512
a7967bac18eb919c6a142760e34e034affece4cb6343281991512a59bdcfed7503c686f61126e4e4dee6b54a941555d6a6a106bef2288a45d4fa881b2e991e80
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Grahn, Håkan
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 60 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 40 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf