Sciweavers

1534 search results - page 67 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
PPOPP
1999
ACM
14 years 3 days ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
DATE
2011
IEEE
235views Hardware» more  DATE 2011»
12 years 11 months ago
An Overview of Approaches Towards the Timing Analysability of Parallel Architecture
In order to meet performance/low energy/integration requirements, parallel architectures (multithreaded cores and multi-cores) are more and more considered in the design of embedd...
Christine Rochange
ISORC
2005
IEEE
14 years 1 months ago
On Real-Time Performance of Ahead-of-Time Compiled Java
One of the main challenges in getting acceptance for safe object-oriented languages in hard real-time systems is to combine automatic memory management with hard real-time constra...
Anders Nilsson, Sven Gestegard Robertz
ICPADS
2000
IEEE
14 years 5 days ago
Object-Oriented Real-Time Distributed Programming and Support Middleware
Abstract: The object-oriented (OO) distributed realtime (RT) programming movement started in 1990's and is growing rapidly at this turn of the century. The motivations are rev...
K. H. Kim
ICPP
1995
IEEE
13 years 11 months ago
Generalized Algorithm for Parallel Sorting on Product Networks
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Antonio Fernández, Nancy Eleser, Kemal Efe