Dataset - CKAN

Tree traversals with task-memory affinities

We study the complexity of traversing tree-shaped workflows whose tasks require large I/O files. We target a heterogeneous architecture with two resource types, each...
- HTML
On optimal tree traversals for sparse matrix factorization

12 pages
- HTML

You can also access this registry using the API (see API Docs).