Sciweavers

6897 search results - page 1098 / 1380
» Parallelization of Modular Algorithms
Sort
View
ISORC
2002
IEEE
15 years 11 months ago
Handling Aperiodic Tasks in Diverse Real-Time Systems via Plug-Ins
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...
Tomas Lennvall, Gerhard Fohler, Björn Lindber...
HPDC
2000
IEEE
15 years 11 months ago
QoS and Contention-Aware Multi-Resource Reservation
To provide Quality of Service (QoS) guarantee in distributed services, it is necessary to reserve multiple computing and communication resources for each service session. Meanwhile...
Dongyan Xu, Klara Nahrstedt, Arun Viswanathan, Dua...
SPAA
1999
ACM
15 years 10 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
SPAA
1997
ACM
15 years 10 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
ICS
2010
Tsinghua U.
15 years 10 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
« Prev « First page 1098 / 1380 Last » Next »