首页> 外国专利> System for resolving memory access conflicts among processors and minimizing processor waiting times for access to memory by comparing waiting times and breaking ties by an arbitrary priority ranking

System for resolving memory access conflicts among processors and minimizing processor waiting times for access to memory by comparing waiting times and breaking ties by an arbitrary priority ranking

机译:一种系统,用于通过比较等待时间和中断联系以任意优先级排序来解决处理器之间的内存访问冲突,并使处理器等待访问内存的时间最小化

摘要

A system for resolving conflicts among processors for access to a memory to which the processors are connected by a first bus includes a number of logic circuits, one for each processor. Each logic circuit receives a number of inputs to determine when access to the memory can be had for its processor. These inputs include a memory use request made by the processor, a memory availability signal communicated to all the logic circuits over a second bus, and the longest available processor waiting time, communicated to all the logic circuits over a third bus. Each logic circuit compares the longest processor waiting time with its own processor's waiting time, and will connect its processor to the memory when the following conditions coincide: a request for the memory by its processor, a memory availability signal, and one of the following: a longer waiting time for its processor than for any other processor or its processor's waiting time being equal to the longest other waiting time and its processor having a higher rank, different ranks being arbitrarily assigned to the processors to break ties. This system minimizes maximum processor waiting time because no processor can reach the memory twice before another that has in the meantime requested it reaches it once.
机译:一种用于解决处理器之间的冲突以访问通过第一总线与处理器连接的存储器的系统,该系统包括多个逻辑电路,每个逻辑电路一个。每个逻辑电路接收许多输入,以确定何时可以对其处理器访问存储器。这些输入包括处理器发出的存储器使用请求,通过第二总线传送到所有逻辑电路的存储器可用性信号,以及通过第三总线传送到所有逻辑电路的最长可用处理器等待时间。每个逻辑电路都会将最长的处理器等待时间与自己的处理器的等待时间进行比较,并在以下条件一致时将其处理器连接到内存:处理器对内存的请求,内存可用性信号以及以下条件之一:与其他任何处理器相比,其处理器的等待时间更长,或者其处理器的等待时间等于最长的其他等待时间,并且其处理器具有更高的等级,可以任意分配不同的等级给处理器以打破平局。该系统最大程度地减少了处理器的最大等待时间,因为没有一个处理器两次可以到达另一个内存,而另一个同时请求它到达一次。

著录项

  • 公开/公告号US4096571A

    专利类型

  • 公开/公告日1978-06-20

    原文格式PDF

  • 申请/专利权人 CODEX CORPORATION;

    申请/专利号US19760721375

  • 发明设计人 JAMES E. VANDER MEY;

    申请日1976-09-08

  • 分类号G06F13/00;

  • 国家 US

  • 入库时间 2022-08-22 21:28:45

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号