Abstract:
Multiple-precision hybrid multiplication is a technique that takes advantage of row-wise multiplication and column-wise multiplication. To generate a product for multiple-precision operands, partial products of the multiple-precision operands are accumulated in accordance with a hybrid of column-wise multiplication and row-wise multiplication. The partial products accumulated are of partial rows. The partiality of the row-wise partial products is defined by a parameter.
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:
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 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:
A method for managing data, including obtaining a first instruction for moving a first data item from a first source to a first destination, determining a data type of the first data item, determining a data type supported by the first destination, comparing the data type of the first data item with the data type supported by the first destination to test a validity of the first instruction, and moving the first data item from the first source to the first destination based on the validity of the first instruction.
Abstract:
One embodiment of the present invention provides a system that facilitates performing concurrent garbage collection. Note that the system uses hardware-supported GC barriers. During operation, the system executes a first mutator thread. While executing the first mutator thread, the system performs a garbage-collection operation using a garbage-collector thread. Performing the garbage-collection operation involves: discovering a live object in a from-space, which is being collected; creating a copy of the live object to a to-space, where live objects are copied to during garbage collection; and replacing the live object in the from-space with a forwarding pointer which points to a location of the copy of the live object in the to-space. Note that in some embodiments, the system marks cache lines comprising the live object in from-space as “forwarded,” which prevents any mutator threads from touching the cache lines. Additionally, in some embodiments, the system determines if the first mutator thread holds any additional references to the from-space. If so, the system leaves the first mutator thread marked as “dirty,” wherein dirty is the initial state for mutator threads. If not, the system marks the first mutator thread as “clean.”
Abstract:
A method for processing packets. The method includes receiving a first packet by a network interface card (NIC) from a network, determining, using a first classification level, a first receive ring group (RRG) for the first packet, determining, using a second level classification, a first receive ring (RR) in the first RRG for the first packet, sending the first packet to the first RR, and sending the first packet from the first RR to a host operatively connected to the network interface card, wherein the first packet is received by a first virtual network interface card (VNIC) associated with the first RRG, where the first RRG is located in the NIC.
Abstract:
A method for controlling a denial of service attack involves receiving a plurality of packets from a network, identifying an attacking host based on a severity level of the denial of service attack from the network, wherein the attacking host is identified by an identifying attack characteristic associated with one of the plurality of packets associated with the attacking host, analyzing each of the plurality of packets by a classifier to determine to which of a plurality of temporary data structures each of the plurality of packet is forwarded, forwarding each of the plurality of packets associated with the identifying attack characteristic to one of the plurality of temporary data structures matching the severity level of the denial of service attack as determined by the classifier, requesting a number of packets from the one of the plurality of temporary data structures matching the severity level by the virtual serialization queue, and forwarding the number of packets to the virtual serialization queue.
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.
Abstract:
Methods, systems, and articles of manufacture consistent with the present invention enable a user to input data into a document having cells arranged in columns and rows. A first of the cells and a second of the cells each have an original content. The original content of the first cell is overridden with a first user inputted value. The cells are recalculated based on the first user inputted value. After recalculating the cells based on the first user inputted value, the original content of the second cell is overridden with a second user inputted value. The cells are recalculated based on the second user inputted value. The original content of the first cell is automatically restored based on a user input such that the second user inputted value is maintained in the second cell.