Toward Bounds on Parallel Execution Times of Task Graphs on Multicores With Memory Constraints

As more and more parallel programs are migrating to shared computing platforms, bounding their parallel execution times under resource constraints is particularly important for their efficient executions. The parallel program is often modeled as a task graph, which is composed of a collection of con...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Jiangong Song, Qinyong Li, Shilong Ma
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	IEEE 2019-01-01
Edice:	IEEE Access
Témata:	Task graph scheduling time bounds parallel execution multicores shared memory memory constraints
On-line přístup:	https://ieeexplore.ieee.org/document/8685096/
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!