Sciweavers

1078 search results - page 81 / 216
» Analyzing DB2 Data Sharing Performance Problems
Sort
View
PPOPP
2012
ACM
13 years 8 months ago
Synchronization views for event-loop actors
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
Joeri De Koster, Stefan Marr, Theo D'Hondt
91
Voted
ASPLOS
2010
ACM
15 years 7 months ago
Power routing: dynamic power provisioning in the data center
Data center power infrastructure incurs massive capital costs, which typically exceed energy costs over the life of the facility. To squeeze maximum value from the infrastructure,...
Steven Pelley, David Meisner, Pooya Zandevakili, T...
111
Voted
STACS
2005
Springer
15 years 6 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 27 days ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
ICDCS
2007
IEEE
15 years 7 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta