Complexity Results for Scheduling Problem with non Trivial Topology of Processors - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports (Research Report) Year : 2006

Complexity Results for Scheduling Problem with non Trivial Topology of Processors

Domains

Other
No file

Dates and versions

lirmm-00106286 , version 1 (13-10-2006)

Identifiers

  • HAL Id : lirmm-00106286 , version 1

Cite

Vincent Boudet, Johanne Cohen. Complexity Results for Scheduling Problem with non Trivial Topology of Processors. [Research Report] 06050, LIRMM. 2006. ⟨lirmm-00106286⟩
146 View
0 Download

Share

Gmail Facebook X LinkedIn More