Sciweavers

4679 search results - page 308 / 936
» The Timely Computing Base Model and Architecture
Sort
View
ISTA
2008
15 years 8 months ago
Towards a Theory of Services
Abstract. Service-oriented Computing and Service-oriented Architectures aspire to better exploit existing middleware technologies. To this end, a more flexible, platform independen...
Wolfgang Reisig
SIPEW
2009
Springer
110views Hardware» more  SIPEW 2009»
16 years 1 months ago
A Note on the Effects of Service Time Distribution in the M/G/1 Queue
The M/G/1 queue is a classical model used to represent a large number of real-life computer and networking applications. In this note, we show that, for coefficients of variation o...
Alexandre Brandwajn, Thomas Begin
IWSEC
2007
Springer
16 years 25 days ago
Run-Time Randomization to Mitigate Tampering
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
Bertrand Anckaert, Mariusz H. Jakubowski, Ramarath...
SC
2000
ACM
15 years 11 months ago
Performance of Hybrid Message-Passing and Shared-Memory Parallelism for Discrete Element Modeling
The current trend in HPC hardware is towards clusters of shared-memory (SMP) compute nodes. For applications developers the major question is how best to program these SMP cluster...
D. S. Henty
MST
1998
76views more  MST 1998»
15 years 6 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith