Abstract: A patch or set of patches may be deployed, often to a subset of potentially vulnerable systems, to address a particular vulnerability while providing a facility to monitor and, in some cases, characterize post-patch exploit attempts. Often, such a patch will check for an exploit signature and, if an exploit attempt is detected or suspected, take an appropriate action. For example, the patch may include code to log indicative data or trigger such logging. In some exploitations, the patch may generate or contribute to a warning or advisory regarding an additional target (or targets) of the exploit and, if appropriate, initiate a patch or protective measure for the additional target(s). In some exploitations, the patch may simulate responses or behaviors suggestive (to an attacker) of unpatched code. In some exploitations, the patch may direct an exploit attempt to a service (or simulated service) hosted or executing in an isolated protection domain.

Abstract: A method and apparatus for dynamically arbitrating, in hardware, requests for a resource shared among multiple clients. Multiple data streams or service requests require access to a shared resource, such as memory, communication bandwidth, etc. A hardware arbiter monitors the streams' traffic levels and determines when one or more of their arbitration weights should be adjusted. When a queue used by one of the streams is filled to a threshold level, the hardware reacts by quickly and dynamically modifying that queue's arbitration weight. Therefore, as the queue is filled or emptied to different thresholds, the queue's arbitration weight rapidly changes to accommodate the corresponding client's temporal behavior. The arbiter may also consider other factors, such as the client's type of traffic, a desired quality of service, available credits, available descriptors, etc.

Abstract: Embodiments of an integrated circuit are described. This integrated circuit includes: a clock-generator circuit configured to provide a clock signal; an optical clock path coupled to the clock-generator circuit; and a latch coupled to the optical clock path. This optical clock path is configured to distribute an optical signal corresponding to the clock signal. Furthermore, the optical clock path is configured to optically set a skew value for the optical signal, and is configured to selectively gate distribution of the optical signal to the latch based on activity of the latch. Note that the selective gating is performed optically.

Abstract: Some embodiments of the present invention provide a system that schedules read operations for disk drives in a set of disk drives. During operation, the system monitors a write rate for write operations to a given disk drive in the set of disk drives, wherein vibrations generated by the read operations directed to disk drives in the set of disk drives are transmitted to the given disk drive. Then, the read operations for disk drives in the set of disk drives are scheduled based on the write rate for the given disk drive, thereby limiting interference between the write operations and the vibrations generated by the read operations.

Abstract: Embodiments of a mechanical device to facilitate in-situ measurements of vibration associated with a corresponding component in a computer system are described. This mechanical device includes a housing that has approximately a same mass as the component, approximately a same distribution of mass about a geometric center of the component, and approximately a same form factor as the component. Moreover, the mechanical device includes one or more vibration sensors, which are mechanically coupled to the housing, and which are configured to perform the in-situ vibration measurements.

Abstract: An audio management apparatus manages simultaneous streams of packet-switched audio data for a network conference tool, and allows the combining of conferences that are not co-located. The apparatus uses at least two audio bridges, each of which receives audio inputs from a plurality of local connection points, does mixing of the audio data for each local connection point and provides the audio outputs thereto. Also provided is a communications link between the two audio bridges, and each of the audio bridges creates an audio mix from its local connection points and outputs it over the communications link to the other audio bridge. Each bridge may treat the audio data from the other audio bridge as it does any other call. In this way, the combining of the two conferences is accomplished in a simple and straightforward manner.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for processing an ordered sequence of elements in one or more queues. A first element is received from a queue at a first processor. The first element is processed during a first processing time. A second element is received from a queue at a second processor. The second element is processed during a second processing time. The first and second processed elements are committed serially to a write queue, such that a temporal order between the first and second elements in the queues is maintained regardless of the durations of the first and second processing times.

Abstract: A processor including an integrated system interface unit configured to manage multiple I/O interfaces and multiple protocols. A processor includes a plurality of processing cores, a cache comprising a plurality of banks, and a system interface unit coupled to the processing cores and the cache. The system interface unit includes an inbound unit configured to receive inbound transactions from a first I/O unit and a second I/O unit, and an outbound unit configured to convey outbound transactions to either the first I/O unit or the second I/O unit. Each of the first and second I/O units is configured to support different protocols. Prior to conveying transaction data to the system interface, the first I/O unit and second I/O units reformat transaction data to conform to a common format. The system interface receives and stores transaction data in either queues dedicated for cacheable transactions or queues dedicated for non-cacheable transactions.

Abstract: A technique for accessing a shared resource of a computerized system involves running a first portion of a first thread within the computerized system, the first portion (i) requesting a lock on the shared resource and (ii) directing the computerized system to make operations of a second thread visible in a correct order. The technique further involves making operations of the second thread visible in the correct order in response to the first portion of the first thread running within the computerized system, and running a second portion of the first thread within the computerized system to determine whether the first thread has obtained the lock on the shared resource. Such a technique alleviates the need for using a MEMBAR instruction in the second thread.

Abstract: In an electronic procurement system having a portal server, an Extensible Markup Language (XML) content integration and transformation method and system. The XML content integration and transformation system includes logic for retrieving an “Open Buying on the Internet (OBI)” compliant XML file from a database which is then formatted in response to an electronic purchasing request over the Internet. In one embodiment of the present invention, the client aware XML content transformation system receives an OBI XML file and uses this information to automatically search for data objects related to the OBI XML file content from a database on the Internet and translates the content into a format suitable for internal processing by the XML content integration and transformation logic and delivers it to the purchasing requisitioner over the Internet.

