会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Protection of data in an information multiprocessing system by
implementing a concept of rings to represent the different levels of
privileges among processes
    • 通过实施环的概念来表示流程中不同级别的权限,保护信息多处理系统中的数据
    • US4177510A
    • 1979-12-04
    • US528953
    • 1974-12-02
    • Marc AppellGeorges LepicardPhilippe-Hubert de RivetJohn J. BradleyBenjamin S. Franklin
    • Marc AppellGeorges LepicardPhilippe-Hubert de RivetJohn J. BradleyBenjamin S. Franklin
    • G06F12/14G06F13/00G06F9/18G06F9/20
    • G06F12/1491
    • Computer data and procedure protection by preventing processes from intering with each other or sharing each other's address space in an unauthorized manner is accomplished in hardware/firmware by restricting addressability to a segmented memory and by a ring protection mechanism.To protect information in segments shared by several processes from misuse by one of these processes a ring protection hardware system is utilized. There are four ring classes numbered 0 through 3. Each ring represents a level of system privilege with level 0 (the innermost ring) having the most privilege and level 3 (the outermost ring) the least. Every procedure in the system has a minimum and a maximum execute ring number assigned to it which specifies who may legally call the procedure. Also maximum write and read ring numbers specify the maximum ring numbers for which a write and/or read operation is permitted.Processes use a segmented address during execution wherein segment tables isolate the address space of the various processes in the system. Hardware checks that the address used by a process is part of the address space assigned to the process, and if the address is outside the prescribed address space, an exception occurs. A process cannot refer to data within the address space of another process because the hardware uses the segment table of the referencing process.
    • 通过防止过程彼此干扰或以未经授权的方式共享彼此的地址空间的计算机数据和过程保护通过将可寻址性限制到分段存储器和环保护机制来实现在硬件/固件中。 为了保护由多个进程共享的分段中的信息不被这些进程之一的误用,环网保护硬件系统被利用。 有四个戒指级别为0到3.每个戒指表示具有最高权限级别0(最内圈)和级别3(最外层)的系统权限级别。 系统中的每个过程都具有分配给它的最小和最大执行环号,其中指定谁可以合法地调用该过程。 最大写入和读取振铃编号也指定允许写入和/或读取操作的最大振铃数。 进程在执行期间使用分段地址,其中分段表隔离系统中各种进程的地址空间。 硬件检查进程使用的地址是分配给进程的地址空间的一部分,如果地址在规定的地址空间之外,则会发生异常。 进程不能引用另一进程的地址空间内的数据,因为硬件使用引用过程的段表。
    • 5. 发明授权
    • Call and stack mechanism for procedures executing in different rings
    • 用于在不同环中执行的过程的调用和堆栈机制
    • US4297743A
    • 1981-10-27
    • US744814
    • 1976-11-24
    • Marc AppellJean-Louis BogaertClaude MassuardJohn BradleyBenjamin S. Franklin
    • Marc AppellJean-Louis BogaertClaude MassuardJohn BradleyBenjamin S. Franklin
    • G06F9/46G06F9/42G06F9/44G06F9/48
    • G06F9/4426
    • A procedure call mechanism implemented by hardware instructions and a hardware recognizable mechanism known as a stack. A procedure call is utilized by users who have written their programs in a modular way to pass from one program module to another, it is used by user programs to avail themselves of operating system services, and it is used by the operating system itself to achieve a responsive modular structure. The stack is a mechanism permitting the above to be done. A stack is a segment of memory and comprises a number of contiguous portions, known as stack-frames, which are accessed in last in, first out LIFO fashion. Each procedure call creates a stack frame, with subsequent procedure calls creating new stack frames; each exit deletes stack frames thus "popping up" a previous stack-frame. Thus a history of calls is correctly maintained in order to allow a return.
    • 由硬件指令和称为堆栈的硬件可识别机制实现的过程调用机制。 以程序模块化方式将用户程序从一个程序模块传递到另一个程序模块的用户使用过程调用,由用户程序用于使用操作系统服务,并由操作系统自身使用 响应模块化结构。 堆栈是允许上述操作的机制。 堆栈是存储器的一部分,并且包括被称为堆栈帧的多个连续部分,其以最后的LIFO方式被访问。 每个过程调用创建一个堆栈帧,随后的过程调用创建新的堆栈帧; 每个出口删除堆栈帧,从而“弹出”先前的堆栈帧。 因此,正确维护呼叫历史以允许返回。
    • 7. 发明授权
    • Apparatus and method for transferring information units between
