Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
350
Guaranteeing synchronous message deadlines with the timed token protocol
- IEEE Transactions on Computers
, 1992
"... Abstract-We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed to-ken medium access control protocol is employed. Synchronous bandwidth, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the t ..."
Abstract
-
Cited by 119 (21 self)
- Add to MetaCart
Abstract-We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed to-ken medium access control protocol is employed. Synchronous bandwidth, defined as the maximum time for which a node can transmit its synchronous messages every time it receives
Guaranteeing Real-Time Message Deadlines in PROFIBUS Networks
- in Profibus Networks”, in proceedings of the 10 th Euromicro Workshop on Real-time Systems
, 1998
"... This paper provides a comprehensive study on how to use Profibus networks to support real-time communications, that is, ensuring the transmission of the real-time messages before their deadlines. Profibus is based on a simplified Timed Token (TT) protocol, which is a well-proved solution for real-ti ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
This paper provides a comprehensive study on how to use Profibus networks to support real-time communications, that is, ensuring the transmission of the real-time messages before their deadlines. Profibus is based on a simplified Timed Token (TT) protocol, which is a well-proved solution for real
Selection of Timed Token Protocol Parameters to Guarantee Message Deadlines
, 1994
"... Networks that use the timed token protocol (such as the 100 Mbit/s FDDI network) are well suited for real-time applications because they guarantee, to each node, an average bandwidth and a bounded access time to the communication network. This guarantee is necessary but not sufficient for the timely ..."
Abstract
-
Cited by 17 (5 self)
- Add to MetaCart
for the timely delivery of deadline-constrained messages; protocol parameters must be carefully selected to ensure that these messages meet their deadlines. This paper addresses the issue of selecting the protocol parameters TTRT (Target Token Rotation Time) and the synchronous capacities assigned to each node
Scheduling with Message Deadlines for Hard Real-Time SDL Systems
, 2002
"... new deadline now have to be inserted into a task's only queue in a deadline sorted order. Deadline inheritance (DIP), respectively deadline ceiling (DCP) applied to message queues raise the dynamic priority of the receiving task and assure the avoidance of priority inversion e#ects caused by se ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
new deadline now have to be inserted into a task's only queue in a deadline sorted order. Deadline inheritance (DIP), respectively deadline ceiling (DCP) applied to message queues raise the dynamic priority of the receiving task and assure the avoidance of priority inversion e#ects caused
Local Synchronous Capacity Allocation Schemes for Guaranteeing Message Deadlines with the Timed Token Protocol *
"... We study the problem of guaranteeing synchronous message deadlines in communication networks where the timed token medium access control protocol is em-ployed. Synchronous capacity, defined as ihe max-rmum time for which a node can transmit its syn-chronous messages every time it receives the token, ..."
Abstract
- Add to MetaCart
We study the problem of guaranteeing synchronous message deadlines in communication networks where the timed token medium access control protocol is em-ployed. Synchronous capacity, defined as ihe max-rmum time for which a node can transmit its syn-chronous messages every time it receives the token
Guaranteeing Synchronous Messages with Arbitrary Deadline Constraints in an FDDI Network
- In Proceedings of the IEEE Conference on Local Computer Networks
, 1993
"... This paper addresses issues related to guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully if message deadlines are to be satisfied. First, message deadlines can only be met if sufficient synchronous ..."
Abstract
-
Cited by 31 (7 self)
- Add to MetaCart
This paper addresses issues related to guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully if message deadlines are to be satisfied. First, message deadlines can only be met if sufficient synchronous
HOLISTIC SCHEDULABILITY ANALYSIS FOR DISTRIBUTED HARD REAL-TIME SYSTEMS
"... This report extends the current analysis associated with static priority pre-emptive based scheduling to address the wider problem of analysing schedulability of a distributed hard real-time system; in particular it derives analysis for a distributed system where tasks with arbitrary deadlines commu ..."
Abstract
-
Cited by 308 (7 self)
- Add to MetaCart
This report extends the current analysis associated with static priority pre-emptive based scheduling to address the wider problem of analysing schedulability of a distributed hard real-time system; in particular it derives analysis for a distributed system where tasks with arbitrary deadlines
Message
, 2001
"... RE: NEP goals Paula. Sent out earlier. No big deal on the deadline- would like to have your policy ideas by Monday (we have a WH deadline by Wednesday). 111 edit the goals using the input I got from you this a.m. Dont feel you have to dot every i- a solid paragraph for each program or policy idea wi ..."
Abstract
- Add to MetaCart
RE: NEP goals Paula. Sent out earlier. No big deal on the deadline- would like to have your policy ideas by Monday (we have a WH deadline by Wednesday). 111 edit the goals using the input I got from you this a.m. Dont feel you have to dot every i- a solid paragraph for each program or policy idea
Earliest Deadline Message Scheduling with Limited Priority Inversion
, 1996
"... This paper presents an innovative approach for scheduling network messages with real-time dynamic algorithms. The solution described in this work takes advantage of the increased network utilization allowed by dynamic scheduling methods and bounds at the same time the priority invertion phenomena ca ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
This paper presents an innovative approach for scheduling network messages with real-time dynamic algorithms. The solution described in this work takes advantage of the increased network utilization allowed by dynamic scheduling methods and bounds at the same time the priority invertion phenomena
Scheduling messages with deadlines in multi-hop real-time sensor networks
- In RTAS’05
, 2005
"... Consider a team of robots equipped with sensors that collaborate with one another to achieve a common goal. Sensors on robots produce periodic updates that must be transmitted to other robots and processed in real-time to enable such collaboration. Since the robots communicate with one another over ..."
Abstract
-
Cited by 35 (0 self)
- Add to MetaCart
an ad-hoc wireless network, we consider the problem of providing timeliness guarantees for multihop message transmissions in such a network. We derive the effective deadline and the latest start time for per-hop message transmissions from the validity intervals of the sensor data and the constraints
Results 1 - 10
of
350
