Sciweavers

583 search results - page 48 / 117
» Performance Evaluation of Multicast Cost Sharing Mechanisms
Sort
View
ICPP
2006
IEEE
15 years 4 months ago
Data Sharing Pattern Aware Scheduling on Grids
These days an increasing number of applications, especially in science and engineering, are dealing with a massive amount of data; hence they are dataintensive. Bioinformatics, da...
Young Choon Lee, Albert Y. Zomaya
SIGMOD
2011
ACM
220views Database» more  SIGMOD 2011»
14 years 23 days ago
Zephyr: live migration in shared nothing databases for elastic cloud platforms
Multitenant data infrastructures for large cloud platforms hosting hundreds of thousands of applications face the challenge of serving applications characterized by small data foo...
Aaron J. Elmore, Sudipto Das, Divyakant Agrawal, A...
IPPS
2003
IEEE
15 years 3 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
INFOCOM
2003
IEEE
15 years 3 months ago
User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
Sem C. Borst
NGC
2000
Springer
15 years 1 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi