Sciweavers

10805 search results - page 291 / 2161
» Mapping Computation with No Memory
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
16 years 1 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
15 years 7 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...
NCA
2008
IEEE
16 years 1 months ago
Finite Memory: A Vulnerability of Intrusion-Tolerant Systems
In environments like the Internet, faults follow unusual patterns, dictated by the combination of malicious attacks with accidental faults such as long communication delays caused...
Giuliana Santos Veronese, Miguel Correia, Lau Cheu...
PPOPP
2005
ACM
16 years 7 days ago
Composable memory transactions
Writing concurrent programs is notoriously difficult, and is of increasing practical importance. A particular source of concern is n correctly-implemented concurrency abstraction...
Tim Harris, Simon Marlow, Simon L. Peyton Jones, M...