⌕ Поиск по атласу

NIST · ИТ · de2eee6096aa07308331

de2eee6096aa07308331 · A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows

A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows

Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and

Официальный источник · 2017-06-22

Полные импортированные сведения карточки
{
  "title_en": "A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows",
  "designation": "",
  "series": "",
  "status": "",
  "date": "2017-06-22",
  "date_original": "June 22, 2017",
  "url": "https://www.nist.gov/publications/hybrid-task-graph-scheduler-high-performance-image-processing-workflows-0",
  "source": "NIST Publications",
  "display_en": "",
  "authors_en": "Timothy J. Blattner , Walid Keyrouz , Mary C. Brady , Shuvra S. Bhattacharyya, Milton Halem",
  "abstract_excerpt_en": "Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and",
  "id": "de2eee6096aa07308331",
  "sources": [
    "NIST Publications"
  ],
  "source_records": [
    {
      "title_en": "A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows",
      "designation": "",
      "series": "",
      "status": "",
      "date": "2017-06-22",
      "date_original": "June 22, 2017",
      "url": "https://www.nist.gov/publications/hybrid-task-graph-scheduler-high-performance-image-processing-workflows-0",
      "source": "NIST Publications",
      "display_en": "",
      "authors_en": "Timothy J. Blattner , Walid Keyrouz , Mary C. Brady , Shuvra S. Bhattacharyya, Milton Halem",
      "abstract_excerpt_en": "Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and"
    }
  ],
  "translation_state": "none",
  "possible_title_matches": 1
}