"A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling ..."

Tarek Hagras, Jan Janecek (2004)

> Home

Details and statistics

DOI: 10.1109/ISPDC.2004.3

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/ispdc/HagrasJ04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ispdc/HagrasJ04
Tarek Hagras, Jan Janecek:
A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems. ISPDC/HeteroPar 2004: 106-113

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.