906 search results - page 62 / 182 » Linking Theories of Concurrency |
134
click to vote
JSSPP
2009
Springer
16 years 21 days ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
168
click to vote
USENIX
2003
15 years 7 months ago
2003
Read-copy update (RCU) allows lock-free read-only access to data structures that are concurrently modified on SMP systems. Despite the concurrent modifications, read-only access...
178
click to vote
TELSYS
2002
15 years 5 months ago
2002
The path recovery in MPLS is the technique to reroute traffic around a failure or congestion in a LSP. Currently, there are two kinds of model for path recovery: rerouting and prot...
163
click to vote
CHI
2007
ACM
15 years 10 months ago
2007
ACM
Using data from a popular online social network site, this paper explores the relationship between profile structure (namely, which fields are completed) and number of friends, gi...
151
click to vote
IANDC
2006
15 years 6 months ago
2006
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...