The master-slave paradigm with heterogeneous processors

Master-slave Tasking on Heterogeneous Processors

In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assume that communication-computation overlap is possible for every processor, but only allow one send and one receive at a time. We propose an algorithm for chains of processors based on an iterative backward construction ...

The Master-Slave Paradigm on Heterogeneous Systems: A Dynamic Programming Approach for the Optimal Mapping

We study the master–slave paradigm over heterogeneous systems. According to an analytical model, we develop a dynamic programming algorithm that allows to solve the optimal mapping for such paradigm. Our proposal considers heterogeneity due both to computation and also to communication. The optimization strategy used allows to obtain the set of processors for an optimal computation. The computa...

The master-slave paradigm in parallel computer and industrial settings

������������������������� � Master-Slave ������

近些年来,随着计算机的计算能力和存储能力的飞速发展,科学计算的规模越来越大,在气象、生物技术、 油藏模拟、核技术等领域,用于计算的网格已达到百万、千万乃至数十亿,计算的数据结果也已达到 GB 乃至 TB 大小。而和计算、存储技术的飞速发展相比,由于受材料、电子等工艺的限制,计算机的显示尺寸的发展相对滞 后。如何能够快速、准确的表现海量数据已经成为一个亟需解决的问题。它不仅包括如何以更大的屏幕来显示数 据,还包括如何以更快的速度来处理数据。 使用并行计算技术的大屏幕显示是解决上述问题一个很好的途径。采用多个显示设备取代原来的单个显示设 备使得显示屏幕增大为相应的倍数;各个显示设备由单独的计算机进行驱动,计算任务的分担使得显示速度也大 大提高。 除了在科学计算方面的应用外,大屏幕显示作为一种“半沉浸式”的虚拟环境,在虚拟战场、视频会议、公 共场合演示等方面也有着广泛的应用。 大屏幕显示技...

Complexity of master-slave tasking on heterogeneous trees

In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors and network, where processing times and communications times are different. We assume that communication-computation overlap is possible for every processor, but only allow one send and one receive at a time. In this model, we prove that scheduling on a tree network is NP-hard in the str...