Filters








17 Hits in 3.8 sec

Optimal Subcube Allocation in a Circuit-Switched Faulty Hypercube

Baback A. Izadi, Füsun Özgüner
1998 Parallel Processing Letters  
In this paper, we present a s c heme where a (d;1)-dimensional subcube is allocated in a faulty d-dimensional circuit-switched hypercube in the presence of up to 2 (d;1) faulty nodes.  ...  The scheme is then extended to allocate a (d;1)-dimensional subcube in the presence of a combination of faulty nodes and faulty links.  ...  In this paper, we present a scheme for circuit-switched hypercubes where a (d;1)dimensional subcube is allocated in a faulty d-dimensional hypercube in the presence of up to 2 (d;1) faulty nodes and extend  ... 
doi:10.1142/s0129626498000109 fatcat:qmtfpxdjj5da5g7oljm7as4mhu

Page 2040 of Mathematical Reviews Vol. , Issue 99c [page]

1991 Mathematical Reviews  
in the case of an n-by-n torus.” 99¢:68015 68M10 68M15 Izadi, Baback A.; Ozgiiner, Fiisun (1-OHS-EE; Columbus, OH) Optimal subcube allocation in a circuit-switched faulty hypercube.  ...  Summary: “In this paper, we present a scheme where a (d — 1)- dimensional subcube is allocated in a faulty d-dimensional circuit- switched hypercube in the presence of up to 2‘/~!) faulty nodes.  ... 

Broadcasting on incomplete hypercubes

Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang
1993 IEEE transactions on computers  
Abstract-Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes.  ...  The broadcasting algorithm is strictly optimal.  ...  Incomplete hypercubes can also be derived from faulty hypercubes or from allocations of subsets of hypercube nodes, which do not necessarily form subcubes.  ... 
doi:10.1109/12.247842 fatcat:jyqp3j5tkzbb5eutdtwn6vrhwe

Enhanced cluster k-Ary n-cube, a fault-tolerant multiprocessor

B.A. Izadi, F. Ozguner
2003 IEEE transactions on computers  
Our approach utilizes the capabilities of the wave-switching communication modules of the spare nodes to tolerate a large number of faulty nodes.  ...  Each set of j n regular nodes is connected to a spare node and the spare nodes are interconnected as either a ð k j Þ-ary n-cube if j 6 ¼ k 2 or a hypercube of dimension n if j ¼ k 2 .  ...  Wave-switching implements circuit-switching and wormhole-switching concurrently; permanent connections and long messages use the circuit-switched segment, while short messages are transmitted using the  ... 
doi:10.1109/tc.2003.1244942 fatcat:76wabesx4za77btlgm7n4jmowi

Page 2845 of Mathematical Reviews Vol. , Issue 94e [page]

1994 Mathematical Reviews  
Summary: “We consider the problem of determining the mini- mum number of faulty processors, x(n,m), and of faulty links, A(n,m), in an n-dimensional hypercube computer such that every m-dimensional subcube  ...  This method is based on counting the number of node- disjoint paths of optimal length between a given pair of nodes in the graph and distributing the faulty nodes among these paths in a worst-case fashion  ... 

Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes

H. Ko, S. Latifi, P.K. Srimani
2000 IEEE Transactions on Parallel and Distributed Systems  
The delay in transmitting a ready signal from the destination to the source in circuit switching is also ignoredComparison of different switching techniques; (I) store-and-forward switching;(2) circuit  ...  In circuit switching, a physical circuit is constructed between the source and destination nodes. After the packet has been transmitted along the circuit to the destination, the circuit is tom down.  ... 
doi:10.1109/71.841741 fatcat:7pq4vyjip5bzdpa2jiiazgdmv4

Optimal subcube fault tolerance in a circuit-switched hypercube

B.A. Izadi, F. Ozguner
Proceedings of International Conference on Parallel Processing  
In this papel; by utilizing the circuit-switched communication modules of the hypercube nodes, we present a scheme where a (d -1)-dimensional subcube is allocated in afaulty d-dimensional hyperc,ube in  ...  The scheme is then extended to allocate a (d -1)-dimensional subcube in the presence of a combination of faulty node,s and faulty links.  ...  In this paper, we present a scheme for circuit-switched hypercubes where a (d-1)-dimensional subcube is allocated in a faulty d-dimensional hypercube in the presence of up to 2cd-i) faulty node,s.  ... 
doi:10.1109/ipps.1996.508127 dblp:conf/ipps/IzadiO96 fatcat:nsumrdek3jgfpbpfxxpy7pmkti

