"Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory ..."

Daniel Reidenbach, Markus L. Schmid (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-21254-3_37

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lata/ReidenbachS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/ReidenbachS11
Daniel Reidenbach, Markus L. Schmid:
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access. LATA 2011: 465-476

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.