Abstract: A system and method for providing an overview of a plurality of tasks running on a target environment which includes the steps of receiving event data representing a plurality of events in the plurality of contexts over a monitoring period displaying a detailed graphical representation of the event data log using the event data, and displaying a schematic representation of the detailed graphical representation over the monitoring period using only a portion of the event data. The schematic representation is indicative of an activity density of the event data over the monitoring period.

Abstract: A protection domain system is implemented to provide protection for applications executing in a computing environment. Protection domains are allocated system resources and may contain executing tasks. The protection domain system may allow tasks to access resources in other protection domains to which attachments have been made. Attachment is transparent to the software developer. The protection domain system provides flexibility in implementing operating system services and defining protection hierarchies.

Abstract: Described is a method and system for optimizing a code layout for execution on a processor including internal and/or external cache memory. The method and system includes executing a program having a first layout, generating at least one memory access parameter for the program, the memory access parameter being based on a cache memory of a computing system on which the program is designed to run and constructing a second layout for the program as a function of the at least one memory access parameter.

Abstract: A system and method for executing application code in an operating system environment, attaching a development tool to the application code, saving a state of the application code, determining whether the attachment of the development tool interrupted a blocking system call of the application code, modifying, when it is determined the attachment of the development tool interrupted the blocking system call, the saved state to a further saved state corresponding to restarting the blocking system call and restoring the state of the application code to the further saved state.

Abstract: A system and method for writing, by a sender, a message into blocks of a memory space, the memory space being shared by the sender of the message and a receiver of the message, and sending, by the sender, an interrupt corresponding to the message.

Abstract: A computer implemented method of computer implemented method for installing a code object in a user process virtual memory space, while the user process is running is provided. The user process is run in a virtual memory space. A controller process is run in a different virtual memory space than the user process. The control process requests to a kernel module to install the code object into the virtual memory space of the user process. The kernel module installs the code object into the virtual memory space of the user process, while the user process is running.

Abstract: A system and method for receiving an origin file corresponding to source code, modifying the source code to create a modified source code, creating a modified file corresponding to the modified source code and comparing the modified file to the origin file. A system having an editor for editing source code to create a modified source code and a patch aware editor storing an origin file corresponding to the source code and creating a modified file corresponding to the modified source code, the patch aware editor comparing the origin file to the modified file and displaying conflicts between the files.

Abstract: An operating system, comprising a first component including a first protocol stack configured to process data packets of a first type, wherein the first component is initialized independently of other components in the operating system, a second component including a second protocol stack configured to process data packets of a second type, wherein the second component is initialized independently of the other components in the operating system, and a third component configured to receive data packets of the first type and the second type and direct the data packets of the first type to the first component and the data packets of the second type to the second component.

Abstract: A method for extracting context information from an extraction module to create a minimized extraction module, creating a parameter profile from the context information, transmitting the minimized extraction module to a target device, receiving a value extracted from the target device by the minimized extraction module, and combining the value with at least a portion of the context information to create a user readable log statement. A system having an extraction element extracting context information from an extraction module to create a minimized extraction module, a creating element creating a parameter profile from the context information, a transmitting element transmitting the minimized extraction module to a target device, a receiving element receiving a value extracted from the target device by the minimized extraction module, and a combining element combining the value with at least a portion of the context information to create a user readable log statement.

Abstract: Described is a system to control a flow of packets to and from an electronic processor which includes a packet processor engine programmed to interpret the packets from a packet memory, and to perform switching between packet chains in response to events, a working chain pointer register of the packet processor engine, programmed to indicate progress in executing an active buffer chain, prioritized pointer storage registers of the packet processor engine, each of the registers being programmed to point to one of the active buffer chains, a control register of the packet processor engine having chain start bits and chain protect bits, the chain start bits identifying the chains that have been started and wsa status register of the packet processor engine, having a chain actives group identifying the chain that is currently running, a chain matches group, a chain stops group identifying the chains that have been stopped and a timer expirations group.

