Abstract: Methods and apparatus relating to lightweight trusted tasks are disclosed. In one embodiment, a processor includes a memory interface to a memory to store code, data, and stack segments for a lightweight-trusted task (LTT) mode task and for another task, a LTT control and status register including a lock bit, a processor core to enable LTT-mode, configure the LTT-mode task, and lock down the configuration by writing the lock bit, and a memory protection circuit to: receive a memory access request from the memory interface, the memory access request being associated with the other task, determine whether the memory access request is attempting to access a protected memory region of the LTT-mode task, and protect against the memory access request accessing the protected memory region of the LTT-mode task, regardless of a privilege level of the other task, and regardless of whether the other task is also a LTT-mode task.

Abstract: Methods, apparatus, and system to create interrupts which are resolved at runtime relative to an active compartment. Active compartments may be, for example, a compartment of an operating system (“OS”) or a trusted execution environment (“TEE”). The context-specific interrupts comprise an interrupt dispatch table (“IDT”) for each compartment.

Abstract: Methods, apparatus, and system to create interrupts which are resolved at runtime relative to an active compartment. Active compartments may be, for example, a compartment of an operating system (“OS”) or a trusted execution environment (“TEE”). The context-specific interrupts comprise an interrupt dispatch table (“IDT”) for each compartment.

Abstract: Methods and apparatus relating to lightweight trusted tasks are disclosed. In one embodiment, a processor includes a memory interface to a memory to store code, data, and stack segments for a lightweight-trusted task (LTT) mode task and for another task, a LTT control and status register including a lock bit, a processor core to enable LTT-mode, configure the LTT-mode task, and lock down the configuration by writing the lock bit, and a memory protection circuit to: receive a memory access request from the memory interface, the memory access request being associated with the other task, determine whether the memory access request is attempting to access a protected memory region of the LTT-mode task, and protect against the memory access request accessing the protected memory region of the LTT-mode task, regardless of a privilege level of the other task, and regardless of whether the other task is also a LTT-mode task.

Abstract: Temporary states are used transitionally in run-time situations and are unknown to the object database. A temporary state is created if, when an object is performing a requested event, interim work needs to be performed before the object reaches a permanent destination state. Use of a temporary state is transparent to the caller of the requested event.

Abstract: Temporary states are used transitionally in run-time situations and are unknown to the object database. A temporary state is created if, when an object is performing a requested event, interim work needs to be performed before the object reaches a permanent destination state. Use of a temporary state is transparent to the caller of the requested event. Within a single flow of control, an unlimited number of nested locks may be acquired. A request to unlock an object will only truly unlock the object if the unlock requester is at the highest level of locking. For recursive or embedded functions, no knowledge of the previous locking condition is necessary. Attribute-based locking provides a mechanism for allowing only certain members of the system to lock an object for writing while the object is in a predetermined state. However, any thread may obtain a read lock on an object in order to examine its attributes.

Abstract: Temporary states are used transitionally in run-time situations and are unknown to the object database. A temporary state is created if, when an object is performing a requested event, interim work needs to be performed before the object reaches a permanent destination state. Use of a temporary state is transparent to the caller of the requested event.

Abstract: Temporary states are used transitionally in run-time situations and are unknown to the object database. A temporary state is created if, when an object is performing a requested event, interim work needs to be performed before the object reaches a permanent destination state. Use of a temporary state is transparent to the caller of the requested event. Within a single flow of control, an unlimited number of nested locks may be acquired. A request to unlock an object will only truly unlock the object if the unlock requester is at the highest level of locking. For recursive or embedded functions, no knowledge of the previous locking condition is necessary. Attribute-based locking provides a mechanism for allowing only certain members of the system to lock an object for writing while the object is in a predetermined state. However, any thread may obtain a read lock on an object in order to examine its attributes.

Abstract: A method of correcting errors in a digital VCR in which the error correcting capability is maximized and probabilities that no error is detected and data decoding fails are minimized, by using a relatively small length of redundancy. The method comprises the first step of detecting errors from vertical and horizontal sections of a code of data played back from a tape and setting cross-points of the detected errors to flags, the second step of detecting errors from the horizontal code sections of the played back data, correcting the detected errors and erasing only the errors positioned at the cross-points set to the flags at the first steep, in ones of the horizontal code sections from which detectable but non-correctable errors are detected, and the third step of correcting the errors erased at the second in a vertical direction.