Sciweavers

164 search results - page 6 / 33
» Primitives for Contract-based Synchronization
Sort
View
CCS
2008
ACM
14 years 26 days ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
SAC
2009
ACM
14 years 5 months ago
Decomposing port automata
Port automata are an operational model for component connectors in a coordination language such as Reo. They describe which sets of ports can synchronize in each state of the conn...
Christian Koehler, Dave Clarke
EUROPAR
2004
Springer
14 years 4 months ago
Understanding the Behavior and Performance of Non-blocking Communications in MPI
The behavior and performance of MPI non-blocking message passing operations are sensitive to implementation specifics as they are heavily dependant on available system level buff...
Taher Saif, Manish Parashar
CSREAESA
2010
13 years 9 months ago
Customizable and Predictable Synchronization in a Component-Based OS
Component-based operating systems enable embedded systems to adapt system policies, mechanisms, and abstractions to the specific workloads and contexts of each system. The scope o...
Gabriel Parmer, Jiguo Song
CACM
2008
100views more  CACM 2008»
13 years 11 months ago
TxLinux and MetaTM: transactional memory and the operating system
TxLinux is the first operating system to use hardware transactional memory (HTM) as a synchronization primitive, and the first to manage HTM in the scheduler. TxLinux, which is a ...
Christopher J. Rossbach, Hany E. Ramadan, Owen S. ...