Abstract: A computer implemented method or computer readable code for determining function call history for a system, which runs both code with a frame pointer and a stack pointer and code with a stack pointer and without a frame pointer. Execution is frozen on at least one CPU. A function of plurality of functions that were executing on the at least one CPU is stepped through, where some of the plurality of functions have a frame pointer and a stack pointer and some of the plurality of functions have a stack pointer but do not have a frame pointer. The stack offset to the stack memory location, where the return address in parent function is stored, is calculated to find the return address in parent function, which called the function being stepped through.

Abstract: Described is a system and method for determining routing information for a network link, the network link including a plurality of subnets, each subnet having the same routing information as the network link, storing the routing information as an entry in a routing table, determining subnet information for each of the plurality of subnets and storing the subnet information for each of the plurality of subnets in the entry. Methods of comparing and searching the subnet information are also described.

Abstract: A device having an operating system including a power control policy for a component of the device and an effector program controlling power for the component based on the power control policy and power control hardware controlled by the effector program to implement the power control policy for the component. A method for determining a power state for a component, executing an effector program to produce a control output corresponding to the power state and controlling power supplied to the component so that the component enters the power state.

Abstract: A system and method for writing, by a sender, a message into blocks of a memory space, the memory space being shared by the sender of the message and a receiver of the message, and sending, by the sender, an interrupt corresponding to the message.

Abstract: The present invention provides systems and methods for dynamically linking modules into a running operating system kernel. Systems and methods described herein have the following advantages: (1) they permit an application programmer to write, compile, execute, and terminate application code that is to be loaded into a kernel as if the application code was an ordinary application program, (2) they allow a standard programming environment to be used to encapsulate application software in a familiar environment, and (3) they permit automatic cleanup of errors and freeing of program resources when the application terminates.

Abstract: A method and system is provided for emulating individual JTAG devices in a multiple device boundary scan chain. The method includes coupling an emulator to the scan chain, and obtaining the topology of the scan chain. One device within the scan chain is then selected, and at least one other device within the scan chain is placed into bypass mode. Emulation instructions are sent to the scan chain, so that the emulation instructions bypass the at least one other device and are executed by the one device.

Abstract: A system for managing a plurality of client processes, comprising a client task within which the client processes will be executed and a manager task running at a higher priority than the client task, the manager task queuing the client processes into the client task in priority order, wherein the manager task kills the client task when a current one of the client processes is not completed within a predetermined time period.

Abstract: A computer implemented method of computer implemented method for installing a code object in a user process virtual memory space, while the user process is running is provided. The user process is run in a virtual memory space. A controller process is run in a different virtual memory space than the user process. The control process requests to a kernel module to install the code object into the virtual memory space of the user process. The kernel module installs the code object into the virtual memory space of the user process, while the user process is running.

Abstract: A preferred method and algorithm of compressing IPv6 addresses is presented which ensures smaller memory occupancy for IPv6 routing tables and databases in general (applicability to particular case of databases of the routing protocol OSPF for IPv6 is described). A method and algorithm of comparison of such compressed IPv6 addresses without decompression is presented, a method of comparison that ensures in the majority of cases better comparison performance than for the case of comparing uncompressed IPv6 addresses. Also, a preferred method and algorithm of decompressing IPv6 addresses that were compressed using this preferred format is given, and a method and algorithm of comparison of an uncompressed IPv6 address with a compressed IPv6 address without decompression. The exemplary comparison methods may achieve or exceed comparable performance with the performance of comparing uncompressed addresses. Illustrations for the particular case of the routing protocol OSPF for IPv6 are presented for all cases.

Abstract: Described is a protocol controller that supports calls to a packet subroutine which includes a packet processing engine programmed to retrieve packets from a packet memory and to interpret the packets, a working chain pointer module of the packet processing engine programmed to generate a packet memory address for each packet and a return address register of the working chain pointer module, adapted to store a return packet address. Upon processing a call packet, the packet processor engine instructs the working chain pointer module to save a next packet address of a normal packet flow in the return address register, and instructs the working chain pointer module to generate the packet address to execute the packet routine.