For an initial study in divisible load scheduling, an optimal computing power allocation problem in a distributedparallelcomputing grid involving two sources and a sink is considered. The objective is to optimally a...
详细信息
ISBN:
(纸本)9780889868205
For an initial study in divisible load scheduling, an optimal computing power allocation problem in a distributedparallelcomputing grid involving two sources and a sink is considered. The objective is to optimally allocate the computing power of the sink in the grid in a such way that the total parallelcomputing finish time of the entire load is equalized to the sequential computing finish time while utilizing the full computing power. A numerical method to calculate the optimal adaptive computing power via a deterministic analysis is presented under several computing constraints. Performance of the computing power adaptation is modeled and evaluated. For performance evaluation, we define average computing finish time.
A load-balanced exact solver for computing the exact solutions of minimum k-center and related facility locations problems, is described. To achieve the load balance on a dedicated multiprocessor system, i.e., a clust...
详细信息
ISBN:
(纸本)9780889867840
A load-balanced exact solver for computing the exact solutions of minimum k-center and related facility locations problems, is described. To achieve the load balance on a dedicated multiprocessor system, i.e., a cluster or a supercomputer, a new algorithm for parallel generation of a set of all k-combinations of n-things (without repetitions) is introduced and analysed. We demonstrate that the new algorithm can also be used in a resource competitive environment if used or supplemented with a simple adaptive job scheduler. The solver is tested by producing the benchmarks for the minimum k-center problem.
This paper introduces invasive computing, a new paradigm for programming parallel architectures. The goals are to enable the development and execution of resource aware programs that can dynamically allocate and free ...
详细信息
ISBN:
(纸本)9780889868649
This paper introduces invasive computing, a new paradigm for programming parallel architectures. The goals are to enable the development and execution of resource aware programs that can dynamically allocate and free new resources in phases with more parallelism. To allocate more resources, applications use the invade operation and to free them the retreat. The research is conducted within the framework of the Transregional Collaborative Research Centre 89 funded by the German Science Foundation.
We consider the problem of scheduling parallel applications, represented by directed acyclic graphs (DAGs), onto Grid style resource pools. The core issues are that the availability and performance of grid resources, ...
详细信息
ISBN:
(纸本)9780889866379
We consider the problem of scheduling parallel applications, represented by directed acyclic graphs (DAGs), onto Grid style resource pools. The core issues are that the availability and performance of grid resources, which are already by their nature heterogeneous, can be expected to vary dynamically, even during the course of an execution. Typical scheduling methods in the literature partially address this issue because they consider static heterogenous computing environments (i.e. heterogeneous resources are dedicated and unchanging over time). This paper presents the Grid Task Positioning GTP scheduling method, which addresses the problem by allowing rescheduling of an executing application in response to significant variations in resource characteristics. GTP considers the impact of partial completion of tasks and task migration. We compare the performance of GTP with that of the well-known, and static, Heterogeneous Earliest Finish Time (HEFT) algorithm.
Simultaneous multi-threading and single-chip multiprocessing are two methods of increasing the throughput of the central processing unit of a computer. Intel's Hyper-Threading Technology is one form of simultaneou...
详细信息
ISBN:
(纸本)9780889867840
Simultaneous multi-threading and single-chip multiprocessing are two methods of increasing the throughput of the central processing unit of a computer. Intel's Hyper-Threading Technology is one form of simultaneous multi-threading that creates two states in a single processor allowing it to execute two threads of one process simultaneously. This produces two logical processors, but they must share the resources (cache and system bus, for example) of a single processor. Single-chip multiprocessing, on the other hand, is actually two physical processors each with its own resources. In this paper, we examine what effect each of these technologies has on the performance of a distributed real-time database system when the processor becomes the bottleneck of each of the system's machines.
In delay-tolerant wireless sensor networks, reporting data from a source node to a sink may be delayed to satisfy some criterion, for example, high energy-efficiency, low algorithm complexity and so on. Data sensed in...
详细信息
ISBN:
(纸本)9780889867840
In delay-tolerant wireless sensor networks, reporting data from a source node to a sink may be delayed to satisfy some criterion, for example, high energy-efficiency, low algorithm complexity and so on. Data sensed in such networks accumulate on a sensor node during time delayed. It means that even a single failed node may cause a massive-data loss. This paper proposes a backup scheme to minimize data losses caused by failed nodes in wireless sensor networks using the delayed report. The proposed scheme preserves data and consumes small energy by backuping a single data to multiple nodes that exist in the one-hop distant of the source node. Simulation certified that such approach safely preserve data and consumes small energy.
As high-performance computing (HPC) systems continue to increase in scale, their mean-time to interrupt decreases respectively. The current state of practice for fault tolerance (FT) is checkpoint/restart. However, wi...
详细信息
ISBN:
(纸本)9780889868205
As high-performance computing (HPC) systems continue to increase in scale, their mean-time to interrupt decreases respectively. The current state of practice for fault tolerance (FT) is checkpoint/restart. However, with increasing error rates, increasing aggregate memory and not proportionally increasing I/O capabilities, it is becoming less efficient. Proactive FT avoids experiencing failures through preventative measures, such as by migrating application parts away from nodes that are "about to fail". This paper presents a proactive FT framework that performs environmental monitoring, event logging, parallel job monitoring and resource monitoring to analyze HPC system reliability and to perform FT through such preventative actions.
We propose a parallel Gauss-Seidel (GS) iterative algorithm for solving large systems of linear equations on a 2D torus network-con-chip (NoC) architecture. The proposed parallel algorithm is of O(Nn2/k2) time complex...
详细信息
ISBN:
(纸本)9780889869431
We propose a parallel Gauss-Seidel (GS) iterative algorithm for solving large systems of linear equations on a 2D torus network-con-chip (NoC) architecture. The proposed parallel algorithm is of O(Nn2/k2) time complexity for solving a system with matrix of order n on a k×k torus NoC architecture requiring N iterations assuming n and N are large compared to k (i.e. for large linear systems that require a large number of iterations). We show that under these conditions the proposed parallel GS algorithm has near optimal speedup and efficiency.
We focus on the efficient parallel processing of meshes from biomolecular data so that they can be subsequently used for FEM simulation. All mesh processing about refinements and coherent indexations are applied in pa...
详细信息
ISBN:
(纸本)9780889869431
We focus on the efficient parallel processing of meshes from biomolecular data so that they can be subsequently used for FEM simulation. All mesh processing about refinements and coherent indexations are applied in parallel. The simplices of the mesh are needed for the application in FEM having higher polynomial degrees. For biomolecular data, the only inputs are the atom coordinates, the van der Waals radii and the probe radius. Our principal goal is to obtain data which are well balanced among the different processors. To corroborate the parallel mesh processing, we show some application to FEM simulation. For that, we consider the parallel FEM of the linearized Poisson- Boltzmann problem. We compare the FEM numerical results with known theoretical prediction to validate the accuracy of the parallel implementation.
The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It allows searching for similar objects represente...
详细信息
ISBN:
(纸本)9780889866379
The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It allows searching for similar objects represented in metric spaces. The sequential EGNAT has been shown to achieve good performance in high-dimentional metric spaces with properties (not found in others of the same kind) of allowing update operations and efficient use of secondary memory. Thus, for example, it is suitable for indexing large multimedia databases. However, comparing two objects during a search can be a very expensive operation in terms of running time. This paper shows that parallelcomputing upon clusters of PCs can be a practical solution for reducing running time costs. We describe alternative distributions for the EGNAT index and their respective parallel search/update algorithms and concurrency control mechanism.
暂无评论