咨询与建议

限定检索结果

文献类型

  • 2 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 3 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2 篇 理学
    • 2 篇 数学
  • 2 篇 工学
    • 2 篇 计算机科学与技术...
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 3 篇 parallel task gr...
  • 1 篇 reliability
  • 1 篇 heterogeneous di...
  • 1 篇 fork-join networ...
  • 1 篇 computational co...
  • 1 篇 resource allocat...
  • 1 篇 fault-tolerance
  • 1 篇 cluster
  • 1 篇 directed acyclic...
  • 1 篇 multi criteria s...
  • 1 篇 replicated task ...

机构

  • 1 篇 inst tecnol el l...
  • 1 篇 cnrs in2p3 ctr c...
  • 1 篇 univ hawaii mano...
  • 1 篇 at&t bell labs m...
  • 1 篇 univ lyon cnrs u...

作者

  • 1 篇 wright pe
  • 1 篇 suter frederic
  • 1 篇 desprez frederic
  • 1 篇 casanova henri
  • 1 篇 velarde martinez...
  • 1 篇 hwang fk

语言

  • 3 篇 英文
检索条件"主题词=Parallel Task Graphs"
3 条 记 录,以下是1-10 订阅
排序:
parallel task graphs Scheduling Based on the Internal Structure  18th
Parallel Task Graphs Scheduling Based on the Internal Struct...
收藏 引用
18th Mexican International Conference on Artificial Intelligence (MICAI)
作者: Velarde Martinez, Apolinar Inst Tecnol El Llano Aguascalientes Carretera Aguascalientes San Luis Potosi Km 18 Aguascalientes Aguascalientes Mexico
It is well known that parallel task graphs (PTG) are modeled with Directed Acyclic graphs (DAG tasks). DAG tasks are scheduled in Heterogeneous Distributed Computing Systems (HDCS) for execution with different techniq... 详细信息
来源: 评论
On cluster resource allocation for multiple parallel task graphs
收藏 引用
JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2010年 第12期70卷 1193-1203页
作者: Casanova, Henri Desprez, Frederic Suter, Frederic CNRS IN2P3 Ctr Comp Villeurbanne France Univ Lyon CNRS UMR 5668 LIPENS LyonUCBLINRIA Lyon France Univ Hawaii Manoa Dept Informat & Comp Sci Honolulu HI 96822 USA
Many scientific applications can be structured as parallel task graphs (PTGs) that is graphs of data-parallel tasks Adding data parallelism to a task-parallel application provides opportunities for higher performance ... 详细信息
来源: 评论
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs
收藏 引用
OPERATIONS RESEARCH LETTERS 1996年 第4期19卷 171-174页
作者: Hwang, FK Wright, PE AT&T BELL LABS MURRAY HILLNJ 07974
An n-parallel-task graph consists of an input node nu(0) (the source), an output node nu(n+1) (the sink), and n intermediate task nodes nu(1), nu(2),...,nu(i), with each nu(i), i = 1,...,n having a (directed) inlink f... 详细信息
来源: 评论