Timeslot arbitration scheme

作者: Richard Thomas Plunkett

DOI:

关键词: Pointer (computer programming)Computer networkLatency (engineering)ArbitrationComputer scienceReal-time computing

摘要: A method for arbitrating between a plurality of access requests issued in relation to resource by requestors, wherein each request can be one at least two types, first the types having higher latency associated with its performance than some other including steps of: (a) receiving requests; (the are not placed anywhere, they simply received); (b) maintaining current pointer that points timeslot list, and lookahead future list; (c) event an as arbitrated via is type, initiating earlier position list suggests it would performed should started when reached timeslot.

参考文章(45)
Masatoshi Takeshita, Yusuke Yajima, Toshio Kobayashi, Masakazu Ichikawa, Scanning interference electron microscopy ,(1991)
Peter M. Livingston, High energy laser focal sensor (HELFS) ,(1997)
Clarence K. Coffee, Gary J. Piccirillo, Kenneth T. Chin, Robert A. Lester, Phillip M. Jones, Jerome J. Johnson, Michael J. Collins, System and method for concurrently requesting input/output and memory address space while maintaining order of data sent and returned therefrom ,(1998)
Simon Robert Walmsley, Paul Lapstun, Kia Silverbrook, Tobin Allen King, A duplex network color printer ,(2000)
Douglas W. Couwenhoven, Lam J. Ewell, Xin Wen, Method of compensating for malperforming nozzles in a multitone inkjet printer ,(1998)