We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a simple functional language which suppo...
详细信息
ISBN:
(纸本)9780769530499
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a simple functional language which supports lazy evaluation and automatic parallelisation. the execution engine abstracts away details of parallelism and distribution, and uses JIT compilation to produce efficient code. this work is part of a broader project to provide a programming environment for developing distributedapplications which hides low-level details from the application developer the language we have designed plays the role of an intermediate form into which existing functional languages can be transformed. the runtime system demonstrates how distributed execution can be implemented directly within a virtual machine, instead of a separate piece of middleware that coordinates the execution of external programs.
In this paper, a parallel algorithm for RBF-based surface reconstruction from contours is presented. the reconstruction process is divided into local reconstruction and global reconstruction phases. In the local recon...
详细信息
ISBN:
(纸本)9781424415786
In this paper, a parallel algorithm for RBF-based surface reconstruction from contours is presented. the reconstruction process is divided into local reconstruction and global reconstruction phases. In the local reconstruction phase, surface patches are reconstructed from a set of adjacent slices of contours, these tasks are scheduled to be executed in parallel. In the global reconstruction phase, weighted function and local function values are evaluated in parallel. To balance the overload among CPUs or threads and get best parallelcomputing performance, the total sample points involved in task groups are distributed evenly. the experiment results show that the proposed schedule accelerate the reconstruction process greatly.
Bulk Synchronous parallel ML is a high-level language for programming parallel algorithms. Built upon OCaml and using the BSP model, it provides a safe setting for their implementation, avoiding concurrency related pr...
详细信息
ISBN:
(纸本)9780769530499
Bulk Synchronous parallel ML is a high-level language for programming parallel algorithms. Built upon OCaml and using the BSP model, it provides a safe setting for their implementation, avoiding concurrency related problems (deadlocks, indeterminism). Only a limited set of the features of OCaml can be used in BSML to respect its properties of safety: this paper describes a way to add exception handling to this set by extending and adapting OCaml's exceptions. After a precise definition of the problems that arise and an informal description of the solutions, an extension of BSML is proposed. Formal semantics define the behaviour in all possible cases, followed by a short description of the implementation.
In this paper we describe a task allocation method, that utilizes genetic programming to find a suitable solution in an adequate time for this NP-complete combinatorial optimization problem. the underlying distributed...
详细信息
ISBN:
(纸本)9780769530499
In this paper we describe a task allocation method, that utilizes genetic programming to find a suitable solution in an adequate time for this NP-complete combinatorial optimization problem. the underlying distributed embedded system is heterogenous, consisting of different processors with different properties such as core type, clock frequency, available memory, and I/O interfaces, interconnected with different communication media. In our applications, which are described as data flow graphs, the number of tasks to be placed is much larger than the number of processors available. We highlight the difficulties when applying genetic programming to this problem and present our solutions and enhancements, accompanied with some simulation results.
the previous works in the area of checking integrity constraints in distributed databases have suggested that sufficient tests should be explored as these tests are cheaper than the complete tests and the initial cons...
详细信息
ISBN:
(纸本)9780769530499
the previous works in the area of checking integrity constraints in distributed databases have suggested that sufficient tests should be explored as these tests are cheaper than the complete tests and the initial constraints due to their characteristics which can be executed at the local (target) site. this paper presents the various types of integrity tests as reported in previous works and discusses how these tests can significantly improve the performance of the constraint checking mechanisms with respect to the amount of data transferred across the network, without limiting to certain type of test as suggested by previous researchers in this area.
Programming using message passing or distributed shared memory are the two major parallel programming paradigms on clusters. However these two models have high programming complexity, produce less maintainable paralle...
详细信息
ISBN:
(纸本)9780769530499
Programming using message passing or distributed shared memory are the two major parallel programming paradigms on clusters. However these two models have high programming complexity, produce less maintainable parallel code, and are not suitable for multi-core multiprocessor clusters. While object-oriented programming is dominant in serial programming, it has not been well exploited in parallel programming. In this paper we propose an innovative automatic parallelization framework that employs past experience to parallelize serial programs and outputs the parallel code in the form of objects. Supported by a data-driven runtime environment, each parallel task is managed as a thread, exploiting the multiple processing cores on a cluster node. Based on this proposed framework, we have implemented a proof-of-concept parallelizer called PJava to parallelize Java code. the performance benefit of this framework is evaluated through case studies by comparing the execution time of the automatically generated PJava code to that of handcrafted JOPI (a Java dialect of MPI) code.
Withthe increasing popularity of shared-memory programming model, especially at the advent of multicore processors, applications need to become more concurrent to take advantage of the increased computational power p...
详细信息
A distributed scheduling algorithm is proposed for achieving end-to-end flow max-min fairness in wireless multi-hop networks. the problem is modeled as an optimization problem by taking into account the MAC-layer cons...
详细信息
ISBN:
(纸本)9780769530499
A distributed scheduling algorithm is proposed for achieving end-to-end flow max-min fairness in wireless multi-hop networks. the problem is modeled as an optimization problem by taking into account the MAC-layer constraints. With dual programming and Lagrange relaxation, the problem is decomposed into two subproblems, one is for transport layer at the source node, and the other for MAC layer in the network. A max-price based max-min fair rate allocation algorithm is adopled for the transport layer subproblem and an algorithm based on integer programming is designed for scheduling link activities at MAC layer Simulation results show that the proposed algorithm can achieve conflict-free schedule for wireless links and provide max-min fairness for end-to-end flows efficiently.
Large-scale distributed systems, withthousands or even millions of nodes, produce complex and dynamic behaviors. Packet-level simulation is necessary to test and analyze these systems, such as grids, peer-to-peer (P2...
详细信息
暂无评论