.png){kind=icon}
返回
Compiler support for task scheduling in hierarchical execution models
.png){kind=icon}
PRE
AI
DOI：10.1016/S1383-7621(98)00019-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Algorithms from scientific computing often exhibit a two-level parallelism based on potential method parallelism and potential system parallelism. We consider the parallel implementation of those algorithms on distributed memory machines. The two-level potential parallelism of algorithms is expressed in a specification consisting of an upper level hierarchy of multiprocessor tasks each of which has an internal structure of uniprocessor tasks. To achieve an optimal parallel execution time, the parallel execution of such a program requires an optimal scheduling of the multiprocessor tasks and an appropriate treatment of uniprocessor tasks. For an important subclass of structured method parallelism we present a scheduling methodology which takes data redistributions between multiprocessor tasks into account. As costs we use realistic parallel runtimes. The scheduling methodology is designed for an integration into a parallel compiler tool. We illustrate the multitask scheduling by several examples from numerical analysis. (C) 1999 Elsevier Science B.V. All rights reserved.
Keyword:
RUNGE-KUTTA METHODS
PARALLEL IMPLEMENTATIONS
EXTRAPOLATION METHODS
COMPUTATION
ALGORITHMS
COMPUTERS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
暂无机构信息
引用论文
分享收藏Apathy Antedating and Evolving With Dementia: A Case Report and Insights Into Apathy as a Network Dysfunction.png)
Cureus
OAAI
CureusIF0
OAAI分享收藏
查看更多内容