Sciweavers

97 search results - page 5 / 20
» Concurrent Non-Malleable Commitments
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Reasoning intra-dependency in commitments for robust scheduling
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
Mingzhong Wang, Kotagiri Ramamohanarao, Jinjun Che...
SAC
2002
ACM
13 years 7 months ago
Computational adjustable autonomy for NASA Personal Satellite Assistants
We will describe a simulator and simulated teamwork among a number of Personal Satellite Assistants (PSA) onboard the simulated space station patrolling for problem detection and ...
Henry Hexmoor, Justin Tyrel Vaughn
ICEBE
2007
IEEE
115views Business» more  ICEBE 2007»
14 years 2 months ago
A Concurrent G-Negotiation Mechanism for Grid Resource Co-allocation
Since computationally intensive applications may often require more resources than a single computing machine can provide in one administrative domain, bolstering resource co-allo...
Benyun Shi, Kwang Mong Sim
PPOPP
2009
ACM
14 years 8 months ago
Committing conflicting transactions in an STM
Dependence-aware transactional memory (DATM) is a recently proposed model for increasing concurrency of memory transactions without complicating their interface. DATM manages depe...
Hany E. Ramadan, Indrajit Roy, Maurice Herlihy, Em...
PODC
2010
ACM
13 years 11 months ago
Brief announcement: on enhancing concurrency in distributed transactional memory
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
Bo Zhang, Binoy Ravindran