6105 search results - page 752 / 1221 » A Parallel Algorithm for Bound-Smoothing |
193
click to vote
IPPS
1999
IEEE
15 years 12 months ago
1999
IEEE
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
189
click to vote
IPPS
1999
IEEE
15 years 12 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
205
click to vote
IPPS
1999
IEEE
15 years 12 months ago
1999
IEEE
Abstract. We have investigated the adaptation of AI-based search techniques as topologyindependent fault-tolerant routing strategies on multiprocessor networks [9]. The results sho...
206
click to vote
IPPS
1999
IEEE
15 years 12 months ago
1999
IEEE
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
196
click to vote
ICDCS
1998
IEEE
15 years 12 months ago
1998
IEEE
Novel real-time applications require highperformance real-time distributed systems, and therefore high-performance real-time networks. We examine a Hard Real-Time Distributed Mult...