检索结果-内蒙古大学图书馆

distributed computing on cluster systems

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2001年第3期78卷 383-397页

作者： Saman, MY Evans, DJ Nottingham Trent Univ Dept Comp Nottingham NG1 4BU England Univ Pertanian Malaysia Fac Comp Sci & Informat Technol Serdang 43400 Selangor Malaysia

Message Passing Interface (MPI) allows a group of computers in a network to be specified as a cluster system. It provides the routines for task activation and communication. Writing programs for a cluster system is a difficult job. In this paper: the Message+passing Interface is presented. parallel programs using the WMPI, a version of MPI, to solve the pi(pi) calculation the quick sort algorithm and the Torsion problem are presented. The programs are written and compiled in Microsoft Visual C + +.

关键词： message-passing programming parallel and distributed computers cluster systems

来源：评论

学校读者我要写书评

暂无评论

On considering communication in scheduling task graphs on parallel processors

引用

parallel Algorithms and Applications 1994年第3-4期3卷 177-191页

作者： El-Rewini, Hesham Ali, Hesham H. Department of Computer Science University of Nebraska at Omaha Omaha NE 68182 United States

The problem of scheduling task graphs on multiprocessor systems is known to be NP-complete in its general form as well as many restricted cases. Few polynomial algorithms have been developed for solving special cases of this problem when the communication cost is ignored. The complexity of the problem rises even further when communication among tasks is considered. Several different models have been used by researchers to compute the communication cost. The complexity of the problem changes based on which cost model is used to estimate the communication cost. Several versions of the scheduling problem with communication were proven to be NP-complete using different models [10, 11]. In this paper, we first survey the different communication models. Focusing on one of these models, we study the effect of considering communication on the relationship between the two-processor scheduling problem and the problem of finding maximum matching in the complement of the task graph. We introduce the idea of augmented task graphs and show that in some cases scheduling an augmented graph without considering communication is equivalent to scheduling the original task graph with communication. We show that the problem of scheduling an arbitrary task graph with communication on two processors can be reduced to the problem of constructing an augmented graph. We introduce a polynomial algorithm to optimally schedule a tree-structured task graph with communication on two processors by the construction of its augmented graph. We also prove the optimality of the introduced algorithm. © 1994, Taylor & Francis Group, LLC. All rights reserved.

关键词： Augmented task graphs Communication models Maximum matching parallel and distributed computers Scheduling algorithms Task graphs Tree-structured graphs Two-processor scheduling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：