31 search results - page 1 / 7 » Deadlock-free Channels and Locks |
ICTAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
ITNG
2008
IEEE
15 years 4 months ago
2008
IEEE
In our previous work, a Multi-Path Routing (MPR) scheme was proposed to maximize the data throughput for torus-based NoCs by utilizing multiple paths for concurrent data transmiss...
CONCUR
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
CASCON
2004
14 years 11 months ago
2004
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...