We present simple methods to enhance a recently proposed class of fully adaptive algorithms for fault tolerant wormhole routing. These algorithms are based on J. Duato's (1993) theory and are being used in several...
详细信息
We present simple methods to enhance a recently proposed class of fully adaptive algorithms for fault tolerant wormhole routing. These algorithms are based on J. Duato's (1993) theory and are being used in several research projects. We show that with three virtual channels per physical channel, multiple rectangular shaped fault blocks can be tolerated in two dimensional meshes. There is no restriction on the number of faults, and maintaining fault information locally is sufficient. The logic for fault tolerant routing is used only in the presence of faults, and there is no performance degradation in the absence of faults. The proposed technique incorporates fault tolerance into wormhole algorithms with simple logic and low virtual channel requirements.< >
Facilities such as interprocess communication and protection of shared resources have been added to operating systems to support multiprogramming and have since been adapted to exploit explicit multiprocessing within ...
详细信息
Facilities such as interprocess communication and protection of shared resources have been added to operating systems to support multiprogramming and have since been adapted to exploit explicit multiprocessing within the scope of two models: the shared-memory model and the distributed (message-passing) model. When multiprocessors (or networks of heterogeneous processors) are used for explicit parallelism, the difference between these models is exposed to the programmer. The p4 tool set was originally developed to buffer the programmer from synchronization issues while offering an added advantage in portability, however two models are often still needed to develop parallel algorithms. The authors provide two implementations of Linda in an attempt to support a single high-level programming model on top of the existing paradigms in order to provide a consistent semantics regardless of the underlying model. Linda's fundamental properties associated with generative communication eliminate the distinction between shared and distributed memory.< >
Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. The authors provide a general result which enables them to design de...
详细信息
Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. The authors provide a general result which enables them to design deadlock-free wormhole routing algorithms from store-and-forward routing algorithms that satisfy certain criteria. They illustrate this result by developing fully-adaptive deadlock-free wormhole routing algorithms from two well-known store-and-forward algorithms: the positive- and negative-hop algorithms based on the number of hops taken by messages. They compare the negative-hop algorithm with the commonly used non-adaptive e-cube and recently proposed partially adaptive north-last algorithm.< >
We improve here the expected performance of parallel algorithms for graph coloring. This is achieved through new adaptive techniques that may be useful for the average-case analysis of many graph algorithms. We apply ...
详细信息
A general construction for Steiner 2-designs with prime power block size (and with a point-regular automorphism group) is presented. Its success depends on number-theoretic restrictions on the parameters—these are co...
A general construction for Steiner 2-designs with prime power block size (and with a point-regular automorphism group) is presented. Its success depends on number-theoretic restrictions on the parameters—these are completely analysed in case of block sizes k ⩽ 11. The new designs constructed include infinitely many cyclic Steiner 2-designs with block size 7. Among them is a cyclic unital U (6), that is, an S (2, 6 + 1, 6 3 + 1). It is the first example of a unital with non-prime power parameter and the second example of a cyclic unital.
This volume contains papers presented at the 19th International Conference on Algorithmic Learning Theory (ALT 2008), which was held in Budapest, Hungary during October 13–16, 2008. The conference was co-located with...
详细信息
ISBN:
(数字)9783540879879
ISBN:
(纸本)9783540879862
This volume contains papers presented at the 19th International Conference on Algorithmic Learning Theory (ALT 2008), which was held in Budapest, Hungary during October 13–16, 2008. The conference was co-located with the 11th - ternational Conference on Discovery science (DS 2008). The technical program of ALT 2008 contained 31 papers selected from 46 submissions, and 5 invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2008 was the 19th in the ALT conference series, established in Japan in 1990. The series Analogical and Inductive Inference is a predecessor of this series: it was held in 1986, 1989 and 1992, co-located with ALT in 1994, and s- sequently merged with ALT. ALT maintains its strong connections to Japan, but has also been held in other countries, such as Australia, Germany, Italy, Sin- pore, Spain and the USA. The ALT conference series is supervised by its Steering Committee: Naoki Abe (IBM T. J.
暂无评论