The co-operation of parallel simulated annealing processes to solve the vehicle routing problem with time windows (VRPTW) is considered. The objective is to investigate how the number of parallel processes and the fre...
详细信息
ISBN:
(纸本)9780889866386
The co-operation of parallel simulated annealing processes to solve the vehicle routing problem with time windows (VRPTW) is considered. The objective is to investigate how the number of parallel processes and the frequency of processes co-operation influence the accuracy of solutions to the VRPTW. The accuracy of solutions is measured by their proximity to the best known solution.
In this paper, we present a new method of static load balancing for parallel mining of all frequent itemsets on a distributed-memory (DM) parallel machine. The method partitions the space of all frequent itemsets into...
详细信息
ISBN:
(纸本)9780889866386
In this paper, we present a new method of static load balancing for parallel mining of all frequent itemsets on a distributed-memory (DM) parallel machine. The method partitions the space of all frequent itemsets into subspaces of approximately the same size. Hence, it allows to balance the computational load for an arbitrary frequent itemset mining algorithm.
To keep up with the pace of fast development of Internet, cluster architecture has been proposed for next generation core routers. In a cluster router, parallel computation is expected. computing shortest path tree (S...
详细信息
ISBN:
(纸本)9780889866386
To keep up with the pace of fast development of Internet, cluster architecture has been proposed for next generation core routers. In a cluster router, parallel computation is expected. computing shortest path tree (SPT) is a fundamental problem implementing OSPF, which is one of the most popular routing protocols. This paper presents a parallel algorithm BPA (Branching parallel Algorithm) for computing SPT, analyzes the performance of BPA, and finally validates the BPA performance by experiments
In this paper, we discuss parallelization of a high-level computer vision application in medical imaging, namely, multi-scale active shape description of MR (magnetic resonance) brain images of epileptic patients usin...
详细信息
ISBN:
(纸本)9780889866386
In this paper, we discuss parallelization of a high-level computer vision application in medical imaging, namely, multi-scale active shape description of MR (magnetic resonance) brain images of epileptic patients using active contour models, on a cluster of workstations. The paper gives a comparative study and analysis of three different approaches of parallel implementation using corresponding parallelcomputing patterns such as Temporal Multiplexing, Pipeline, and Composite Pipeline. The outcome of the cluster-based parallel implementations has shown encouraging results.
distributed testing is often hard to implement. This is due to difficulties in handling heterogeneous environments, complex configurations, synchronization, error probing, result maintenance and automation in distribu...
详细信息
ISBN:
(纸本)9780889866386
distributed testing is often hard to implement. This is due to difficulties in handling heterogeneous environments, complex configurations, synchronization, error probing, result maintenance and automation in distributed testing. This paper describes a practical testing framework that permits automated distributed testing of distributedsystems and applications. The framework extends the capability of JUnit to support test execution over heterogeneous environments and complex configurations.
This paper studies Strassen's matrix multiplication algorithm by implementing it in a variety of methods: sequential, workflow, and in parallel. All the methods show better performance than the well-known scientif...
详细信息
ISBN:
(纸本)9780889866386
This paper studies Strassen's matrix multiplication algorithm by implementing it in a variety of methods: sequential, workflow, and in parallel. All the methods show better performance than the well-known scientific libraries for medium to large size matrices. The sequential recursive program is implemented and compared with ATLAS's DGEMM subroutine. A workflow program in the NetSolve system and two parallel programs based on MPI and Scal-APACK are also implemented. By analyzing the time complexity and memory requirement of each method, we provide insight into how to utilize Strassen's Algorithm to speedup matrix multiplication based on existing high performance tools or libraries.
Memory consistency model is crucial to the performance of shared-memory multiprocessors, and in current architectures several different models are adopted. In this paper, using graph algorithms for illustrative purpos...
详细信息
ISBN:
(纸本)9780889866386
Memory consistency model is crucial to the performance of shared-memory multiprocessors, and in current architectures several different models are adopted. In this paper, using graph algorithms for illustrative purposes, we consider the impact of memory model on the implementation and performance of parallel algorithms on shared-memory multiprocessors. We show that the implementation of PRAM algorithm's is largely "oblivious" of the underlying memory model, and has good performance on relaxed models. More importantly, we show that different memory models can favor drastically different algorithm designs.
We have developed a distributed asynchronous Web based training system. In order to improve the scalability and robustness of this system, all contents and a function that scores user's answers are realized on mob...
详细信息
ISBN:
(纸本)9780889866386
We have developed a distributed asynchronous Web based training system. In order to improve the scalability and robustness of this system, all contents and a function that scores user's answers are realized on mobile agents. These agents are distributed to computers, and they can obtain using a P2P network that modified Content-Addressable Network. In this system, although entire services do not become impossible even if some computers break down, the problem that contents disappear occurs with an agent's disappearance. In this study, as a solution for this problem, backups of agents are distributed to computers. If a failure of a computer is detected, other computer will continue service using backups of the agents belonged to the computer. The developed algorithm is examined by experiments.
This paper deals with a novel communication timing control for wireless networks and radio interference problem. Communication timing control is based on the mutual synchronization of coupled phase oscillatory dynamic...
详细信息
ISBN:
(纸本)9780889866386
This paper deals with a novel communication timing control for wireless networks and radio interference problem. Communication timing control is based on the mutual synchronization of coupled phase oscillatory dynamics with a stochastic adaptation. Through local and fully distributed interactions, the coupled phase dynamics self-organizes collision free communication timing. In a wireless communication, the influence of the interference wave causes unexpected collision. Therefore, we propose a more effective timing control by selecting the interaction nodes according to received signal strength.
Clusters of nondedicated heterogeneous nodes promise high utilization and performance. A market-based resource allocation allows effective and decentralized management and motivates participants to contribute to the f...
详细信息
ISBN:
(纸本)9780889866386
Clusters of nondedicated heterogeneous nodes promise high utilization and performance. A market-based resource allocation allows effective and decentralized management and motivates participants to contribute to the functionality of a cluster. Major issues for a user who wants to execute a task on a nondedicated cluster are to ensure data integrity and evaluate reasonably a target processor. We have proposed an auditing mechanism that allows a user to establish suitable prices of cluster computational resources in an untrusted system environment of heterogeneous nondedicated clusters. In a process of price evaluation, a user can detect resources that behave incorrectly.
暂无评论