EH*RS is a new high-availability Scalable distributed Data Structure (SDDS). the file structure and the search performance of EH*RS are basically these of EH*. It gets high availability based on record group and Reed-...
详细信息
ISBN:
(纸本)9783540729044
EH*RS is a new high-availability Scalable distributed Data Structure (SDDS). the file structure and the search performance of EH*RS are basically these of EH*. It gets high availability based on record group and Reed-Salomon erasure correcting coding. EH*RS remains all data available despite the unavailability of any k >= 1 servers by storing the additional information: the parity information. the value of k transparently grows withthe file, to prevent the reliability decline. the storage overhead for the high-availability is small. the example shows that EH*RS file performs as expected. Finally, the scheme of EH*RS provides new perspectives to data-intensive applications (DBMSs), including the emerging ones of grids and of P2P computing.
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique are compute-intensive and suffer from ...
详细信息
ISBN:
(纸本)9783540768364
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique are compute-intensive and suffer from long runtimes on sequential architectures. therefore, several parallel algorithms for both fine-grained and coarse-grained architectures have been introduced. However, the commonly used data partitioning scheme can not be efficiently applied to irregular dynamic programming algorithms, i.e. dynamic programming algorithms with an uneven load density pattern. In this paper we present a tunable parallel Bulk Synchronous parallel (BSP) algorithm for such kind of applications. this new algorithm can balance the workload among processors using a tunable block-cyclic data partitioning method and thus is capable of getting almost linear performance gains. We present a theoretical analysis and experimentally show that it leads to significant runtime savings for pairwise sequence alignment with general gap penalties using BSPonMPI on a PC cluster.
this paper presents an integrated firamework for surface reconstruction capable of handling large scale clouds of points. this framework is based on two proposed methods for implicit surface fitting and polygonization...
详细信息
ISBN:
(纸本)9781424418343
this paper presents an integrated firamework for surface reconstruction capable of handling large scale clouds of points. this framework is based on two proposed methods for implicit surface fitting and polygonization to convert a cloud of unorganized points into an optimized surface. ne proposed fitting method employs the Partition of Unity (POU) method associated withthe Radial Basis Functions (RBF) over a distributedcomputing environment to facilitate and speedup fitting of large scale clouds without any data reduction to preserve all the surface details. Moreover, an innovative Adaptive Mesh Refinement (AMR) based method is proposed for implicit surface polygonization. this method steers adaptive volume sampling via a series of optimization criteria to provide accurate and optimized surfaces with minimum number of polygons. the experimental results for the considered test models showed an average reduction of 60 % in fitting time using 16 processing nodes and 90% in polygonization time on the master node only against other traditional methods with better performance.
In this paper we examine the issue of optimizing disk usage and of scheduling large-scale scientific workflows onto distributed resources where the workflows are data-intensive, requiring large amounts of data storage...
详细信息
Power-aware scheduling problem has been a recent issue in cluster systems not only for operational cost due to electricity cost, but also for system reliability. As recent commodity processors support multiple operati...
详细信息
ISBN:
(纸本)9780769528335
Power-aware scheduling problem has been a recent issue in cluster systems not only for operational cost due to electricity cost, but also for system reliability. As recent commodity processors support multiple operating points under various supply voltage levels, Dynamic Voltage Scaling (DVS) scheduling algorithms can reduce power consumption by controlling appropriate voltage levels. In this paper we provide power-aware scheduling algorithms for bag-of-tasks applications with deadline constraints on DVS-enabled cluster systems in order to minimize power consumption as well as to meet the deadlines specified by application users. A bag-of-tasks application should finish all the sub-tasks before the deadline, so that the DVS scheduling scheme should consider the deadline as well. We provide the DVS scheduling algorithms for both time-shared and space-shared resource sharing policies. the simulation results show that the proposed algorithms reduce much power consumption compared to static voltage schemes.
the provisioning of remote and composed services in support of various application areas has dramatically increased over. recent times. thus, the concept of Grids has evolved, in the-sense of a common platform for ele...
详细信息
ISBN:
(纸本)9780769528335
the provisioning of remote and composed services in support of various application areas has dramatically increased over. recent times. thus, the concept of Grids has evolved, in the-sense of a common platform for electronic service provisioning in multi-domain environments. While, traditionally, Grids have seen a quite static existence, many new service compositions have to take place on-demand and for certain periods of time only. To tackle those issues the concept of Virtual Organizations (VO) delivers a highly suitable representation of such dynamic Grids. However one important, open problem at this stage is the lack of applicable, distributed, and efficient accounting schemes for commercial resource and service consumptions. Even for simple management purposes, e.g., sampling or archiving, this functionality is essential. therefore, a comprehensive model for Grid accounting has been developed and suitable accountable units have been defined, in which an underlying activity- and resource-based accounting model covers economic cost theory. Furthermore, this work is based on a service model proposed for service provisioning in dynamic VOs, overcoming the typically static nature of traditional Grids.
Computational grids are solutions for several biological applications like virtual screening or molecular dynamics where large amounts of computing power and storage are required. the WISDOM project successfully deplo...
详细信息
ISBN:
(纸本)9780769528335
Computational grids are solutions for several biological applications like virtual screening or molecular dynamics where large amounts of computing power and storage are required. the WISDOM project successfully deployed virtual screening at large scale on EGEE grid infrastructures in the summer 2005 and achieved 46 million dockings in 45 days, which is equivalent to 80 CPU years. WISDOM is one good example of a successful deployment of an embarrassingly parallel application. In this paper, we describe the improvements in our deployment. We screened ZINC database against four targets implicated in malaria. During more than 2 months and a half, we have achieved 140 million dockings, representing an average throughput of almost 80,000 dockings per hour. this was made possible by the availability of thousands of CPUs through different infrastructures worldwide. through the acquired experience, the WISDOM production environment is evolving to enable an easy and fault-tolerant deployment of biological tools.
the current MSM switching fabric has poor performance under unbalanced traffic. To eliminate the internal congestion of switching fabric, we put forward a new central-stage buffered multi-stage switching fabric-CB-3Cl...
详细信息
ISBN:
(纸本)9783540768364
the current MSM switching fabric has poor performance under unbalanced traffic. To eliminate the internal congestion of switching fabric, we put forward a new central-stage buffered multi-stage switching fabric-CB-3Clos and the backpressure-based strategy to control flows under credit-dispensed mode. By analyzing the condition to satisfy the central-stage load balance, we also advance an iSLIP alike scheduling algorithm-RGA. the simulation results show: compared with CRRD algorithm based on MSM switching fabric, the RGA algorithm has high throughput irrespective withthe arriving traffic model and better performance in packet May. At the same time, the QoS can be guaranteed.
this paper proposes a new model to predict the process execution behavior on heterogeneous multicomputing environments. this model considers the process execution costs such as processing, hard disk acessing, message ...
详细信息
ISBN:
(纸本)9783540713500
this paper proposes a new model to predict the process execution behavior on heterogeneous multicomputing environments. this model considers the process execution costs such as processing, hard disk acessing, message transmitting and memory allocation. A simulator of this model was developed which help to predict the execution behavior of processes on distributed environments under different scheduling techniques. Besides the simulator, it was developed a suite of benchmark tools in order to parameterize the proposed model with data collected from real environments. Experiments were conduced to evaluate the proposed model which used a parallel application executing on a heterogeneous system. the obtained results show the model ability to predict the actual system performance, providing an useful model for developing and evaluating techniques for scheduling and resource allocation over heterogeneous and distributed systems.
Data Grid provides integrated view of distributed data scattered across networks. Current Data Grid systems are centrally controlled. In this paper, we present a structured P2P based Data Grid model (P-DataGrid Model,...
详细信息
ISBN:
(纸本)9783540768364
Data Grid provides integrated view of distributed data scattered across networks. Current Data Grid systems are centrally controlled. In this paper, we present a structured P2P based Data Grid model (P-DataGrid Model, PDG) which makes use of construction and routing algorithms of P-Grid a structured P2P system. PDG is organized as virtual multi-branch tree with binary tree as main body. Formal description of PDG is firstly introduced. then we discuss the realization issues of PDG such as establishment of model, data storage service, information service, etc. Among these issues, our emphasis is on joining of nodes, registration and location of replica. Furthermore, we analyze the successful probability of location. Constructing Data Grid on structured P2P overlay can bring great advantages of scalability, decentralized control and reliability.
暂无评论