Sciweavers

513 search results - page 24 / 103
» A Cost Benefit Model for Dynamic Resource Sharing
Sort
View
CHI
2007
ACM
16 years 6 months ago
A cognitive constraint model of dual-task trade-offs in a highly dynamic driving task
The paper describes an approach to modeling the strategic variations in performing secondary tasks while driving. In contrast to previous efforts that are based on simulation of a...
Duncan P. Brumby, Andrew Howes, Dario D. Salvucci
HPCC
2005
Springer
15 years 11 months ago
Reducing Memory Sharing Overheads in Distributed JVMs
Distributed JVM systems enable concurrent Java applications to transparently run on clusters of commodity computers by supporting Java’s shared-memory model over multiple JVMs di...
Marcelo Lobosco, Orlando Loques, Claudio Luis de A...
TR
2008
107views more  TR 2008»
15 years 5 months ago
A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time
Shared Segment Protection (SSP), compared with Shared Path Protection (SPP), and Shared Link Protection (SLP), provides an optimal protection configuration due to the ability of ma...
János Tapolcai, Pin-Han Ho, Dominique Verch...
CLUSTER
2003
IEEE
15 years 11 months ago
Run-Time Prediction of Parallel Applications on Shared Environments
Application run-time information is a fundamental component in application and job scheduling. However, accurate predictions of run times are difficult to achieve for parallel app...
Byoung-Dai Lee, Jennifer M. Schopf
DSN
2006
IEEE
16 years 1 days ago
Designing dependable storage solutions for shared application environments
The costs of data loss and unavailability can be large, so businesses use many data protection techniques, such as remote mirroring, snapshots and backups, to guard against failur...
Shravan Gaonkar, Kimberly Keeton, Arif Merchant, W...