会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • Apparatus for reordering the sequence of data stored in a serial memory
    • 用于重新记录存储在串行存储器中的数据的装置
    • US4052704A
    • 1977-10-04
    • US752752
    • 1976-12-20
    • Peter Anthony Franaszek
    • Peter Anthony Franaszek
    • G11C19/00G06F7/78G06F12/00G06F7/04
    • G06F7/78
    • This memory management system provides an improved search logic for locating pages of data stored parallel-by-bit, serially-by-page in a shift register memory and for moving those pages to a position at the head of the file. Searching alternates between forward and reverse with a first direction change occurring when the head of the file occupies an input/output station in the memory and a second change occurring when the last of a plurality of pages identified for search at the first reversal position is found.The page numbers of three sought data pages are entered into three search registers and compared with the page number of each page as it is shifted into the input/output station of the memory. A page number is replaced when the page is found. Page numbers are marked with a binary one upon each direction change at the first position and with a binary zero at each replacement of a page number at other than that position.The data loop includes four parking registers which may be selectively excluded from the loop so as to park the successive pages as they are found in the search. As a reverse feeding moves the head of the file proximate to the input/output station, the pages stored in the parking registers are inserted into the data stream at the head of the file.
    • 8. 发明授权
    • System and method for reducing memory fragmentation by assigning
remainders to share memory blocks on a best fit basis
    • 通过分配余数以最佳匹配的方式共享内存块来减少内存碎片的系统和方法
    • US5761536A
    • 1998-06-02
    • US701143
    • 1996-08-21
    • Peter Anthony Franaszek
    • Peter Anthony Franaszek
    • G06F12/02G06F7/00
    • G06F12/023G06F2212/401
    • A system and method for storing variable length objects such that memory fragmentation is reduced, while avoiding the need for memory reorganization. A remainder of a variable length object may be assigned to share a fixed-size block of storage with a remainder from another variable length object (two such remainders which share a block are referred to as roommates) on a best fit or first fit basis. One remainder is stored at one end of the block, while the other remainder is stored at the other end of the block. The variable length objects which are to share a block of storage are selected from the same cohort. Thus, there is some association between the objects. This association may be that the objects are from the same page or are in some linear order spanning multiple pages, as examples. Information regarding the variable length objects of a cohort, such as whether an object has a roommate, is stored in memory.
    • 用于存储可变长度对象的系统和方法,使得减少内存碎片,同时避免对存储器重组的需要。 可以分配可变长度对象的剩余部分以最佳拟合或第一拟合的基础来共享来自另一个可变长度对象(其中共享一个块的两个这样的剩余部分被称为室友)的固定大小的存储块。 一个余数存储在块的一端,而另一个余数存储在块的另一端。 从同一个群组中选择共享一个存储块的可变长度对象。 因此,对象之间存在一些关联。 该关联可能是对象来自相同的页面,或者是跨越多个页面的一些线性顺序,例如。 关于队列的可变长度对象(例如对象是否具有室友)的信息被存储在存储器中。