Sciweavers

94 search results - page 14 / 19
» Tight Bounds for Parallel Randomized Load Balancing
Sort
View
ICPADS
1998
IEEE
14 years 3 days ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
IPPS
2003
IEEE
14 years 1 months ago
Performance Properties of Combined Heterogeneous Networks
In this paper we study the performance properties of combined multiple heterogeneous networks. Consider two nodes node1 and node2 with multiple heterogeneous physical networks con...
Nader Mohamed, Jameela Al-Jaroodi, Hong Jiang, Dav...
HICSS
1999
IEEE
178views Biometrics» more  HICSS 1999»
14 years 4 days ago
Collaborative Web Crawling: Information Gathering/Processing over Internet
The main objective of the IBM Grand Central Station (GCS) is to gather information of virtually any type of formats (text, data, image, graphics, audio, video) from the cyberspace...
Shang-Hua Teng, Qi Lu, Matthias Eichstaedt, Daniel...
PVLDB
2008
126views more  PVLDB 2008»
13 years 7 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
SPAA
1998
ACM
14 years 2 days ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller