Abstract: A secure windowing service is disclosed. When the windowing service receives an indication that a second client (executing in a second container) wishes to be given access to a set of windowing information provided by a first client (executing in a first container), the windowing service determines, based upon sensitivity labels associated with the first and second containers, whether the second client should be given access to the windowing information provided by the first client. By making this determination, the windowing service in effect implements information access control. This information access control helps to ensure that windowing information is not improperly passed from container to container.

Abstract: A mechanism is disclosed for enabling a network address to be shared by multiple containers. By allowing multiple containers to share a network address, a limit on network addresses does not limit the number of containers that can be implemented. Despite the fact that the network address is shared by multiple containers, the uniqueness and isolation of each container is still maintained. In one implementation, this is achieved by associating a unique label with each container. With this unique label, it is possible to forward a packet destined for the shared network address to a specific container despite the fact that multiple containers share the same network address. Thus, with this mechanism, it is possible to achieve container isolation and uniqueness without limiting container scalability.

Abstract: A method for resilvering a storage pool includes determining whether any of a first plurality of blocks in the storage pool, comprising metadata, require resilvering, determining whether any of a second plurality of blocks in the storage pool, comprising data, require resilvering, resilvering all of the first plurality of blocks that require resilvering, and resilvering all of the second plurality of blocks that require resilvering, wherein all of the first plurality of blocks that require resilvering are resilvered prior to resilvering any of the second plurality of blocks.

Abstract: A product catalog is associated with a rules service allowing administrators to conduct examinations of a computer system's health. Rules services establish a set of rules to be run against a particular computer system and thereafter invoke a rules engine. The rules service accesses a product catalog to supply product reference data regarding each component of interest in the computer system. The product reference data supplies to the rules service structure and characteristics of the component's telemetry data as well as factors to consider with regard to component interaction. Once supplied with the product reference and input data the rules service conducts the analysis. When reference data is not available or fails to match parsed input data, a search is conducted to identify and retrieve reference data matching the structure and characteristics of the parsed input data. Upon finding a match the product catalog is updated with the new information.

Abstract: A system for atomic file transfer operations over connectionless network protocols includes a processor and a memory coupled to the processor. The memory contains program instructions executable by the processor to implement an operating system including a system call interface for sending one or more data files to another system over a network via a connectionless network protocol. In response to an invocation of the system call by an application, the operating system is configured to send the one or more data files to the other system over the network without the application copying contents of the data files into application address space.

Abstract: A method for executing an executable file. The method includes executing instructions in the executable file by a first process, receiving a write request from a second process to write to the executable file, generating an anonymous file from the executable file in response to the write request, executing the anonymous file by the first process, and accessing the executable file by the second process.

Abstract: One embodiment of the present invention provides a system that regulates communications between a plurality of transmitters and a receiver. The system comprises a plurality of cells, wherein each cell controls communications from a transmitter in the plurality of transmitters to the receiver. A single token flows through a ring which passes through the plurality of cells, wherein the presence of the token within a cell indicates that the corresponding transmitter may communicate with the receiver.

Abstract: In at least one embodiment, a circuit board assembly that includes a printed circuit board is provided. The printed circuit board includes a top surface and a bottom surface for supporting at least one through-hole electrical component. The printed circuit board defines at least one component hole extending from the top surface to the bottom surface for receiving the at least one through-hole electrical component. The at least one component hole includes a first section having a first diameter and a second section having a second diameter. The first diameter is different from the second diameter. Each of the first and the second sections are configured to receive solder paste for forming a solder joint with the at least one through-hole electrical component.

Abstract: A magnetic sensor including a first layer that is a pinned layer, the first layer having a first edge. The magnetic sensor includes a second layer that is a non-magnetic metal layer, the second layer having a second edge corresponding to the first edge. The second layer is adjacent the first layer. The magnetic sensor includes a third layer that is a free layer, the third layer having a third edge corresponding to the first edge and the second edge. The third layer is adjacent the second layer. The magnetic sensor also includes a fourth layer that is a flux guide layer. The fourth layer is adjacent the third layer. The fourth layer extends outwardly from the third layer relative to the first layer and the second layer.

Abstract: A method, apparatus, and system are directed toward configuring a dependency relationship between resources in a cluster. A dependency relationship between a dependent in a first resource group and a dependee in a second resource group is declared. The dependency relationship might include a locality based qualifier and/or a time based qualifier. The locality based qualifier includes a Local Node, Any Node, or From Resource Group Affinity relationship. The time based dependency qualifier includes a Strong dependency, Weak dependency, Online Restart dependency, or Offline Restart dependency. The declaration might be made using a graphical user interface, property list, configuration file, or the like. A candidate node on which to activate the first resource group is determined. The dependent is brought online on the candidate node based on whether an instance of the dependee is online on a node specified by the locality based qualifier.

Abstract: A method and system for creating and executing tasks within a multithreaded application composed according to the OpenMP application programming interface (API). The method includes generating threads within a parallel region of the application, and setting a counter equal to the quantity of the threads. The method also includes, for each one of the plurality of threads, assigning an implicit task, and executing the implicit task. Further, the method includes, upon encountering a task construct, during execution of the implicit tack, for an explicit asynchronous task generating the explicit asynchronous task, adding the explicit asynchronous task to a first task queue, where the first task queue corresponds to the one of the plurality of threads; and incrementing the counter by one.

Abstract: A method for secure configuration of a sensor system involves identifying a new sensor not activated within the sensor system, the new sensor including a new sensor identifier, establishing a first transmission link between the new sensor and a sensor controller, transmitting the new sensor identifier between the sensor and the sensor controller, generating a key pair for the sensor controller, the key pair including a controller public key and a controller private key, generating a key pair for the new sensor, the key pair including a sensor public key and a sensor private key, transmitting the controller public key to the new sensor and the sensor public key to the sensor controller, and generating a pairwise key within the sensor controller and the new sensor.

Abstract: One particular implementation of the present invention may take the form of a method for correlating partial views of network resources into normalized or aggregated views for use by an administrator. The implementation may compare a newly detected resource against the known set of normalized resources of the network to correlate the new resource with an existing network resource. More particularly, one method for correlating network resources may compare key/value pairs associated with a new resource with key/value pairs associated with a first normalized resource. If the new resource does not correlate to the first normalized resource, the method may then compare the key/value pairs of the new resource to the key/value pairs of the second normalized resource. A second implementation may compare a unique key/value pair to a map containing the unique key/value pairs of each normalized resource, until the unique key/value pair is found.

Abstract: Hardware-based transactional memory mechanisms, such as Speculative Lock Elision (SLE), may allow multiple threads to concurrently execute critical sections protected by the same lock as speculative transactions. Such transactions may abort due to contention or due to misidentification of code as a critical section. In various embodiments, speculative execution mechanisms may be augmented with software and/or hardware contention management mechanisms to reduce abort rates. Speculative execution hardware may send a hardware interrupt signal to notify software components of a speculative execution event (e.g., abort). Software components may respond by implementing concurrency-throttling mechanisms and/or by determining a mode of execution (e.g., speculative, non-speculative) for a given section and communicating that determination to the hardware speculative execution mechanisms, e.g., by writing it into a lock predictor cache.

Abstract: Improvements to apparatus, methods, and computer program products are disclosed to improve the efficiency of pinning objects in a heap memory that is subject to a garbage collection system.

Abstract: A Scalable NonZero Indicator (SNZI) object in a concurrent computing application may include a shared data portion (e.g., a counter portion) and a shared nonzero indicator portion, and/or may be an element in a hierarchy of SNZI objects that filters changes in non-root nodes to a root node. SNZI objects may be accessed by software applications through an API that includes a query operation to return the value of the nonzero indicator, and arrive (increment) and depart (decrement) operations. Modifications of the data portion and/or the indicator portion may be performed using atomic read-modify-write type operations. Some SNZI objects may support a reset operation. A shared data object may be set to an intermediate value, or an announce bit may be set, to indicate that a modification is in progress that affects its corresponding indicator value. Another process or thread seeing this indication may “help” complete the modification before proceeding.

Abstract: A multithreaded microprocessor includes an instruction fetch unit including a perceptron-based conditional branch prediction unit configured to provide, for each of one or more concurrently executing threads, a direction branch prediction. The conditional branch prediction unit includes a plurality of storages each including a plurality of entries. Each entry may be configured to store one or more prediction values. Each prediction value of a given storage may correspond to at least one conditional branch instruction in a cache line. The conditional branch prediction unit may generate a separate index value for accessing each storage by generating a first index value for accessing a first storage by combining one or more portions of a received instruction fetch address, and generating each other index value for accessing the other storages by combining the first index value with a different portion of direction branch history information.

Abstract: A method for job delegation including receiving a job from a user by a first management object, identifying a target system for the job using a data model in the first management object and a job delegation policy, where the data model comprises an object representing the target system, and determining a first nexthop for the target system, where the first nexthop is a second management object. The method also includes placing the job on a queue corresponding to the second management object, where the queue is located in the first management object, receiving the job by the second management object, locating the target system and a driver corresponding to the target system using the second management object, and executing the job using the driver corresponding to the target system.

Abstract: Methods and apparatuses are disclosed that allow for improved speculation success in execute ahead microprocessors. In some embodiments, the method may include speculatively executing a first thread of a program code while a second thread of the program code is executing, determining if a load request is serviceable from a cache line within a cache, and in the event that the load request is serviceable from the cache line, associating a first indicator bit with the cache line. The method also may include determining whether the cache line associated with the first indicator bit has been evicted, and in the event that the cache line is evicted, allowing speculative execution of the first thread to continue.

Abstract: A register file, in a processor, includes a first plurality of registers of a first size, n-bits. A decoder uses a mapping that divides the register file into a second plurality M of registers having a second size. Each of the registers having the second size is assigned a different name in a continuous name space. Each register of the second size includes a plurality N of registers of the first size, n-bits. Each register in the plurality N of registers is assigned the same name as the register of the second size that includes that plurality. State information is maintained in the register file for each n-bit register. The dependence of an instruction on other instructions is detected through the continuous name space. The state information allows the processor to determine when the information in any portion, or all, of a register is valid.