Sciweavers

1205 search results - page 114 / 241
» On P Systems with Bounded Parallelism
Sort
View
138
Voted
ECRTS
2009
IEEE
15 years 1 months ago
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
Abstract--Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic ...
Karthik Lakshmanan, Ragunathan Rajkumar, John P. L...
IEEEPACT
1998
IEEE
15 years 7 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari
ISPAN
1999
IEEE
15 years 7 months ago
Using Stochastic Intervals to Predict Application Behavior on Contended Resources
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...
Jennifer M. Schopf, Francine Berman
136
Voted
COMPGEOM
1993
ACM
15 years 7 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
133
Voted
ISORC
2000
IEEE
15 years 8 months ago
A Distributed Real-Time Java System Based on CSP
CSP is a fundamental concept for developing software for distributed real-time systems. The CSP paradigm constitutes a natural addition to Object Orientation and offers higherorde...
Gerald H. Hilderink, Andry W. P. Bakkers, Jan F. B...