Mesh-connected processor array is a popular architecture used in parallel processing. Extensive studies have been conducted on reconfiguration algorithms for the processor arrays with faults, but few work is on parall...
详细信息
ISBN:
(纸本)9780769548791
Mesh-connected processor array is a popular architecture used in parallel processing. Extensive studies have been conducted on reconfiguration algorithms for the processor arrays with faults, but few work is on parallel algorithm to accelerate the reconfiguration. this paper presents a fast algorithm to reconfigure two dimensional mesh-connected processor arrays with faults. A traditional algorithm is successfully accelerated in the manner of multithread, without loss of harvest. the proposed algorithm reconfigures the processor array withthe mechanics of route distance in order to avoid the routing errors. Simulation results show that the proposed algorithm can accelerate the reconfiguration nearly by 15 times on a 64 x 64 array in comparison to the traditional algorithm cited in this paper.
Computer vision is a field of computer science which recently received increasingly to the fore. To accelerate computing in image processing can be used specialized processors that work on the principle of accelerator...
详细信息
ISBN:
(纸本)9781467351225;9781467351201
Computer vision is a field of computer science which recently received increasingly to the fore. To accelerate computing in image processing can be used specialized processors that work on the principle of accelerators. Designed arithmetic-logic unit is a processor module, which executes image processing based on the selected instruction. the parallel design of arithmetic-logic unit can also accelerate image processing.
Capabilities are a more scalable and adaptive access control approach compared withthe conventional approaches such as ACLs, due to their being held and managed by users or agents in systems, but not the middleware. ...
详细信息
ISBN:
(纸本)9780769548791
Capabilities are a more scalable and adaptive access control approach compared withthe conventional approaches such as ACLs, due to their being held and managed by users or agents in systems, but not the middleware. this feature makes capabilities more suitable in distributed environments that have dynamic populations. Treaties have been proposed to enhance the capability approach by introducing sequences of actions, such that treaties can capture characteristics of behaviours, and provide finer control over accesses. However there is a new problem brought by the behaviour modeling of treaties which is called duplication problem, which concerns preventing users from gaining unauthorised behaviour by duplicating treaties. In this paper we discuss this problem and propose three models of treaty systems that aim to solve the duplication problem.
the molecular docking is the focus of practical applications such as protein engineering and drug design. A docking algorithm is a procedure that predicts the assembly of two molecules like a key and a lock. To screen...
详细信息
ISBN:
(纸本)9781467316583
the molecular docking is the focus of practical applications such as protein engineering and drug design. A docking algorithm is a procedure that predicts the assembly of two molecules like a key and a lock. To screen a large library of molecules, a docking algorithm requires high performance computing. parallel and distributedapplications have long been recognized as powerful computational tools and effective in the field of bioinformatics. Jini technology is one of the powerful infrastructures network for building and deploying distributed systems that are organized as a federation of services. JavaSpaces is one of the services that come bundled with Jini, it is a shared associative memory accessible by the network and allows an easily developing of a massively parallel and distributedapplications. this paper discusses the use of the JavaSpaces service to build a distributed application in order to minimize the running time of a molecular docking algorithm.
Protein identification is the most important and basic problem for proteomics. Using tandem mass spectrometry and database search is one of the most widely used identification techniques. However, the improved sensiti...
详细信息
ISBN:
(纸本)9780769548791
Protein identification is the most important and basic problem for proteomics. Using tandem mass spectrometry and database search is one of the most widely used identification techniques. However, the improved sensitivity of mass spectrometers, rapid expansion of databases and more complex analysis, like post-translational modification and non-specific enzymatic digestion, have challenged current restricted protein identification search engines in scale and speed severely. In this paper, we proposed an open protein identification method relaxing enzyme, and presented our distributed design to support big protein database with non-specific digestion analysis based on pFind, a practical tandem mass spectra search engine developed in China. With classical bigger protein databases *** and uniprot-sprot we got nearly linear speedup in a 20-blade cluster. By further analysis, we can expect real time identification to some extent.
Modeling and testing for parallel software systems is difficult, because the number of states and execution fragments expand significantly caused by parallel behaviors, so that many traditional testing methods cannot ...
详细信息
ISBN:
(纸本)9780769548791
Modeling and testing for parallel software systems is difficult, because the number of states and execution fragments expand significantly caused by parallel behaviors, so that many traditional testing methods cannot work effectively for this kind of software. In this paper, a test sequence generation method based on model reduction for parallel software systems is shown. Firstly, a formal model for software system specification is constructed based on Coloured Petri Net (CPN), called system model;and a model reduction method based on trace-equivalent principle is shown and applied on system model, which could generate an external behavior equivalent model with smaller scale. Secondly, a linear behavior sequence of the system is specified using CPN, called LBS model, which represents testing purpose in a test case, and some operations between state space diagrams of system model and LBS model are defined, so that a sub-graph of system model state space diagram is generated, which could cover all executions of system model that involves behaviors of LBS. Finally, a performance analysis shows the effectiveness of the method.
Supercomputing on the heterogeneous architectures that integrate multi-core or many-cores processors has been developed at a dramatically speed. It is widely used in theoretical physics, theoretical chemistry, climate...
详细信息
ISBN:
(纸本)9780769548791
Supercomputing on the heterogeneous architectures that integrate multi-core or many-cores processors has been developed at a dramatically speed. It is widely used in theoretical physics, theoretical chemistry, climate modeling, biology simulation and medicine research for high-performance and energy-efficient computing. Yet it is still a big challenge to users when trying to run their scientific applications efficiently on large-scale supercomputers constructed by using heterogeneous multiprocessors. On the other hand, overhead cost issues of a large supercomputer for its resource managements, job scheduling, and system reliability become more and more important. In this paper, LPFSC, a light weight parallel framework for supercomputing, is presented, which helps programmers in planning their tasks on a supercomputer. In a huge supercomputer system, there might be a hundred of thousands of nodes, over a million processor cores and many other kinds of processors, general main-slave computing mode can hardly handle the huge amount of heterogeneous processors. LPFSC consists of modules for multiple master-slave support, load balance among huge amount computing tasks, and reliability support. Additional features will be added in the near future and it is supposed to provide good support for large heterogeneous computer systems. Finally, large amount tasks of 2D-FFT in varying size are tested under the framework for evaluation, which can scale to more than 300 processors.
this paper discusses lung cancer detection in chest X-ray images with a parallel genetic algorithm (GA). the template matching method and local search techniques are combined to the algorithm and JavaSpaces is used to...
详细信息
ISBN:
(纸本)9780769548791
this paper discusses lung cancer detection in chest X-ray images with a parallel genetic algorithm (GA). the template matching method and local search techniques are combined to the algorithm and JavaSpaces is used to construct the parallel system. the promising results are presented in the experiments.
D-ReServE increases reliability of SOA-based systems in case of failure occurrence. the fault-tolerant information in D-ReServE is stored in the Stable Storage, which available space depletes with time. thus, in this ...
详细信息
ISBN:
(纸本)9780769548791
D-ReServE increases reliability of SOA-based systems in case of failure occurrence. the fault-tolerant information in D-ReServE is stored in the Stable Storage, which available space depletes with time. thus, in this paper we propose a garbage collection protocol for D-ReServE that allows the periodic purging of the Stable Storage, and discuss the challenges of garbage collection due to the nature of SOA systems.
the snapshot problem addresses a collection of important algorithmic issues related to the distributed computations, which are used for debugging or recovering the distributed programs. Among the existing solutions, C...
详细信息
ISBN:
(纸本)9780769548791
the snapshot problem addresses a collection of important algorithmic issues related to the distributed computations, which are used for debugging or recovering the distributed programs. Among the existing solutions, Chandy and Lamport propose a simple distributed algorithm. In this paper, we explore the correct-by-construction process to formalize the snapshot algorithms in distributed system. the formalization process is based on a modeling language Event B, which supports a refinement-based incremental development using RODIN platform. these refinement-based techniques help to derive a correct distributed algorithm. Moreover, we demonstrate how this class of other distributed algorithms can be revisited. A consequence is to provide a fully mechanized proof of the distributed algorithms.
暂无评论