会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Page coloring to associate memory pages with programs
    • 页面着色以将内存页与程序相关联
    • US09390031B2
    • 2016-07-12
    • US11323446
    • 2005-12-30
    • David M. DurhamRavi L. SahitaDylan C. LarsonRajendra S. Yavatkar
    • David M. DurhamRavi L. SahitaDylan C. LarsonRajendra S. Yavatkar
    • G06F12/14G06F21/74G06F21/79
    • G06F12/1475G06F12/1491G06F21/74G06F21/79
    • Apparatuses and methods for page coloring to associate memory pages with programs are disclosed. In one embodiment, an apparatus includes a paging unit and an interface to access a memory. The paging unit includes translation logic and comparison logic. The translation logic is to translate a first address to a second address. The first address is to be provided by an instruction stored in a first page in the memory. The translation is based on an entry in a data structure, and the entry is to include a base address of a second page in the memory including the second address. The comparison logic is to compare the color of the first page to the color of the second page. The color of the first page is to indicate association of the first page with a first program including the first instruction. The data structure entry is also to include the color of the second page to indicate association of the second page with the first program or a second program.
    • 公开了用于将内存页与程序相关联的页着色的装置和方法。 在一个实施例中,一种装置包括寻呼单元和用于访问存储器的接口。 寻呼单元包括翻译逻辑和比较逻辑。 翻译逻辑是将第一个地址转换为第二个地址。 第一个地址由存储在第一页的指令提供。 翻译是基于数据结构中的条目,并且该条目是在包括第二地址的存储器中包括第二页的基地址。 比较逻辑是将第一页的颜色与第二页的颜色进行比较。 第一页的颜色是指示第一页与包括第一指令的第一程序的关联。 数据结构条目还包括第二页的颜色以指示第二页与第一程序或第二程序的关联。
    • 5. 发明授权
    • Method and computer program product for scheduling network communication packets originating from different flows having unique service requirements
    • 用于调度源自具有独特服务要求的不同流的网络通信分组的方法和计算机程序产品
    • US06247061B1
    • 2001-06-12
    • US09094045
    • 1998-06-09
    • John R. DouceurYoram BernetOfer BarCarol Ann BellTsung-Yuan Charles TaiRajendra S. Yavatkar
    • John R. DouceurYoram BernetOfer BarCarol Ann BellTsung-Yuan Charles TaiRajendra S. Yavatkar
    • G06F1516
    • H04L47/32H04L47/10H04L47/21H04L47/215H04L47/22H04L47/2433H04L47/2441H04L47/28H04L47/50H04L47/564H04L47/60H04L47/621H04L47/627
    • A method and computer program product for scheduling network communication packets in a multimedia environment where different packet streams have reservations of network bandwidth to form packet flows. The present invention divides the packet scheduling function into distinct components that may be implemented as separate drivers in a layered driver environment as exists, for example, in the Microsoft Windows NT operating system. One component is called a conformer and will generate and assign to each packet in the packet flow at least one conformance time that signifies the earliest a packet may be sent and still conform to the network resource requirements associated with the flow. Many different conformance algorithms can be supported so that the best algorithm is used for a particular packet flow and the service requirements that it represents. Should it be necessary to actually hold a packet until the conformance time is met, a shaper component is used to delay the packets. Finally, a sequencer component will send packets out as fast as possible over the network interface card. Each flow of packets processed by the sequencer component has at least two priorities, one for when the packets are conforming and one for when the packets are non-conforming. The sequencer component maintains priority lists of packet flow queues and will service the highest priority queue list followed by each successive priority list until no packets remain for transmission or the network interface card is unable to handle more packets. Each priority list will have a queue discipline associated therewith that will determine in what order the packets are taken off of the respective flow queues.
    • 一种用于在多媒体环境中调度网络通信分组的方法和计算机程序产品,其中不同分组流具有网络带宽的预留以形成分组流。 本发明将分组调度功能划分为不同的组件,其可以被实现为分层驱动程序环境中的独立驱动程序,例如在Microsoft Windows NT操作系统中。 一个组件被称为构图器,并且将生成并分配给分组流中的每个分组至少一个一致的时间,其表示分组可以被发送的最早的一致性,并且仍然符合与流相关联的网络资源需求。 可以支持许多不同的一致性算法,以便将最佳算法用于特定数据包流及其所代表的服务要求。 如果需要在一致性时间之前实际保存数据包,则会使用整形器来延迟数据包。 最后,定序器组件将通过网络接口卡尽快发送数据包。 由定序器组件处理的每个流的流具有至少两个优先级,一个用于当数据包一致时,一个用于当数据包不符合时。 定序器组件保持分组流队列的优先级列表,并且将服务于优先级最高的队列列表,随后是每个连续的优先级列表,直到没有分组保留用于传输或网络接口卡不能处理更多分组。 每个优先级列表将具有与其相关联的队列规则,其将以什么顺序确定分组从相应的流队列中取走。