Abstract: A system including a plurality of virtual network interface cards (VNICs); and a Vswitch table associated with a virtual switch, wherein each entry in the Vswitch table is associated with one of the plurality of VNICs, wherein each of the plurality of VNICs is located on the host, and wherein each of the plurality of VNICs is associated with the virtual switch. The first VNIC in the plurality of VNICs is configured to receive a packet associated with a hardware address (HA), determine, using the HA, whether one of the plurality of entries in the Vswitch table is associated with the HA, send the packet to a VNIC associated with HA if one of the plurality of entries in the Vswitch table is associated with the HA, wherein the VNIC is one of the plurality of VNICs.

Abstract: A method for reducing a usage of main memory by a first class loader and a second class loader is provided. The first class loader and the second class loader are capable of dynamically loading a class having a class file, and translating the class file into a first and a second class type, respectively. The method includes dividing a runtime representation of the first class type into a first loader independent part and a first loader dependent part. Also included is determining whether a runtime representation of the second class type can use the first loader independent part of the runtime representation of the first class type. If the first loader independent part can be used, the method includes generating a second loader dependent part of the runtime representation of the second class type using the first loader independent part of the runtime representation of the first class type.

Abstract: One embodiment may estimate the processing time of tasks requested by an application by maintaining a state-model for the application. The state model may include states that represent the tasks requested by the application, with each state including the average run-time of each task. In another embodiment, a state model may estimate which task is likely to be requested for processing after the current task is completed by providing edges in the state model connecting the states. Each edge in the state model may track the number of times the application transitions from one task to the next. Over time, data may be gathered representing the percentage of time that each edge is from a state node. Given this information, the scheduler may estimate the CPU cost of the next task based on the current state, the most likely transition, and the cost of the predicted next task.

Abstract: The classification of data stored on a storage medium is dynamically modified without the data being relocated to another storage medium. Data stored on a plurality of storage mediums is classified independent of the physical location at which the data resides. Rather than moving data to storage media that possess different classifications, the data itself receives a classification apart from the storage medium. Data which is considered high priority would be afforded maximum use of the storage medium resources and bandwidth availability. Data that is of lower interest is classified with a lower classification resulting in differing levels of resources authorized to access that data. Throughout this reclassification process the data remains resident on the same storage medium.

Abstract: A modularized computing system includes a plurality of modular components that are coupled together forming a network. Each modular component includes a standard network interface. The system further includes an initialization module, a monitor module, a storage medium, and a management module. As a module unit is coupled to the network, the initialization module automatically configures the component to an operable state. The monitor module monitors network operations including performance parameters of each modular component based on a plurality of system policies. Based on information gathered by the monitor module, the management module actively modifies network structure and resource allocation to optimize network performance.

Abstract: A system and method for coordinating a point-in-time copy (PITC) of a file or set of data distributed (e.g., striped) across multiple data providers (e.g., filers, file servers, storage arrays). A service coordinator receives a PITC request for a parent file, initializes the PITC's metadata and instructs the data providers to generate PITC subcomponents for the portions (e.g., sub-mirrors) of the file that they store. A scoreboard is created to track the status of the PITC, and includes an entry for each PITC subcomponent. Quality of service characteristics for the PITC may be copied from the parent and/or received with the request. If those characteristics cannot be attained, the PITC may be aborted. As PITC subcomponents are completed, they are returned to the service coordinator for assembly of the PITC.

Abstract: A method for detecting user input dependence in software code. The method including representing the software code with a reachability graph having: a plurality of nodes, where a root node of the plurality of nodes represents an input controlled by a user; a first directed edge connecting a first node of the plurality of nodes and a second node of the plurality of nodes, where the first directed edge represents a data dependency; and a second directed edge connecting a third node of the plurality of nodes and a fourth node of the plurality of nodes, wherein the second directed edge represents a data dependency. The method also includes identifying a fifth node of the plurality of nodes as a reachable node from the root node by traversing the reachability graph from the root node to the reachable node; and marking a portion of the software code represented by the reachable node as user input dependant.

Abstract: An apparatus for an event tolerant circuit including a latch. The event tolerant circuit may maintain correct data values even after the occurrence of an event such as a soft error. The event tolerant circuit may introduce a delay in a feedback loop, thereby passing the glitch value to an element in the feedback loop at different times, thus preventing the propagation of the glitch through the event tolerant circuit.

Abstract: In a response based messaging system in which the reliability of the message transmission is supplemented by storing at both the source and destination a copy of the message, storage space is bounded. By including in the response to a message acknowledgement from the destination that the message has been received, the copy of the message stored at the source can be deleted. Furthermore, by including in the message an identifier of what message acknowledgement the source is expecting, the destination can delete from its storage medium any previously stored messages.

Abstract: A multiprocessor, multi-program, stop-the-world garbage collection program is described. The system initially over partitions the root sources, and then iteratively employs static and dynamic work balancing. Garbage collection threads compete dynamically for the initial partitions. Work stealing double-ended queues, where contention is reduced, are described to provide dynamic load balancing among the threads. Contention is resolved by using atomic instructions. The heap is broken into a young and an old generation where parallel semi-space copying is used to collect the young generation and parallel mark-compacting the old generation. Speed and efficiency of collection is enhanced by use of card tables and linking objects, and overflow conditions are efficiently handled by linking using class pointers. A garbage collection termination employs a global status word.