Abstract: For validating user input fields in a graphical user interface, a data entry field includes a graphical validation indicator. In response to user activation of the validation indicator, such as by hovering with an on-screen pointer, a message is displayed in visual association with the data entry field. The message describes one or more expected characteristics of the data to be entered, for example that the data is numerical. As the user enters data consistent with the expected characteristics, the validation indicator is displayed with a neutral appearance, indicating that no errors have been detected. If incorrect data is detected, the validation indicator takes on an emphasized appearance, such as a higher intensity and/or an error-indicating color such as red, providing an immediate error indication to the user. An error message may also be displayed in visual association with the data entry field.

Abstract: A method of utilizing timestamps for the global ordering of event information, particularly hardware error reporting, is disclosed. Locally generated time stamps are associated with hardware errors or other events. The timestamps form the basis for the global ordering of event information. The timestamps are normalized, either through a pre-synchronization process with a common time, or through the use of offsets maintained either locally near system chips or by the system processor. Once normalized, the timestamps can be compared to determine a first occurring event among multiple reported events.

Abstract: A technique for testing instruction TLB hardware involves (i) allocating a memory segment, (ii) writing instructions to pages in the memory segment for testing the instruction TLB hardware, where the instructions comprise at least one control transfer instruction, (iii) executing the instructions, and (iv) monitoring a count of events in the instruction TLB hardware occurring dependent on the executing.

Abstract: In a generational, copying garbage collector, young generation collection may be made more efficient by dynamically measuring object survival rates as a function of “fine-grained” allocation age, and choosing, on the basis of these survival rates, part of the young generation that will be not be collected, but instead scanned for pointers to objects in the rest of the young generation. The rest of the young generation, including objects referenced by the pointers, is then collected.

Abstract: A device is described, including a first diffusion region having a first terminal, a second diffusion region having a second terminal, and a channel region disposed between the first diffusion region and the second diffusion region. Further, the first terminal and the second terminal are offset to enable a non-Manhattan current flow. A system is also described, including the previously described device and a second transistor. The pathway for the flow of the majority of the current carriers in the device defines a first direction. The second transistor also has at least two terminals, and a pathway for a majority of current carriers between the two terminals defines a second direction. The angle between the first direction and the second direction is nonzero and acute.

Abstract: A method for executing a selected input/output (I/O) command from a plurality of I/O commands based on a dependency graph of I/O commands includes building the dependency graph of I/O commands, wherein the dependency graph is built by requiring all children of the selected I/O command to be ready before the selected I/O command is ready, and executing the I/O command based on the dependency graph, wherein execution of the selected I/O command is completed when all of the children of the selected I/O command finish execution.

Abstract: In a space incremental garbage collector, remembered set information for a region is stored in a set of fixed-size data structures, each of which has a representation of the information and a level of precision that differs from other data structures in the set. Remembered set information for each other region is placed in a data structure based on the density of inter-region references between the region and the other region. The remembered set information for the other region is moved from one data structure to another data structure when the density of inter-region references between the region and the other changes. Some of the data structures use bit arrays to store the information and these arrays can be combined with bit arrays produced by the collector to facilitate the identification and removal of stale remembered set entries.

Abstract: One embodiment of the present invention provides a system that supports read-only objects within an object-addressed memory hierarchy. During operation, the system receives a request to access an object, wherein the request includes an object identifier for the object that is used to reference the object within the object-addressed memory hierarchy. In response to this request, the system uses the object identifier to retrieve an object table entry associated with the object. If the request is a write request, the system examines a read-only indicator within the object table entry. If this read-only indicator specifies that the object is a read-only object, the system performs a corrective action to deal with the fact that the write request is directed to a read-only object.

Abstract: A system including a direct virtual memory access engine configured to request that data is stored in a memory, wherein a request for the data includes a I/O virtual address, a mapping table configured to store at least one entry includes a virtual-to-physical address mapping, a cache configured to store at least one tracking data structure associated with the at least one entry, and an input/output memory management unit storing the mapping table, operatively connected to the cache and configured to provide a physical address corresponding to the I/O virtual address to the direct virtual memory access engine, wherein the virtual-to-physical address mapping is generated prior to the direct virtual memory access engine requesting that data be stored, wherein the at least one entry and the at least one tracking structure persist for at least two direct memory address requests.

Abstract: One embodiment of the present invention provides a system that reconstructs a high-resolution signal from a set of low-resolution quantized samples. During operation, the system receives a time series containing low-resolution quantized signal values which are sampled from the high-resolution signal. Next, the system performs a spectral analysis on the time series to obtain a frequency series for the low-resolution quantized signal values. The system next selects a subset of frequency terms from the frequency series which have the largest amplitudes. The system then reconstructs the high-resolution signal by performing an inverse spectral analysis on the subset of the frequency terms.

Abstract: A method and system for labeling data in a networked environment. The method and system comprise determining if a label should be added to a portion of data having an associated first header. If so, a second header is constructed containing a label. The second header is indicated in a reference in the first header. The label contains at least one attribute of the data. The second header is attached to the first header. The portion of data is then transmitted, along with the headers. In one embodiment, the second header may contain credential information related to the data portion.

Abstract: An invention is provided for generating an XML test result file. A key parameter and a value parameter are received, wherein the key parameter relates to a tag. A first string is then generated based on the key parameter and the value parameter. Included in the first string is a first beginning tag and a first ending tag, each based on the key parameter. In addition, the first string includes the value parameter positioned between the first beginning tag and the first ending tag. The first string is then inserted into a test results file that stores a second string that has a second beginning tag and a second ending tag. In particular, the first string is inserted between the second beginning tag and a second ending tag. By continuing in this manner, an XML test results file can be generated using the embodiments of the present invention.

Abstract: One embodiment of the present invention provides a system that implements a pluggable password obscuring mechanism. During operation, the system receives a request to obscure a password to produce an obscured version of the password. If the request specifies a customized technique for obscuring the password, the system loads a dynamic library that performs the customized technique, and then uses the dynamic library to obscure the password. If the request does not specify a customized technique, the system uses a default technique to obscure the password. In this way, the customized technique for obscuring the password can be used without having to modify source code.

Abstract: In one embodiment, a method for efficiently classifying packets for a multi-processor/mutli-thread environment is provided. The method initiates with receiving a packet. Then, header information is extracted form the received packet. Next, a first hash value is calculated. Then, a field of interest in a lookup table is determined from the first hash value. Next, a second hash value is calculated. Then, the second hash value is compared to stored hash values in the field of interest of the lookup table to determine a match between the second hash value and one of the values in the field of interest of the lookup table. If there is a match, the received packet is transmitted to a processor corresponding to the one of the values in the row location of the lookup table. A network interface card and a system for efficiently classifying packets in a multicore/multithread environment are also provided.

Abstract: A method and system to manage user access to resources and computing tasks on servers located on a network. The preferred embodiments of this system would enable a resource provider to manager user access to resources based on user specific criteria and resource specific criteria. The invention creates user associated access session(s) and generates tokens corresponding to such access session(s) to allow user access. The system is able to manage any type or any combination of licensing criteria, to manage different licensing criteria associated with the same user, to manage different licensing criteria associated with the same resource, and to manage different licensing relationship among users and resources. The system is scalable as additional sets of license managers can be added to manage additional users and resources. Optionally, secondary access sessions are provided to users to allow for completion of a current task when initial access session(s) are depleted.

Abstract: In general, in one aspect of the invention, the invention relates to a method and system for automatically developing software tests for a software program having source code written in an object-oriented programming language. Computer implemented instructions are stored collectively within the at least one storage device which when executed, perform a method. The method includes determining at least one class present within the source code and identifying a method associated with the class, the method having at least one characteristic. The at least one characteristic includes at least one selected from the group consisting of a category and a number of arguments. The method further includes matching a test template to the method based on the method category and the number of arguments, resulting in a matched template, and generating a test based on the matched template and the method.

Abstract: In general, the invention relates to a method for storing data. The method includes receiving an Input/Output (I/O) request to store data in a storage pool, determining whether the I/O request is a resilvering I/O request, if the I/O request is a resilvering I/O request: associating the I/O request with a first deadline, wherein the first deadline is associated with a low priority, and determining the quantized deadline for the I/O request using the first deadline. If the I/O request is not the resilvering I/O request: associating the I/O request with a second deadline, determining the quantized deadline for the I/O request using the second deadline, placing the I/O request in the I/O queue using the quantized deadline, and issuing the I/O request to the storage pool using the I/O queue.

Abstract: Conventional tag libraries facilitate web page development by referencing external code from within an HTML page via a mnemonic tag, however such conventional tag libraries typically rely on a manually generated set of supporting code. Such supporting code typically requires a thorough knowledge of the underlying code language, such as Java, C++ and Java Server Pages (JSP). A tag library generator for generating the supporting code corresponding to a tag library mitigates the shortcomings of manually generated support code by parsing a metadata file defining the operations and functions provided by the supporting code. The parser extracts components and renderers corresponding to the supporting code. Each of the components may have corresponding properties, and each of the renderers may have corresponding attributes, which the parser also extracts. The tag library generator receives the parsed items, and processes each of the components with corresponding renderers to generate the applicable support code.

Abstract: Methods, systems, and articles of manufacture consistent with certain principles related to the present invention enable a computing system to receive a serialized message including a target object that is associated with at least one member object. The computing system may invoke a deserialize method on a deserializer associated with the target object. In the event the deserialize method cannot completely deserialize the target object, the deserializer may configure a state object returned by the method to monitor a deserialization status associated with the at least one member object. The deserializer may also create an instance builder object that may complete deserialization of the target object in response to receiving a notification reflecting that the at least one member object is deserialized.

Abstract: One embodiment of the present invention provides a system that facilitates displaying multiple two-dimensional (2D) windows with related content within a three-dimensional (3D) display model. The system starts by receiving a command to display a first window within the 3D display model. In response to the command, the system displays the content of the first window on a first surface of a 3D object. Next, the system receives a command to display a second window within the 3D display model, wherein content of the second window is related to content of the first window. The system then displays content of the second window on a second surface of the 3D object.