Sciweavers

8780 search results - page 199 / 1756
» On the Feasibility of Consistent Computations
Sort
View
IPPS
2006
IEEE
16 years 1 months ago
Fault tolerance with real-time Java
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...
Damien Masson, Serge Midonnet
RTCSA
2006
IEEE
16 years 1 months ago
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time...
Nathan Fisher, Theodore P. Baker, Sanjoy K. Baruah
ICAC
2005
IEEE
16 years 25 days ago
Autonomicity of NASA Missions
NASA increasingly relies on autonomous systems concepts, not only in the mission control centers on the ground, but also on spacecraft, on rovers and other assets on extraterrestr...
Christopher Rouff, Michael G. Hinchey, James L. Ra...
IPTPS
2005
Springer
16 years 21 days ago
Quickly Routing Searches Without Having to Move Content
A great deal of work has been done to improve peerto-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer arc...
Brian F. Cooper
IPPS
2003
IEEE
16 years 14 days ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner