Abstract:
A cluster of computing systems is provided with guaranteed real-time access to data storage in a storage area network. Processes issue request for bandwidth reservation which are initially handled by a daemon on the same node as the requesting processes. The local daemon determines whether bandwidth is available and, if so, reserves the bandwidth in common hardware on the local node, then forwards requests for shared resources to a master daemon for the cluster. The master daemon makes similar determinations and reservations for resources shared by the cluster, including data storage elements in the storage area network and grants admission to the requests that don't exceed total available bandwidth.
Abstract:
A high-performance-computer system includes a statistics accumulation apparatus configured to efficiently accumulate system performance data from a variety of system components, and periodically write such data to processor local memory for efficient subsequent software processing of the thus acquired data, thereby reducing the system hardware and software overhead needed for collection of such data as compared to prior art systems.
Abstract:
The present invention relates to a temporal base method of mutual exclusion control of a shared resource. The invention will usually be implemented by a plurality of host computers sharing a shared resource where each host computer will read a reservation memory that is associated with the shared resource. Typically a first host computer will perform and initial read of the reservation memory and when the reservation memory indicates that the shared resource is available, the first host computer will write to the reservation memory. After a time delay, the host computer will read the reservation memory again to determine whether it has won access to the resource. The first host computer may determine that it has won access to the shared resource by checking that data in the reservation memory includes an identifier corresponding to the first host computer.
Abstract:
A data visualization system with the capability of viewing large amounts of data in a parallel coordinates system. Large amounts of data are displayed in parallel coordinates by grouping together data points by bins and representing grouped data with fewer graphical elements. The fewer graphical elements simplify the graphical representation of the data while still providing information about the density or volume of data occupying a particular space. Bins are determined for each axis. The volume of connections between a pair of neighboring pair of bins may be represented by modifying an aspect of the connection based on the volume.
Abstract:
Disclosed herein is a shared memory systems that use a combination of SBR and MRRR techniques to calculate eigenpairs for dense matrices having very large numbers of rows and columns. The disclosed system allows for the use of a highly scalable tridiagonal eigensolver. The disclosed system likewise allows for allocating a different number of t00hreads to each of the different computational stages of the eigensolver.
Abstract:
A data visualization technique is provided with the capability of manipulating bins of data through an interactive graphical presentation of displayed data. When a histogram is generated from stored data, a user may interact directly with the histogram columns to change columns position, width and height. A user, for example, may click and drag a particular side of a bin to change the lower or upper limit of the bin, click and drag the top of a bin to change the size/height of the bin (i.e., number of data points/elements within the bin), or click and drag the center of the bin to move or reposition the bin. The techniques may be applied to other graphical representations of data as well, such as splat graphical displays of data.
Abstract:
Embodiments of the present invention perform a method for reading data from, writing data to, powering on, or configuring a block device without the kernel translating a file system operation into a block device operation. This is implemented by a using a core module to couple applications running in user space to a character device through a character device driver, the core module configures the character device to communicate with a block device through a block device driver without the kernel translating a file system command into a block device command.
Abstract:
The present technology provides a two step process for providing a linearized dynamic storage pool. First, physical storage devices are abstracted. The physical storage devices used for the pool are divided into extents, grouped by storage class, and stripes are created from data chunks of similar classified devices. A virtual volume is then provisioned from and the virtual volume is divided into virtual stripes. A volume map is created to map the virtual stripes with data to the physical stripes, linearly mapping the virtual layout to the physical capacity to maintain optimal performance.
Abstract:
Data visualization is provided with the capability to substitute elements for groups of clustered data in a graphical interface. When large numbers of data points are to be displayed in an interface, one or more groupings of data existing close together in coordinate space may be identified within the data. Once the groupings are identified and created, an element representing each grouping may be displayed in the visualization interface along with data points not associated with a grouping. A user may select a grouping to see additional information about the grouping, such as a zoomed-in view of the data points making up the grouping. Similarly, a user may select a portion of the data points that make up a grouping to display the element and zoom out for a broader view of the data.
Abstract:
An adapter retrieves graph data from one or more graph databases and adapts the data to be shown through a visualization tool. The adapter may be used to convert multiple formats of graph data into a format which is readable and useable by the visualization tool. The adapter module may make a connection with a graph database and query the database for particular graph data. Once retrieved, the stream of retrieved graph data may be used to populate a template in Java form. From the template, the visualization tool may provide a visualization of the retrieved data.