Sciweavers

1519 search results - page 49 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
IPPS
1999
IEEE
14 years 1 months ago
Compiler Analysis to Support Compiled Communication for HPF-Like Programs
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
Xin Yuan, Rajiv Gupta, Rami G. Melhem
ICDCSW
2002
IEEE
14 years 2 months ago
DBGlobe: A Data-Centric Approach to Global Computing
In the near future, there will be increasingly powerful computers in smart cards, telephones, and other information appliances. This will create a massive infrastructure composed ...
Alexandros Karakasidis, Evaggelia Pitoura
HPDC
2005
IEEE
14 years 2 months ago
Adaptive data block scheduling for parallel TCP streams
Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. W...
Thomas J. Hacker, Brian D. Noble, Brian D. Athey
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 3 months ago
Mining in a mobile environment
Distributed PRocessing in Mobile Environments (DPRiME) is a framework for processing large data sets across an ad-hoc network. Developed to address the shortcomings of Google’s ...
Sean McRoskey, James Notwell, Nitesh V. Chawla, Ch...
MOBIDE
2005
ACM
14 years 2 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel