Sciweavers

3098 search results - page 25 / 620
» On distributed smooth scheduling
Sort
View
GROUP
2003
ACM
15 years 5 months ago
Using cursor prediction to smooth telepointer jitter
Telepointers are an important type of embodiment in real-time distributed groupware. Telepointers can increase the presence of remote participants and can provide considerable awa...
Carl Gutwin, Jeff Dyck, Jennifer Burkitt
IPPS
1997
IEEE
15 years 4 months ago
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancin...
96
Voted
FORMATS
2007
Springer
15 years 6 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
JPDC
2007
86views more  JPDC 2007»
14 years 11 months ago
Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
Tao Xie 0004, Xiao Qin
APPT
2003
Springer
15 years 5 months ago
Scheduling Outages in Distributed Environments
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
Anthony Butler, Hema Sharda, David Taniar