Sciweavers

130 search results - page 21 / 26
» Online Prediction of the Running Time of Tasks
Sort
View
VLDB
2008
ACM
127views Database» more  VLDB 2008»
15 years 12 months ago
Delay aware querying with Seaweed
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
Dushyanth Narayanan, Austin Donnelly, Richard Mort...
CACM
1998
103views more  CACM 1998»
14 years 11 months ago
The Virtual Design Team
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
John C. Kunz, Tore R. Christiansen, Geoff P. Cohen...
IPPS
2007
IEEE
15 years 6 months ago
Low-Overhead LogGP Parameter Assessment for Modern Interconnection Networks
Network performance measurement and prediction is very important to predict the running time of high performance computing applications. The LogP model family has been proven to b...
Torsten Hoefler, Andre Lichei, Wolfgang Rehm
IPPS
2006
IEEE
15 years 5 months ago
A performance model for fine-grain accesses in UPC
UPC’s implicit communication and fine-grain programming style make application performance modeling a challenging task. The correspondence between remote references and communi...
Zhang Zhang, S. R. Seidel
115
Voted
PDP
2008
IEEE
15 years 6 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín