To keep up withthe 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 withthe 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.
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.
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.
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.
Emerging multiple display infrastructures provide users with a large number of semi-public and private displays. Selecting what information to present on which display here becomes a real issue, especially when multip...
详细信息
ISBN:
(纸本)9780889866386
Emerging multiple display infrastructures provide users with a large number of semi-public and private displays. Selecting what information to present on which display here becomes a real issue, especially when multiple users with diverging interests have to be considered. this especially holds for dynamic ensembles of displays. We propose to cast the Display Mapping problem as an optimization task. We develop an explicit criterion for the global quality of a display mapping and then describe a distributed algorithm based on the GRASP framework that is able to approximate the global optimum through local interaction between display devices. We claim that such a distributed optimization approach, based on the definition of an explicit global quality measure, is a general concept for achieving coherent ensemble behavior.
this paper describes a novel approach to deterministic multithreading for active replication of Java objects. Unlike other existing approaches, the presented deterministic thread scheduler fully supports the native Ja...
详细信息
ISBN:
(纸本)9780889866386
this paper describes a novel approach to deterministic multithreading for active replication of Java objects. Unlike other existing approaches, the presented deterministic thread scheduler fully supports the native Java synchronisation mechanisms, including reentrant locks, condition variables, and time bounds on wait operations. Furthermore, this paper proposes source-code transformation as a novel approach for intercepting Java synchronisation statements. this allows the reuse of existing object implementations and simplifies application development.
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.
distributed service architectures are mandatory to handle the platform scale and dynamicity hindering the development of grid and P2P applications. these large-scaled distributed applications are difficult to design, ...
详细信息
ISBN:
(纸本)9780889866386
distributed service architectures are mandatory to handle the platform scale and dynamicity hindering the development of grid and P2P applications. these large-scaled distributed applications are difficult to design, develop and tune because of boththeoretical and practical issues. this paper presents the GRAS framework that allows developers to first implement and experiment with such an infrastructure in simulation, benefiting from a controlled environment. the infrastructure can then be deployed in situ without code modification. We detail our design goals, and contrast them withthe state of the art. We study the exchange of a message (from the Pastry protocol) using either GRAS 0 or several other solutions. We quantify boththe code complexity and the performance and find that GRAS performs better according to both metrics.
暂无评论