Sciweavers

Share
14 search results - page 2 / 3
» Optimizing the Symbolic Execution of Communicating and Evolv...
Sort
View
CSUR
1999
114views more  CSUR 1999»
9 years 10 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
DSN
2005
IEEE
10 years 4 months ago
Fast Byzantine Consensus
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...
Jean-Philippe Martin, Lorenzo Alvisi
OOPSLA
2015
Springer
4 years 6 months ago
A formal foundation for trace-based JIT compilers
Trace-based JIT compilers identify frequently executed program paths at run-time and subsequently record, compile and optimize their execution. In order to improve the performance...
Maarten Vandercammen, Jens Nicolay, Stefan Marr, J...
IEEEPACT
2008
IEEE
10 years 4 months ago
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
Katherine E. Coons, Behnam Robatmili, Matthew E. T...
DAGSTUHL
2007
9 years 11 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
books