Sciweavers

1053 search results - page 50 / 211
» Estimating Execution Time of Distributed Applications
Sort
View
SAC
2005
ACM
14 years 3 months ago
Handling run-time updates in distributed applications
The server side of business software systems is commonly implemented today by an ensemble of Java classes distributed over several hosts. In this scenario, it is often necessary, ...
Marco Milazzo, Giuseppe Pappalardo, Emiliano Tramo...
ICDCS
1997
IEEE
14 years 2 months ago
Predictable Network Computing
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...
Andreas Polze, Gerhard Fohler, Matthias Werner
SAC
2011
ACM
13 years 22 days ago
Site-autonomous distributed semantic caching
Semantic caching augments cached data with a semantic description of the data. These semantic descriptions can be used to improve execution time for similar queries by retrieving ...
Norvald H. Ryeng, Jon Olav Hauglid, Kjetil N&oslas...
ARC
2010
Springer
138views Hardware» more  ARC 2010»
14 years 1 months ago
Space and Time Sharing of Reconfigurable Hardware for Accelerated Parallel Processing
High-Performance Reconfigurable Computers (HPRCs) are parallel machines consisting of FPGAs and microprocessors, with the FPGAs used as co-processors. The execution of parallel app...
Esam El-Araby, Vikram K. Narayana, Tarek A. El-Gha...
CIDR
2007
165views Algorithms» more  CIDR 2007»
13 years 11 months ago
A Black-Box Approach to Query Cardinality Estimation
We present a “black-box” approach to estimating query cardinality that has no knowledge of query execution plans and data distribution, yet provides accurate estimates. It doe...
Tanu Malik, Randal C. Burns, Nitesh V. Chawla