Sciweavers

3927 search results - page 107 / 786
» Dynamic Dependencies and Performance Improvement
Sort
View
PEPM
2007
ACM
16 years 17 days ago
Lowering: a static optimization technique for transparent functional reactivity
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
Kimberley Burchett, Gregory H. Cooper, Shriram Kri...
SC
2003
ACM
15 years 11 months ago
A Compiler Analysis of Interprocedural Data Communication
This paper presents a compiler analysis for data communication for the purpose of transforming ordinary programs into ones that run on distributed systems. Such transformations ha...
Yonghua Ding, Zhiyuan Li
POPL
1994
ACM
15 years 10 months ago
Reducing Indirect Function call Overhead in C++ Programs
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and p...
Brad Calder, Dirk Grunwald
TCOM
2010
112views more  TCOM 2010»
15 years 4 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
CODES
2007
IEEE
16 years 24 days ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...