Low-power and high-performance adaptive routing in on-chip networks

Dong Xiang, Qunyang Pan
2019 CCF Transactions on High Performance Computing  
A new low-power fully adaptive routing algorithm is proposed for virtual cut-through or wormhole switched networks-on-chip.  ...  Performance and power are two conflict requirements in a NoC. It is attractive to propose a low-power and high-performance routing scheme.  ...  Xiang (2001) proposed a new safety information model called local safety information to guide fault-tolerant routing in hypercubes, which considered safety inside subcubes instead of the whole network  ... 
doi:10.1007/s42514-019-00009-5 fatcat:c746jnuvi5e3nlgwr5lqxcqjmi

Page 1582 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews  
(English summary) 99k:68138 Izadi, Bayack A. (with Ozgiiner, Fiisun) Optimal subcube allocation in a circuit-switched faulty hypercube. (English summary) 99c:68015 Jayashree, P.  ...  On ring embedding in hypercubes with faulty nodes and links. (English summary) 99h:68022 — see also Viswanathan, Suresh, 99e:68009 Sridharan, Varadachari (with Jayashree, P. R.)  ... 

Page 1922 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
Message transmission in defective hypercubes using defect-free subcubes. (Russian.  ...  ., 20011:68062 Diks, Krzysztof (with Pelc, Andrzej) Optimal adaptive broadcasting with a bounded fraction of faulty nodes.  ... 

Parallel and Distributed Algorithms (Dagstuhl Seminar 9210)

Richard Cole, Ernst W. Mayr, Friedhelm Meyer auf der Heide
1992
All of our algorithms run optimally in constant time with high probability.  ...  A Perfect Parallel Dictionary by MARTIN DIETZFELBINGER (joint work with Holger Bast and Torben Hagerup) We describe new randomized parallel algorithms for the problems of interval allocation, construction  ...  Embedding Complete Binary Trees in Faulty Hypercubes by ERNST W.  ... 
doi:10.4230/dagsemrep.33 fatcat:urh5z5caj5f3tduudcrwbj2d6u

Subject Index to Volumes 1–75

2001 Information Processing Letters  
actors, 1035 statements, 3405 switched capacitor circuits, 1611 filters, 1611 switching, 817, 1466, 2724, 3463, 4024 algorithm, 630, 665 boxes, 2525 class, 4052 classes of graphs, 4052 elements  ...  drawing, 3666 description, 663 domains, 1080, 1235 linear circuits, 4088 logic circuits, 751 projections, 762 resolution proofs, 1925 size of the description of a finite automaton, 663 inaccessible  ...  Rayward-Smith, 1675 Steiner tree heuristic, 1675 Razborov and Smolensky, 2040 RC, 44, 4000 RCA, 2430 RE charts, 464 reachability, 128, 129, 701, 1150 , 2012 , 2253 , 2616 , 3584, 4007 algorithm, 4021 in  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e

Page 1310 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews  
Optimal subcube allocation in a circuit-switched faulty hypercube. (English summary) Parallel Process. Lett. 8 (1998), no. 1, 77-81.  ...  (with Derdiyok, A.; inang, N.; Bilgic, M. O.) Improving performance of switched reluctance motor by fuzzy logic controller. (English summary) Internat. J.  ... 

Planar-Adaptive Routing: Low-cost Adaptive Networks for Multiprocessors

A.A. Chien, Jae H. Kim
[1992] Proceedings the 19th Annual International Symposium on Computer Architecture  
Direct networks adopted in most recent multiprocessors and multicomputers use deterministic routing which allocates network resources in exibly, which can prevent full utilization of the physical channels  ...  computers are now in use for a wide range of application problems.  ...  By monopolizing the path, circuit switching can guarantee a xed amount of bandwidth. However, circuit switching has two primary drawbacks.  ... 
doi:10.1109/isca.1992.753323 fatcat:pn3tjz76fraxvlbwm2udyqpy6q

An FPGA-based syntactic parser for large size real-life context-free grammars

Cristian Raul Ciressan
2005
algorithms in a cost-effective solution.  ...  In addition, the FPGA technology makes it possible to efficiently design and test such a hardware coprocessor.  ...  The switching waveform for the first case is given in figure 3.7(a).  ... 
doi:10.5075/epfl-thesis-2522 fatcat:n6bgxcgy75etvir4ajmm4q6h2a
« Previous Showing results 1 — 15 out of 17 results