processes in a multiprocessing system
    • 用于在多处理系统中的处理之间传送信息单元的装置和方法
    • US4394725A
    • 1983-07-19
    • US966371
    • 1978-12-04
    • Jacques BienvenuPatrick DufondClaude CarreDuc L. TuongHenri VerdierPhilippe-Hubert deRivetJohn J. BradleyBenjamin S. Franklin
    • Jacques BienvenuPatrick DufondClaude CarreDuc L. TuongHenri VerdierPhilippe-Hubert deRivetJohn J. BradleyBenjamin S. Franklin
    • G06F9/46G06F9/00
    • G06F9/52
    • A method of and apparatus for executing a family of instructions provides synchronization of processes in a multiprocessing system. Representations of processes awaiting data (information units) such as the completion of an asynchronous operation or the availability of a resource are stored in a memory in a first queue and representations of information units available to processes are stored in memory in a second queue. Transfer of information units between processes is controlled by data elements known as "semaphores" stored in the memory. Each semaphore contains a field having a numerical value identifying which of the two different kinds of queues is present. When a P instruction is executed by a process indicating that the process requires data in order to continue operating or a V instruction is executed indicating that an information unit is available for transfer to another process, a semaphore is addresses and its field tested to determine whether processes or information units are available to enable the information transfer between processes to be effected. Once the information transfer is completed, the field of the addressed semaphore is up-dated.
    • 用于执行指令族的方法和装置提供多处理系统中的进程的同步。 等待数据(信息单元)的处理(诸如异步操作的完成或资源的可用性)的表示被存储在第一队列中的存储器中,并且可用于处理的信息单元的表示被存储在第二队列中的存储器中。 在进程之间传送信息单元由存储在存储器中的被称为“信号量”的数据元素控制。 每个信号量包含具有数值的字段,其识别两种不同类型的队列中存在哪一种。 当通过指示该过程需要数据以继续操作的指令执行P指令或执行表示信息单元可用于传送到另一进程的V指令时,信号量是地址,并且其字段被测试以确定是否 流程或信息单元可用于实现进程之间的信息传递。 一旦信息传递完成,寻址的信号量的字段就被更新。
    • 8. 发明授权
    • Apparatus and method for providing synchronization between processes and
events occurring at different times in a data processing system
    • 用于在数据处理系统中在不同时间发生的进程和事件之间提供同步的装置和方法
    • US4369494A
    • 1983-01-18
    • US959096
    • 1978-11-09
    • Jacques BienvenuClaude CarrePatrick DufondDuc L. TuongPhilippe-Hubert deRivetHenri VerdierJohn J. BradleyBenjamin S. Franklin
    • Jacques BienvenuClaude CarrePatrick DufondDuc L. TuongPhilippe-Hubert deRivetHenri VerdierJohn J. BradleyBenjamin S. Franklin
    • G06F9/46G06F9/00
    • G06F9/52
    • An information structure, or semaphore, serves as a signalling mechanism in process synchronization to connect a process and a non-simultaneously occurring event or resource. The semaphore is a data structure which stores representations of processes awaiting particular events or alternatively stores representations of events awaiting processes. Semaphore data structures are developed in two storage areas. First and second groups of process links are stored in the first storage area to establish, respectively, a first queue of processes ready to operate and a second queue, associated with the semaphore structure, of processes awaiting occurrences of a first particular event prior to being ready to operate. In the second storage area are stored first and second groups of message links to establish respectively a first queue, associated with a semaphore structure, representing second particular events and a second queue of unused links. A signal is generated in response to operation of a first process to denote the occurrence of a first event. In response to the signal, the first event is associated with a process represented by a process link in the second queue of process links when the first event is the first particular event. When no queue has a process link identifying a process awaiting the occurrence of the first event, a representation of the first event occurrence is stored in a message link of the second queue of message links to be transferred to the first queue of message links. Process and event occurrence representations are thus transferred among the process and event queues during synchronization that takes place between the processes and events.
    • 信息结构或信号量用作过程同步中的信号机制,以连接过程和非同时发生的事件或资源。 信号量是存储等待特定事件的进程的表示的数据结构,或者存储等待进程的事件的表示。 信号量数据结构在两个存储区域中开发。 第一和第二组进程链接被存储在第一存储区域中,以分别建立与准备操作的进程的第一队列和与信号量结构相关联的第二队列等待在第一特定事件发生之前的进程 准备操作。 在第二存储区域中存储第一和第二组消息链路,以分别建立与表示第二特定事件的信号量结构相关联的第一队列和未使用链路的第二队列。 响应于第一处理的操作来生成信号以表示第一事件的发生。 响应于该信号,当第一事件是第一特定事件时,第一事件与由进程链接的第二队列中的进程链接表示的进程相关联。 当没有队列具有标识处理等待第一事件发生的进程链接时,第一事件发生的表示被存储在消息链路的第二队列的消息链路中,以被传送到消息链路的第一队列。 因此,进程和事件发生表示因此在进程和事件之间发生的同步期间在进程和事件队列之间传送。
    • 9. 发明授权
    • Apparatus and method for semaphore initialization in a multiprocessing
