Sciweavers

819 search results - page 22 / 164

» Parallelization with Tree Skeletons

148

ICPP
1999
IEEE

83views Distributed And Parallel Com...» more ICPP 1999»

An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques

15 years 10 months ago

An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques

Download anyserver.cityu.edu.hk

Weijia Jia, Gaochao Xu, Dong Xuan, Wei Zhao

claim paper

Read More »

127

ICPP
1997
IEEE

120views Distributed And Parallel Com...» more ICPP 1997»

Embedding of binomial trees in hypercubes with link faults

15 years 10 months ago

Embedding of binomial trees in hypercubes with link faults

Download www.cis.temple.edu

Jie Wu, Eduardo B. Fernández, Yingquiu Luo

claim paper

Read More »

133

IPPS
1993
IEEE

95views Distributed And Parallel Com...» more IPPS 1993»

Reconfiguration of Binary Trees in Faulty Hypercubes

15 years 10 months ago

Reconfiguration of Binary Trees in Faulty Hypercubes

Download etdncku.lib.ncku.edu.tw

Pei-Ji Yang, C. S. Raghavendra

claim paper

Read More »

115

ICPADS
1994
IEEE

82views Distributed And Parallel Com...» more ICPADS 1994»

Experiments on High-Priority Cold Requests in the Presence of Tree Saturation

15 years 10 months ago

Experiments on High-Priority Cold Requests in the Presence of Tree Saturation

Download ilab1.korea.ac.kr

Jin-Ho Lee, Myong-Soon Park

claim paper

Read More »

176

PPOPP
2012
ACM

272views Distributed and Parallel Com...» more PPOPP 2012»

A speculation-friendly binary search tree

14 years 1 months ago

A speculation-friendly binary search tree

Download lpd.epfl.ch

We introduce the ﬁrst binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...

Tyler Crain, Vincent Gramoli, Michel Raynal

claim paper

Read More »

« Prev « First page 22 / 164 Last » Next »