Sciweavers

204 search results - page 35 / 41
» Continuations and Concurrency
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 10 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
ICCD
2008
IEEE
420views Hardware» more  ICCD 2008»
14 years 6 months ago
Frequency and voltage planning for multi-core processors under thermal constraints
— Clock frequency and transistor density increases have resulted in elevated chip temperatures. In order to meet temperature constraints while still exploiting the performance op...
Michael Kadin, Sherief Reda
TLDI
2009
ACM
108views Formal Methods» more  TLDI 2009»
14 years 6 months ago
Secure compilation of a multi-tier web language
Storing state in the client tier (in forms or cookies, for example) improves the efficiency of a web application, but it also renders the secrecy and integrity of stored data vul...
Ioannis G. Baltopoulos, Andrew D. Gordon
SAC
2009
ACM
14 years 4 months ago
GTfold: a scalable multicore code for RNA secondary structure prediction
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
Amrita Mathuriya, David A. Bader, Christine E. Hei...
ACSC
2007
IEEE
14 years 4 months ago
Conflict Management For Real-Time Collaborative Editing in Mobile Replicated Architectures
Mobile technology is particularly suited to a fully distributed (replicated) architecture for collaborative work. Users can maintain their own document copies, and can continue to...
Sandy Citro, Jim McGovern, Caspar Ryan