computer system for process synchronization
    • 用于进程同步的多处理计算机系统中信号量初始化的装置和方法
    • US4316245A
    • 1982-02-16
    • US967515
    • 1978-12-07
    • Duc LuuPhilippe-Hubert deRivetJohn J. BradleyBenjamin S. Franklin
    • Duc LuuPhilippe-Hubert deRivetJohn J. BradleyBenjamin S. Franklin
    • G06F9/46
    • G06F9/52
    • Apparatus in a data processing system to initialize a semaphore held in a memory field of the data processing system or, alternatively, to restore the semaphore to a previous predetermined state. A count field, or tally field, provided in the semaphore is initialized by a particular instruction. The semaphore can be either a non-message semaphore or a message semaphore. The instruction initializes the semaphore count field of a non message semaphore to zero or a preloaded positive value. For a message semaphore, this instruction initializes the count field to zero. If the message semaphore previously had a positive count, the messages tied to the semaphore are released and the message links holding the messages are transferred to a free message link queue tied to the free link semaphore in the same semaphore descriptor segment. The apparatus includes a retrieving member for reading the content of the semaphore in the memory of the data processing system, a testing member for testing the count field of the semaphore for generating a first signal when the count field represents the number of processes in queue and a second signal when the count field represents the number of times a particular kind of event has occurred, a changing unit responsive to the second signal and controlled by the particular instruction for changing the number inside the count field to a predetermined number and a control member responsive to the first signal and controlled by the particular instruction for controlling the data processing system to cease execution of the particular instruction and to begin to execute a different instruction.
    • 数据处理系统中的装置,用于初始化保持在数据处理系统的存储器字段中的信号量,或者备选地,将信号量恢复到先前的预定状态。 在信号量中提供的计数字段或计数字段由特定指令初始化。 信号量可以是非消息信号量或消息信号量。 该指令将非消息信号量的信号量计数字段初始化为零或预加载的正值。 对于消息信号量,该指令将计数字段初始化为零。 如果消息信号量先前具有正数,则释放与信号量相关联的消息,并且将保留消息的消息链接传递到与同一信号量描述符段中的自由链接信号量相连的空闲消息链接队列。 该装置包括用于读取数据处理系统的存储器中的信号量的内容的检索构件,测试构件,用于当计数字段表示队列中的进程数时,测试信号量的计数字段以产生第一信号; 当计数字段表示特定类型的事件发生的次数时的第二信号;响应于第二信号并由用于将计数字段内的数目改变为预定数量的特定指令控制的改变单元,以及控制部件 响应于第一信号并由用于控制数据处理系统的特定指令控制以停止特定指令的执行并开始执行不同的指令。