Sciweavers

4539 search results - page 768 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 9 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
EUROPAR
2003
Springer
15 years 9 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
GPC
2010
Springer
15 years 9 months ago
SLA-Driven Automatic Bottleneck Detection and Resolution for Read Intensive Multi-tier Applications Hosted on a Cloud
Abstract. A Service-Level Agreement (SLA) provides surety for specific quality attributes to the consumers of services. However, the current SLAs offered by cloud providers do no...
Waheed Iqbal, Matthew N. Dailey, David Carrera, Pa...
EICS
2010
ACM
15 years 9 months ago
User interface plasticity: model driven engineering to the limit!
Ten years ago, I introduced the notion of user interface plasticity to denote the capacity of user interfaces to adapt, or to be adapted, to the context of use while preserving us...
Joëlle Coutaz
TAMC
2010
Springer
15 years 9 months ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret