1137 search results - page 40 / 228 » A study of slipstream processors |
OPODIS
2008
13 years 9 months ago
2008
The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented a...
IJHPCA
2006
13 years 7 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
JPDC
2007
13 years 7 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
FSE
2011
Springer
12 years 11 months ago
2011
Springer
We study the software performance of authenticated-encryption modes CCM, GCM, and OCB. Across a variety of platforms, we find OCB to be substantially faster than either alternati...
IWMM
2010
Springer
13 years 11 months ago
2010
Springer
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...