Sciweavers

3047 search results - page 177 / 610
» Randomized Parallel Selection
Sort
View
ALGORITHMICA
2000
72views more  ALGORITHMICA 2000»
14 years 11 months ago
Sorting-Based Selection Algorithms for Hypercubic Networks
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
Pascal Berthomé, Afonso Ferreira, Bruce M. ...
IPPS
1999
IEEE
15 years 3 months ago
An Adaptive, Fault-Tolerant Implementation of BSP for JAVA-Based Volunteer Computing Systems
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
Luis F. G. Sarmenta
GLOBECOM
2007
IEEE
15 years 5 months ago
Multicode STBC in Frequency Selective Fading
—Multicode operation in space-time block coded (STBC) multiple input multiple output (MIMO) systems can provide additional degrees of freedom in code domain to achieve high data ...
Saif K. Mohammed, Ananthanarayanan Chockalingam
ICDCSW
2003
IEEE
15 years 4 months ago
Scaling Server Selection Using a Multi-Broker Architecture
Server replication is a common approach to improving the scalability of a service on the Internet. For this approach, the task of finding an appropriate server from a set of repli...
Mohamed-Vall O. Mohamed-Salem, Gregor von Bochmann...
HPCA
2004
IEEE
15 years 11 months ago
Reducing Branch Misprediction Penalty via Selective Branch Recovery
Branch misprediction penalty consists of two components: the time wasted on mis-speculative execution until the mispredicted branch is resolved and the time to restart the pipelin...
Amit Gandhi, Haitham Akkary, Srikanth T. Srinivasa...