Computer system with adaptive memory arbitration scheme

作者: Gary J. Piccirillo , Kenneth T. Chin , Robert A. Lester , Phillip M. Jones , Jerome J. Johnson

DOI:

关键词:

摘要: A computer system includes an adaptive memory arbiter for prioritizing access requests, including a self-adjusting, programmable request-priority ranking system. The adapts during every arbitration cycle, reducing the priority of any request which wins arbitration. Thus, initially holding low may gradually advance in until that Such scheme prevents lower-priority devices from becoming “memory-starved.” Because some types requests (such as refresh and reads) inherently require faster than other writes), additionally integrates nonadjustable structure into guarantees service to most urgent requests. Also, introduces flexible method adjustable priority-weighting permits selected transact number consecutive accesses without those losing priority.

参考文章(21)
Gary J. Piccirillo, Kenneth T. Chin, Robert A. Lester, Phillip M. Jones, Michael J. Collins, Computer system with synchronous memory arbiter that permits asynchronous memory requests ,(1998)
Koichi Watanabe, Kazuo Sasama, Hironobu Machida, Circuit for controlling access to a common memory based on priority ,(1994)
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 aligning an initial cache line of data read from an input/output device by a central processing unit ,(1998)
Clarence Kevin Coffee, Gary J. Piccirillo, Kenneth T. Chin, Phillip M. Jones, Jerome J. Johnson, Michael J. Collins, Robert Allen Lester, System and method for improving processor read latency in a system employing error checking and correction ,(1998)