"On the complexity of list scheduling algorithms for distributed-memory ..."

Andrei Radulescu, Arjan J. C. van Gemund (1999)

> Home

Details and statistics

DOI: 10.1145/305138.305162

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ics/RadulescuG99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ics/RadulescuG99
Andrei Radulescu, Arjan J. C. van Gemund:
On the complexity of list scheduling algorithms for distributed-memory systems. International Conference on Supercomputing 1999: 68-75

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.