1236 search results - page 211 / 248 » Prefix-Like Complexities and Computability in the Limit |
HPCA
1998
IEEE
15 years 2 months ago
1998
IEEE
As we look to the future, and the prospect of a billion transistors on a chip, it seems inevitable that microprocessors will exploit having multiple parallel threads. To achieve t...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Software DSMs have been a research topic for over a decade. While good performance has been achieved in some cases, consistent performance has continued to elude researchers. This...
SIGGRAPH
1992
ACM
15 years 1 months ago
1992
ACM
We present a new approachto interactive modeling of freeform surfaces. Instead of a fixed mesh of control points, the model presented to the user is that of an infinitely malleabl...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...