About: EQP   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

Eager Queue Protocols were developed as a way of monitoring the state of distributed processors. What was wanted was an idea of how "live" the processors were. The first approach was to have each processor transmit a heartbeat and a record was kept of the heartbeats. The initial idea was to keep the record centrally, then it appeared better to have each processor keep its own copy of the heartbeat history. The heartbeat history or LKT (last known transmission) vector would be an array of processor Ids and the time when the processor last transmitted, see OpenEd-Lab4.

AttributesValues
rdfs:label
  • EQP
rdfs:comment
  • Eager Queue Protocols were developed as a way of monitoring the state of distributed processors. What was wanted was an idea of how "live" the processors were. The first approach was to have each processor transmit a heartbeat and a record was kept of the heartbeats. The initial idea was to keep the record centrally, then it appeared better to have each processor keep its own copy of the heartbeat history. The heartbeat history or LKT (last known transmission) vector would be an array of processor Ids and the time when the processor last transmitted, see OpenEd-Lab4.
dcterms:subject
abstract
  • Eager Queue Protocols were developed as a way of monitoring the state of distributed processors. What was wanted was an idea of how "live" the processors were. The first approach was to have each processor transmit a heartbeat and a record was kept of the heartbeats. The initial idea was to keep the record centrally, then it appeared better to have each processor keep its own copy of the heartbeat history. The heartbeat history or LKT (last known transmission) vector would be an array of processor Ids and the time when the processor last transmitted, see OpenEd-Lab4. The LKT vector could be simplified if the heartbeats across the network were regular. The least recent processor to transmit would be the next expected processor to transmit. If this is the case only a queue of processor Ids is required with the most recent transmitter at the front and the least recent transmitter at the back. When a processor transmits it moves its processor Id to the front of the queue (hence the name Eager Queue at the processor at the back pushes to the front). EQP Version 1 was explained in the report Two Ticks, a simulation of a simple Eager Queue Protocol (Cozens, 2008).
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software