Sciweavers

4679 search results - page 609 / 936
» The Timely Computing Base Model and Architecture
Sort
View
ICSOC
2007
Springer
16 years 25 days ago
Let It Flow: Building Mashups with Data Processing Pipelines
Mashups are a new kind of interactive Web application, built out of the composition of two or more existing Web service APIs and data sources. Whereas “pure” mashups are built ...
Biörn Biörnstad, Cesare Pautasso
WMPI
2004
ACM
16 years 3 days ago
Understanding the effects of wrong-path memory references on processor performance
High-performance out-of-order processors spend a significant portion of their execution time on the incorrect program path even though they employ aggressive branch prediction al...
Onur Mutlu, Hyesoon Kim, David N. Armstrong, Yale ...
DAC
1998
ACM
16 years 7 months ago
A Case Study in Embedded System Design: An Engine Control Unit
A number of techniques and software tools for embedded system design have been recently proposed. However, the current practice in the designer community is heavily based on manua...
Alberto L. Sangiovanni-Vincentelli, Antonino Damia...
ICSE
2008
IEEE-ACM
16 years 6 months ago
VieDAME - flexible and robust BPEL processes through monitoring and adaptation
VieDAME is a tool for monitoring and dynamic service adaptation of BPEL processes. The tool monitors partner service interaction to compute Quality of Service (QoS) data and perfo...
Oliver Moser, Florian Rosenberg, Schahram Dustdar
ICALP
2007
Springer
16 years 25 days ago
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...