We present a variety of possible parallelization approaches for a real-world case study using several modern parallel and distributed computer architectures. Our case study is a production-quality, time-intensive algo...
详细信息
ISBN:
(纸本)9783642032745
We present a variety of possible parallelization approaches for a real-world case study using several modern parallel and distributed computer architectures. Our case study is a production-quality, time-intensive algorithm for medical image reconstruction used in computer tomography. We describe how this algorithm can be parallelized for the main kinds of contemporary parallel architectures: shared-memory multiprocessors, distributed-memory clusters, graphics processors, the Cell processor and, finally, how various architectures can be accessed in a distributed Grid environment. the main contribution of the paper;besides the parallelization approaches, is their systematic comparison regarding four important criteria: performance, programming comfort, accessibility, and cost-effectiveness. We report results of experiments on particular parallel machines of different architectures that confirm the findings of our systematic comparison.
Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallelthreads and processors has fewer limitations, but most com...
详细信息
ISBN:
(纸本)0769524052
Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallelthreads and processors has fewer limitations, but most computer programs tend to be serial in nature. this paper presents a compiler optimisation that at run-time parallelises code inside a JVM and thereby increases the number of threads. We show Spec JVM benchmark results for this optimisation. the performance on a current desktop processor is slower than without parallelthreads, caused by thread creation costs, but withthese costs removed the performance is better than the serial code. We measure the threading costs and discuss how a future computer architecture will enable this optimisation to be feasible in exploiting thread instead of instruction and/or vector parallelism.
Enterprise architects and information system designers need to understand and manage workflows, data flows, and social interactions to design tools and systems for well-coordinated organizational operations. However, ...
详细信息
ISBN:
(纸本)9781538637906
Enterprise architects and information system designers need to understand and manage workflows, data flows, and social interactions to design tools and systems for well-coordinated organizational operations. However, the organizational-nature has drastically transformed over the recent years due to wide-scale use of new computingtechnologies. Disintegrated structures, large quantities of frequently-generated data, and dubious system and interaction boundaries are some of the obvious identifiers of a modern enterprise, where poorly designed coordination can lead to serious privacy risks. Old coordination modeling frameworks do not set well for the new organizational settings, and a need for alternative models and frameworks has been felt. In this paper, we propose a privacy-aware conceptual framework for understanding coordination by identifying and mapping work, data, and interaction patterns in organizational environments. these propositions intend to help practitioners in developing an updated understanding of the coordination that serves privacy needs, as well.
As HPC capability and software adaptability continues to expand, the interest to perform complex system-wide simulations involving multiple interacting components grows. In this paper, we present a novel integrative s...
详细信息
ISBN:
(纸本)9781479983346
As HPC capability and software adaptability continues to expand, the interest to perform complex system-wide simulations involving multiple interacting components grows. In this paper, we present a novel integrative software platform - the Distributive Interoperable Executive Library (DIEL) - to facilitate the collaboration, exploration, and execution of multiphysics modeling projects suited for a diversified research community on emergent large-scale parallelcomputing platforms. It does so by providing a managing executive, a layer of numerical libraries, a number of commonly used physics modules, and two set of native communication protocols. DIEL allows users to plug in their individual modules, prescribe the interactions between those modules, and schedule communications between them. the DIEL framework is designed to be applicable for preliminary concept design, sensitivity prototyping, and productive simulation of a complex system.
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.
Grid and service computingtechnologies have been explored by enterprises to promote integration, sharing, and collaboration. However, quick response to busincss environment changes is still a challenging issue. For e...
详细信息
ISBN:
(纸本)0769524052
Grid and service computingtechnologies have been explored by enterprises to promote integration, sharing, and collaboration. However, quick response to busincss environment changes is still a challenging issue. For end users, developing, customizing, and re-engineenng applications remain a difficult and time-consuming g task. Users still need to deal with excessive low-level details of platform-specific APIs. We present a high-level programming model together with a descriptive glueing language called GSML, to facilitate end-user programming. In this approach, applications could be visually composed from well-defined software components called 'funnels" in an event-driven fashion. Application examples have shown that, by raising the level of abstraction as well as simplifying the programming model, GSML could empower end users to build grid applications on demand with improved productivity.
this paper makes two contributions. First, we introduce a model for evaluating the performance of data allocation and replication algorithms in distributed databases. the model is comprehensive in the sense that it ac...
详细信息
this paper makes two contributions. First, we introduce a model for evaluating the performance of data allocation and replication algorithms in distributed databases. the model is comprehensive in the sense that it accounts for I/O cost, for communication cost, and, because of reliability considerations, for limits on the minimum number of copies of the object. the model captures existing replica-management algorithms, such as read-one-write-all, quorum-consensus, etc. these algorithms are static in the sense that, in the absence of failures,, the copies of each object are allocated to a fixed set of processors. In modern distributed databases, particularly in mobile computing environments, processors will dynamically store objects in their local database and will relinquish them. therefore, as a second contribution of this paper, we introduce an algorithm for automatic dynamic allocation of replicas to processors. then, using the new model, we compare the performance of the traditional read-one-write-all static allocation algorithm to the performance of the dynamic allocation algorithm. As a result, we obtain the relationship between the communication cost and I/O cost for which static allocation is superior to dynamic allocation, and the relationships for which dynamic allocation is superior.
As one of the killing applications in NGI, peer-to-peer networks (P2P for short) have rapidly developed in recent years. We survey and catalog the current hot research aspects in P2P networks, compare and review most ...
详细信息
ISBN:
(纸本)9780769527369
As one of the killing applications in NGI, peer-to-peer networks (P2P for short) have rapidly developed in recent years. We survey and catalog the current hot research aspects in P2P networks, compare and review most of the research work in P2P networks, and summarize the research means and their problems.
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many prob...
详细信息
ISBN:
(纸本)9780769548791
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Bernstein-Vazirani problem more efficiently by a method with higher observation probability.
Clustering analysis is a widely used technique in bioinformatics and biochemistry for variety of applications such as detection of new cell types, evaluation of drug response, etc. Since different applications and cel...
详细信息
ISBN:
(纸本)9789897582127
Clustering analysis is a widely used technique in bioinformatics and biochemistry for variety of applications such as detection of new cell types, evaluation of drug response, etc. Since different applications and cells may require different clustering algorithms combining multiple clustering results into a consensus clustering using distributed clustering is a popular and efficient method to improve the quality of clustering analysis. Currently existing solutions are commonly based on supervised techniques which do not require any a priori knowledge. However in certain cases, a priori information on particular labelings may be available a priori. In these cases it is expected that performance improvement can be achieved by utilizing this prior information. To this purpose in this paper, we propose two semi-supervised distributed clustering algorithms and evaluate their performance for different base clusterings.
暂无评论