Sciweavers

188 search results - page 8 / 38
» Finding Best k Policies
Sort
View
CLUSTER
2004
IEEE
14 years 1 months ago
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
Hashim H. Mohamed, Dick H. J. Epema
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
14 years 1 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala
IPPS
2007
IEEE
14 years 4 months ago
Improving Secure Communication Policy Agreements by Building Coalitions
In collaborative applications, participants agree on certain level of secure communication based on communication policy speciļ¬cations. Given secure communication policy speciļ¬...
Srilaxmi Malladi, Sushil K. Prasad, Shamkant B. Na...
IEEEPACT
2006
IEEE
14 years 3 months ago
Communist, utilitarian, and capitalist cache policies on CMPs: caches as a shared resource
As chip multiprocessors (CMPs) become increasingly mainstream, architects have likewise become more interested in how best to share a cache hierarchy among multiple simultaneous t...
Lisa R. Hsu, Steven K. Reinhardt, Ravishankar R. I...
CHI
2008
ACM
14 years 10 months ago
Don't look now, but we've created a bureaucracy: the nature and roles of policies and rules in wikipedia
Wikis are sites that support the development of emergent, collective infrastructures that are highly flexible and open, suggesting that the systems that use them will be egalitari...
Brian S. Butler, Elisabeth Joyce, Jacqueline Pike