the CELL-BE processor provides high performance and has been shown to reach a performance close to the theoretical peak, however the high performance comes at the price of a quite complex programming model. Central to...
详细信息
ISBN:
(纸本)9780769536804
the CELL-BE processor provides high performance and has been shown to reach a performance close to the theoretical peak, however the high performance comes at the price of a quite complex programming model. Central to the complexity of the CELL-BE programming model is the need to move data in and out of non-coherent local storage blocks for each special processor element. In this paper we present a software library, namely the distributed Shared Memory for the Cell Broadband Engine (DSMCBE). By using techniques known from distributed shared memory DSMCBE allows programmers to program the CELL-BE with relative ease and in addition scale their applications to use multiple CELL-BE processors in a network. Performance experiments show that a quite high performance can be obtained with DSMCBE even in a cluster environment.
the execution of applications in dependable system requires a high level of instrumentation for automatic control. We present in this paper a monitoring solution for complex application execution. the monitoring solut...
详细信息
ISBN:
(纸本)9780769536804
the execution of applications in dependable system requires a high level of instrumentation for automatic control. We present in this paper a monitoring solution for complex application execution. the monitoring solution is dynamic, offering real-time information about systems and applications. the complex applications are described using workflows. We show that the management process for application execution is improved using monitoring information. the environment is represented by distributed dependable systems that offer a flexible support for complex application execution. Our experimental results highlight the performance of the proposed monitoring tool, the MonALISA framework.
Position Weight Matrices (PWMs) are broadly used in computational biology. the basic problem, SCAN, aims to find the occurrences of a given PWM in large sequences. Some other PWM tasks share a common NP-hard subproble...
详细信息
ISBN:
(纸本)9780769536804
Position Weight Matrices (PWMs) are broadly used in computational biology. the basic problem, SCAN, aims to find the occurrences of a given PWM in large sequences. Some other PWM tasks share a common NP-hard subproblem, SCOREDISTRIBUTION. the existing algorithms rely on the enumeration on a large set of scores or words, anti they are mostly not suitable for parallelization. We propose a new algorithm, BUCKETSCOREDISTRIBUTION, that is both very efficient and suitable for parallelization. We bound the error induced by this algorithm. We realized a GP U prototype for SCAN and BUCKETSCOREDISTRIBUTION withthe CUDA libraries, and report for the different problems speedups of 21 x and 77 x on a Nvidia GTX 280.
In this paper, we present a fully distributed clustering algorithm based on random walks that works on arbitrary topologies. A cluster is composed of a set of nodes called the core that coordinates the clustering proc...
详细信息
ISBN:
(纸本)9780769536804
In this paper, we present a fully distributed clustering algorithm based on random walks that works on arbitrary topologies. A cluster is composed of a set of nodes called the core that coordinates the clustering process, and of non-core nodes called ordinary nodes. A core is built through a random walk based procedure. Its neighboring nodes that do not belong to any cluster are recruited by the core as ordinary nodes into its cluster the correctness and termination of our algorithm are proven. We also prove that when two clusters are adjacent, at least one of them has a complete core (i.e. a core withthe maximum size allowed by the user). Our algorithm is not deterministic, which allows a better load balancing, since the core nodes are not determined by their ids and/or location.
this paper describes how to improve separation between domain-specific code and parallel code in skeletal systems. Traditionally, the code used to exploit parallelism is tangled among domain-specific code, which leads...
详细信息
ISBN:
(纸本)9780769536804
this paper describes how to improve separation between domain-specific code and parallel code in skeletal systems. Traditionally, the code used to exploit parallelism is tangled among domain-specific code, which leads, to problems such as: poor maintainability, lower flexibility, and weak scalability. In this paper we introduce the design of the YaSkel framework, which is a support tool to write parallel programs. We argue that the design of YaSkel framework allows more freedom to change the parallelization strategy when compared with traditional skeleton frameworks. To change the parallelization strategy we rely on DI - Dependency Injection - to inject a reference of a specific skeleton in latter development stages. We also show that AOP Aspect Oriented Programming - could be used to minimize the impact of applying skeleton based approaches to legacy code.
this paper deals withthe problem of causal model-based diagnosis of distributed systems. the setting we consider is a collection of interacting behavioral Petri nets (BPNs). Each BPN model represents the causal behav...
详细信息
ISBN:
(纸本)9780769536804
this paper deals withthe problem of causal model-based diagnosis of distributed systems. the setting we consider is a collection of interacting behavioral Petri nets (BPNs). Each BPN model represents the causal behavioral model of one subsystem and its interactions with neighboring subsystems. Interactions among subsystems are modeled by tokens that pass from one model to another via common places. Diagnosis reasoning scheme exploits, in a first step a backward reachability analysis on each net model to obtain local diagnoses;and in a second step, it exploits a forward reachability analysis for ensuring that local diagnoses are consistent and form global ones.
Tycho was conceived in 2003 in response to a need by the GridRM [1] resource-monitoring project for a "light-weight", scalable and easy to use wide-area distributed registry and messaging system. Since Tycho...
详细信息
ISBN:
(纸本)9780769536804
Tycho was conceived in 2003 in response to a need by the GridRM [1] resource-monitoring project for a "light-weight", scalable and easy to use wide-area distributed registry and messaging system. Since Tycho's first release in 2006 a number of modifications have been made to the system to make it easier to use and more flexible. Since its inception, Tycho has been utilised across a number of application domains including wide-area resource monitoring, distributed queries across archival databases, providing services for the nodes of a Cray supercomputer, and as a system for transferring multi-terabyte scientific datasets across the Internet. this paper provides an overview of the initial Tycho system, describes a number of applications that utilise Tycho, discusses a number of new utilities, and how the Tycho infrastructure has evolved in response to experience of building applications with it.
this paper proposes a self-diagnosable multi-agent system. A self-diagnosable algorithm has been proposed for multi-agent systems. this conventional algorithm makes every agent diagnose all other agents, but it has a ...
详细信息
ISBN:
(纸本)9780769536804
this paper proposes a self-diagnosable multi-agent system. A self-diagnosable algorithm has been proposed for multi-agent systems. this conventional algorithm makes every agent diagnose all other agents, but it has a problem that the more agents are included in a system, the more communications traffic increases. To solve the problem, this paper proposes a framework of multi-agent system that divides and deals with in parallel domains for mutual diagnosis to mitigate the communications between agents. Our approach introduces middle agents that do not interaction with basic client agents and we have developed a dynamic highly structured system that dynamically reconstitutes system configuration. the proposed method has been applied to a multi-agent system that forms a circle autonomously. Numerical experiments show that the proposed method needs much less communications than the conventional one.
Remotely sensed hyperspectral imaging is a technique that generates hundreds of spectral bands at different wavelength channels for the same area on the surface of the Earth. Computationally effective processing of th...
详细信息
ISBN:
(纸本)9781424456499
Remotely sensed hyperspectral imaging is a technique that generates hundreds of spectral bands at different wavelength channels for the same area on the surface of the Earth. Computationally effective processing of these image cubes can be greatly beneficial in many application domains, including environmental modeling, risk/hazard prevention and response, or defense/security. Withthe aim of providing an overview of recent developments and new trends in the design of parallel and distributed systems for hyperspectral image analysis, this paper discusses and inter-compares four different strategies for efficiently implementing a standard hyperspectral image processing chain: 1) commodity Beowulf-type clusters, 2) heterogeneous networks of workstations, 3) field programmable gate arrays (FPGAs), and 4) graphics processing units (GPUs). Combined, these parts deliver a snapshot of the state-of-the-art in those areas, and a thoughtful perspective on the potential and emerging challenges of adapting high performance computing systems to remote sensing problems.
the software in modern systems has become too complex to make accurate predictions about their performance under different configurations. Real-time or even responsiveness requirements cannot be met because it is not ...
详细信息
ISBN:
(纸本)9780769536804
the software in modern systems has become too complex to make accurate predictions about their performance under different configurations. Real-time or even responsiveness requirements cannot be met because it is not possible to perform admission control for new or changing tasks if we cannot tell how their execution affects the other tasks already running. Previously, we proposed a resource-allocation middleware that manages the execution of tasks in a complex distributed system with real-time requirements. the middleware behavior can be modeled depending on the configuration of the tasks running, so that the performance of any given configuration can be calculated. this makes it possible to have admission control in such a system, but the model requires knowledge of run-time parameters. We propose the utilization of machine-learning algorithms to obtain the model parameters, and be able to predict the system performance under any configuration, so that we can provide a full admission control mechanism for complex software systems.
暂无评论