Showing papers by "Michael I. Schwartzbach published in 2009"
••
21 Jul 2009
TL;DR: The first large-scale and practical application of secure multiparty computation, which took place in January 2008, is reported on and the novel cryptographic protocols used are reported on.
Abstract: In this note, we report on the first large-scale and practical application of secure multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used.
604 citations
•
01 Jan 2009
TL;DR: Challenges in Code Optimization of Parallel Programs and how to CPS Transform a Monad are explored.
Abstract: Challenges in Code Optimization of Parallel Programs.- Extensible Proof-Producing Compilation.- From Specification to Optimisation: An Architecture for Optimisation of Java Bytecode.- A Framework for Exploring Optimization Properties.- Compile-Time Analysis and Specialization of Clocks in Concurrent Programs.- Implementation and Use of Transactional Memory with Dynamic Separation.- Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction.- Live Debugging of Distributed Systems.- Parsing C/C++ Code without Pre-processing.- Faster Scannerless GLR Parsing.- Decorated Attribute Grammars: Attribute Evaluation Meets Strategic Programming.- SSA Elimination after Register Allocation.- Register Spilling and Live-Range Splitting for SSA-Form Programs.- Loop-Aware Instruction Scheduling with Dynamic Contention Tracking for Tiled Dataflow Architectures.- Scheduling Tasks to Maximize Usage of Aggregate Variables in Place.- Dynamic Look Ahead Compilation: A Technique to Hide JIT Compilation Latencies in Multicore Environment.- Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes.- Blind Optimization for Exploiting Hardware Features.- How to CPS Transform a Monad.
3 citations
••
1 citations