In this paper, we investigate the routing of a message on circulant networks, that is a key to the performance of this network. We would like to transmit 2k packets from a source node to a destination node simultaneou...
详细信息
ISBN:
(纸本)3540240136
In this paper, we investigate the routing of a message on circulant networks, that is a key to the performance of this network. We would like to transmit 2k packets from a source node to a destination node simultaneously along paths on G(n;+/- s(1), +/- s(2), ..., +/- s(k)), where the i(th) packet will traverse along the i(th) path (1 < i < 2k). In oder for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS) we present O(n(2)) parallel routing algorithm on circulant networks.
this paper proposes a novel View-Oriented parallel Programming style for parallel programming on cluster computers. View-Oriented parallel Programming is based on distributed Shared Memory. It requires the programmer ...
详细信息
ISBN:
(纸本)3540240136
this paper proposes a novel View-Oriented parallel Programming style for parallel programming on cluster computers. View-Oriented parallel Programming is based on distributed Shared Memory. It requires the programmer to divide the shared memory into views according to the nature of the parallel algorithm and its memory access pattern. the advantage of this programming style is that it can help the distributed Shared Memory system optimise consistency maintenance. Also it allows the programmer to participate in performance optimization of a program through wise partitioning of the shared memory into views. the View-based Consistency model and its implementation, which supports View-Oriented parallel Programming, is discussed as well in this paper. Finally some preliminary experimental results are shown to demonstrate the performance gain of View-Oriented parallel Programming.
Known as an NP-Complete problem, the channel routing problem is very important in the automatic layout design of VLSI circuit and printed circuit boards. In this paper, a distributed genetic algorithm for this channel...
详细信息
ISBN:
(纸本)3540240136
Known as an NP-Complete problem, the channel routing problem is very important in the automatic layout design of VLSI circuit and printed circuit boards. In this paper, a distributed genetic algorithm for this channel routing problem is presented in MPI environments. Each node executes genetic operations to own sub-population and communicates synchronously with other nodes to form the global population. the experimental results show that the proposed algorithm maintains the convergence properties of sequential genetic algorithm.
Nowadays, it is very important that integrating parallel processors on a chip offers high performance and low interactive response time on applications with fine-grained parallelism and high degree of data sharing. We...
详细信息
ISBN:
(纸本)3540240136
Nowadays, it is very important that integrating parallel processors on a chip offers high performance and low interactive response time on applications with fine-grained parallelism and high degree of data sharing. We propose a novel real-shared cache module with new multiport ring-bus architecture to overcome the bus bottleneck problem of the existing parallel processors chip on shared cache level. A testbench of solving a large scale of simultaneous linear equation is also designed to evaluate such architecture. the evaluation results show that it can offer immediate data sharing without conflicts or delay, and the performance of parallel processors chips with such novel real-shared cache module improves in proportion to the number of processor elements.
this paper describes a parallel application for phylogenetic analysis of DNA sequences. the program extends the phylogenetics program Trexml to increase the speed of this rather exhaustive tree searching program. the ...
详细信息
ISBN:
(纸本)3540240136
this paper describes a parallel application for phylogenetic analysis of DNA sequences. the program extends the phylogenetics program Trexml to increase the speed of this rather exhaustive tree searching program. the program uses the Advanced Stepwise Addition Algorithm (ASA) and provides two main advantages over existing applications. the size of the tree space can be chosen in such a way that we can fully utilize super computing resources. We also adopt a Single Program multiple Data (SPMD) approach in our program and use deterministic means to evaluate which processors are involved in communication. this approach alleviates the communication costs incurred in a master/slave system. Results from running the program on the AC3 Barossa supercomputer indicate that our approach scales well.
Grid computing is the key technology of next generation Internet. A promising way of solving the problem of resource allocation in a grid environment is a procedure based upon resource pricing. In Grid computing Envir...
详细信息
ISBN:
(纸本)3540240136
Grid computing is the key technology of next generation Internet. A promising way of solving the problem of resource allocation in a grid environment is a procedure based upon resource pricing. In Grid computing Environment, it is very important how to allocate resources for achieving the goal of high effective utilization of resources. this paper targets the problem of resource allocation on the grid. In this paper, we propose a framework for price-based resource allocation and resources pricing algorithm to achieve maximized utilization of grid resources.
Checkpointing and recovery in traditional distributed systems is relatively well established. However, checkpointing and recovery in multithreaded distributed systems has not been studied in the literature. Using the ...
详细信息
ISBN:
(纸本)3540240136
Checkpointing and recovery in traditional distributed systems is relatively well established. However, checkpointing and recovery in multithreaded distributed systems has not been studied in the literature. Using the traditional checkpointing and recovery algorithms in multithreaded systems leads to false causality problem and high checkpointing overhead. the checkpointing algorithm is implemented at the process level to reduce number of checkpoints and the recovery algorithm is implemented at the thread level which minimizes the false causality problem. the algorithm also takes advantage of the communication-induced checkpointing method to reduce the message overhead.
the Computational Grid is a promising computing platform for solving the problem of large-scale resource allocation. In order to build large-scale of the grid computing systems, some obvious problems of grid computing...
详细信息
ISBN:
(纸本)3540240136
the Computational Grid is a promising computing platform for solving the problem of large-scale resource allocation. In order to build large-scale of the grid computing systems, some obvious problems of grid computing, such as: security, resource scheduling and management, authentication and authorization, have attracted more attention and research. Charging and accounting is an important part of grid computing, and will lead to develop the grid computing systems. the aim of this paper is to propose a service-oriented accounting architecture that involves many services interaction on the grid. In this paper, we describe firstly architecture of charging and accounting and its support system. then, we give briefly an introduction to pricing schemes and accounting policies.
Synchronous collaborative systems allow geographically distributed users to form a virtual work environment enabling cooperation between peers and enriching the human interaction. the technology facilitating this inte...
详细信息
In sender-initiated load balancing algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver-initiated...
详细信息
ISBN:
(纸本)3540240136
In sender-initiated load balancing algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver-initiated load balancing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is low. these unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic based approach for improved sender-initiated and receiver-initiated load balancing in distributed systems.
暂无评论