Sciweavers

1534 search results - page 18 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Towards Quantitative Analysis of Real-Time UML Using Stochastic Petri Nets
In recent years the Unified Modeling Language (UML) including its profiles gained increasing acceptance as a specification language for modeling real-time systems. It is crucia...
Jan Trowitzsch, Armin Zimmermann, Günter Homm...
ISORC
2008
IEEE
14 years 2 months ago
Toward Libraries for Real-Time Java
Reusable libraries are problematic for real-time software in Java. Using Java’s standard class library, for example, demands meticulous coding and testing to avoid response time...
Trevor Harmon, Martin Schoeberl, Raimund Kirner, R...
SAC
2002
ACM
13 years 7 months ago
Automatic code generation for executing tiled nested loops onto parallel architectures
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...
Georgios I. Goumas, Maria Athanasaki, Nectarios Ko...
EUROPAR
1998
Springer
13 years 12 months ago
A Lower Bound for Dynamic Scheduling of Data Parallel Programs
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
Fabrício Alves Barbosa da Silva, Luis Migue...
IPPS
2002
IEEE
14 years 17 days ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
Minsoo Jeon, Dongseung Kim