XtremWeb-CH (XWCH) is a volunteer computing middleware that makes it easy for scientists and industrials to deploy and execute their parallel and distributed applications on a public-resource computing infrastructure....
详细信息
ISBN:
(纸本)9780889867901
XtremWeb-CH (XWCH) is a volunteer computing middleware that makes it easy for scientists and industrials to deploy and execute their parallel and distributed applications on a public-resource computing infrastructure. XWCH supports various high performance applications, including those having large storage and communication requirements. Two high performance applications were ported and deployed on an XWCH platform. The first one is the package of programs Phylip that is employed for inferring phylogenies (evolutionary trees). The second application ported on XWCH is a medical program used to generate temporal dynamic neuronal maps. The application, named NeuroWeb, is used to better understand the connectivity and activity of neurons. NeuroWeb is a data and CPU intensive application. This paper describes the different components of an XWCH platform and the lessons learned from gridifying Phylip and NeuroWeb. It also details the new features and extensions, which are being added to XWCH in order to support new types of applications.
This paper proposes a fast AND/OR tree search algorithm using a multiple paths parallel and concurrent search scheme for embedded multicore processors. Currently, not only PCs or supercomputers but also information ap...
详细信息
ISBN:
(纸本)9780889867840
This paper proposes a fast AND/OR tree search algorithm using a multiple paths parallel and concurrent search scheme for embedded multicore processors. Currently, not only PCs or supercomputers but also information appliances such as game consoles, mobile devices and car navigation systems are equipped with multicore processors for better cost performance and lower power consumption. However, the number of processor cores and the amount of memories in embedded multicore processors are limited for lowering power consumption and chip costs. Development of parallel application programs on embedded multicore processors requires exploitation of parallelism and effective utilization of small memories. The proposed algorithm allows us to search in parallel many paths including lowly evaluated nodes and paths including highly evaluated nodes. The algorithm also uses depth-first search, working on small memories. The proposed algorithm is applied for a tsume-shogi (Japanese chess problem) solver as a typical AND/OR tree search problem on an embedded multicore processor system, NEC Electronics NaviEngine with four ARM processor cores. Evaluation results for 100 problems show that the proposed algorithm executed on two processor cores is 2.36 times faster, and executed on four processor cores is 4.17 times faster than the sequential algorithm on the average.
This paper presents a parallel infrastructure for reliable numerical simulations of the bone-conducted sound in the human head. We focus on the three dimensional finite element modeling of the acoustics of human head....
详细信息
ISBN:
(纸本)9780889867901
This paper presents a parallel infrastructure for reliable numerical simulations of the bone-conducted sound in the human head. We focus on the three dimensional finite element modeling of the acoustics of human head. The human head is modeled with three dimensional tetrahedral finite elements with high polynomial orders of approximation. A fully coupled model based on the acoustic/elastic interaction problem with a detailed resolution of the cochlea region is formulated and solved. The parallel infrastructure is based on the domain decomposition paradigm. The computational mesh is partitioned into multiple sub-domains, and the multi-level direct substructuring parallel solver is utilized to solve the coupled problem.
In the field of the cross media systems, one of the important issues is how to extract and deal with the impression of media data to realize impression-based media retrieval. In this paper, we present impression extra...
详细信息
ISBN:
(纸本)9780889867901
In the field of the cross media systems, one of the important issues is how to extract and deal with the impression of media data to realize impression-based media retrieval. In this paper, we present impression extraction and correlation calculation methods for automatic cross media synchronization as a new approach for automatic VJ (Visual Jockey) systems with impression calculation. The significant features of our methods are: 1) cross media impression extraction from media data (music and image), 2) correlation calculation in impression between cross media, such as impression of music and impression of an image, for VJ applications, 3) application to an experimental VJ system. This paper shows several experimental results to clarify the feasibility and effectiveness of our framework and methods.
distributed constraint optimization is very important for solving asynchronous distributed search problems in the multi-agent field. Various methods have been proposed for solving distributed constraint optimization p...
详细信息
ISBN:
(纸本)9780889867901
distributed constraint optimization is very important for solving asynchronous distributed search problems in the multi-agent field. Various methods have been proposed for solving distributed constraint optimization problems, and among these, Asynchronous distributed OPTimization (ADOPT) has proven to be very effective. ADOPT is able to find solutions that optimize the total cost, but depending on the distribution of solutions for the problem in question, loads can tend to localize. When handling practical problems, solutions that take local load into consideration may be required. If this type of load concentration can be resolved, it should be possible to apply this approach to various resource allocation problems such as frequency allocation or sensor network allocation. In this paper, we propose a method that improves on ADOPT by taking distribution of local loads into consideration, making it applicable to these sorts of practical problems. We also verify the effectiveness of this new method by performing simulation experiments using the frequency allocation problem.
The proceedings contain 37 papers. The topics discussed include: a model for personalized communications control in pervasive systems;class algebra;an R-tree collision detection algorithm for polygonal models;a method...
ISBN:
(纸本)9780889867901
The proceedings contain 37 papers. The topics discussed include: a model for personalized communications control in pervasive systems;class algebra;an R-tree collision detection algorithm for polygonal models;a method to assist the maintenance of object-oriented software systems using impact analysis;user preference management in a pervasive system should be a trusted function;multi-level processor scheduling using ant optimization;constraint based tutor generator for intelligent tutoring system;SVDD based probabilistic ranking scheme for information retrieval;flowable service model for seamless integration of services;checking protocol conformance in component models using aspect oriented programming;real-time multiversion repeatable read isolation level;and using the volunteer computing XTREMweb-CH: lessons and perspectives.
In this paper we present the performance of our parallel multi-frontal direct solver when applied to solve linear systems of equations resulting from discretizations of a hp Finite Element Method (hp-FEM). The hp-FEM ...
详细信息
ISBN:
(纸本)9780889867901
In this paper we present the performance of our parallel multi-frontal direct solver when applied to solve linear systems of equations resulting from discretizations of a hp Finite Element Method (hp-FEM). The hp-FEM generates a sequence of computational meshes delivering exponential convergence of the numerical error with respect to the mesh size (number of degrees of freedom). A sequence of meshes is obtained by performing several hp refinements starting from an arbitrary initial mesh. The solver constructs initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We compare the solver with two versions of the MUMPS parallel solver: with (1) distributed entries executed over the entire problem, and (2) the direct sub-structuring method with parallel MUMPS solver utilized to solve the interface problem. We show that by providing to the solver the knowledge about the structure of the hp-FEM, the order of elimination is obtained straightforward, and leads to a better performance than by submitting the entire matrix to the solver and executing a connectivity graph based ordering algorithm.
A modern high-performance multi-core processor has large shared cache memories. However, simultaneously running threads do not always require the entire capacities of the shared caches. Besides, some threads cause sev...
详细信息
ISBN:
(纸本)9780889867840
A modern high-performance multi-core processor has large shared cache memories. However, simultaneously running threads do not always require the entire capacities of the shared caches. Besides, some threads cause severe performance degradation by inter-thread cache conflicts and shortage of capacity on the shared cache. To achieve high performance processing on multi-core processors, effective usage of shared cache memories plays important role. In this paper, we propose a cache-aware thread scheduling policy for multi-core processors with multiple shared cache memories. The total processor performance becomes more sensitive to the cache capacity shortage, as larger caches are requested by the threads sharing one cache. The proposed policy can prevent multiple threads requesting a large cache capacity from sharing one cache. As a result, the policy can prevent inter-thread resource conflicts and hence severe performance degradation. Experimental results clearly demonstrate that the policy assists the cache partitioning mechanisms and avoids unfair performance degradation among threads. Thread scheduling based on the proposed policy can improve the performance by up to 10% and an average of 5% compared with thread scheduling without the proposed policy.
Gartner predicted that by 2010, 40% of EA programs will be stopped due to the failure of delivering business value. An organization needs a practical solution to achieve an EA vision. The EA essential approach should ...
详细信息
Gartner predicted that by 2010, 40% of EA programs will be stopped due to the failure of delivering business value. An organization needs a practical solution to achieve an EA vision. The EA essential approach should be that of business service and process orientation than systems and IT orientation. We propose an actionable enterprise architecture (AEA) which is based on BPM (business process management) and SOA (service oriented architecture), and connected to service & process orientation and engineering. The architecture proposed provides traceability between service-oriented enterprise architecture and its solution. The proposed architecture can transform enterprise architecture from conceptual to physical levels (solutions) with a service and business process paradigm.
We study the problem of scheduling tasks in a distributed system where the data (and code) for a program may reside on a processor different from the one where it will be executed. The scheduling of the tasks is compl...
详细信息
ISBN:
(纸本)9780889867741
We study the problem of scheduling tasks in a distributed system where the data (and code) for a program may reside on a processor different from the one where it will be executed. The scheduling of the tasks is complex as one must balance execution and communications times. We present an off-line polynomial time approximation algorithm for the case when the processors can be split into storage (client) and processing (server) nodes. Our algorithm is the first constant ratio approximation algorithm for this problem. Then we discuss generalization of our problem as well as the on-line version of our problem.
暂无评论