Sciweavers

2438 search results - page 486 / 488
» Scheduling problems for parallel and distributed systems
Sort
View
ICS
2010
Tsinghua U.
14 years 4 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
IEEEPACT
2009
IEEE
14 years 2 months ago
Using Aggressor Thread Information to Improve Shared Cache Management for CMPs
—Shared cache allocation policies play an important role in determining CMP performance. The simplest policy, LRU, allocates cache implicitly as a consequence of its replacement ...
Wanli Liu, Donald Yeung
CCGRID
2007
IEEE
14 years 1 months ago
Integrated Data Reorganization and Disk Mapping for Reducing Disk Energy Consumption
Increasing power consumption of high-performance systems leads to reliability, survivability, and cooling related problems. Motivated by this observation, several recent efforts f...
Seung Woo Son, Mahmut T. Kandemir
GRID
2005
Springer
14 years 28 days ago
Adaptive trust negotiation and access control for grids
— Access control in computational grids is typically provided by a combination of identity certificates and local accounts. This approach does not scale as the number of users a...
Tatyana Ryutov, Li Zhou, B. Clifford Neuman, Noria...
SPAA
2009
ACM
14 years 4 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...