Sciweavers

118 search results - page 19 / 24
» Transactional file systems can be fast
Sort
View
102
Voted
TWC
2010
14 years 6 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim
EUROSYS
2008
ACM
15 years 8 months ago
Application-level isolation and recovery with solitude
When computer systems are compromised by an attack, it is difficult to determine the precise extent of the damage caused by the attack because the state changes made by an attack...
Shvetank Jain, Fareha Shafique, Vladan Djeric, Ash...
89
Voted
HOTOS
1999
IEEE
15 years 4 months ago
A Case for Buffer Servers
Faster networks and cheaper storage have brought us to a point where I/O caching servers have an important role in the design of scalable, high-performance file systems. These int...
Darrell C. Anderson, Ken Yocum, Jeffrey S. Chase
HICSS
2003
IEEE
132views Biometrics» more  HICSS 2003»
15 years 5 months ago
Establishing a Contact Centre for Public Health Care
A growing part of population is used to performing transactions on-line via the Internet, even in relationships to authorities. Not even the health care sector can escape this tre...
Reima Suomi, Jarmo Tähkäpää
64
Voted
IPPS
2010
IEEE
14 years 9 months ago
Parallel I/O performance: From events to ensembles
Parallel I/O is fast becoming a bottleneck to the research agendas of many users of extreme scale parallel computers. The principle cause of this is the concurrency explosion of hi...
Andrew Uselton, Mark Howison, Nicholas J. Wright, ...