z-logo
open-access-imgOpen Access
Is Acyclic Directed Graph Partitioning Effective for Locality-Aware Scheduling?
Author(s) -
Yusuf Özkaya,
Anne Benoît,
Ümit V. Çatalyürek
Publication year - 2019
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - directed acyclic graph , computer science , locality , parallel computing , scheduling (production processes) , computation , memory hierarchy , directed graph , theoretical computer science , distributed computing , algorithm , mathematics , cache , mathematical optimization , linguistics , philosophy

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here