Abstract: A system and method for tagging objects in a software design space includes a visual representation generator that presents a visual representation of a software design to a user, and a tag manager that is operable to allow the user to create and manage tags of each object within the software design space. Certain tags are only visible to users having specific access rights to the tag.

Abstract: A system and method for quickly discerning a process's completeness via graphical representation of processes by graphical objects with associated embedded symbols is disclosed. The present system and method decreases design time and increases personnel deployment efficiency.

Abstract: A system, a software product, and a method facilitate collaborative viewing of at least part of a software design. A first view of the at least part of the software design is generated, within a development server. A second view of the at least part of the software design is generated within the development server. Modifications to the at least first part of the software design are received within the development server from a first developer interacting with the first view, and the second view is automatically updated based upon the modifications.

Abstract: A system, method and software product determine and display a complexity designation of a software design based upon a hierarchical functional decomposition design model. Within a development server, a number of decomposition levels in the software design, a number of subgraphs in the software design, and a number of processes in the software design are determined. A complexity designation for the software design based upon the number of decomposition levels and the average number of processes in the subgraphs is then determined and displayed.

Abstract: A System and a method implement a first collaboration between a first group of developers working at a first location within a hierarchical workspace and a second collaboration between a second group of developers working at a second location within the hierarchical workspace. The first collaboration is generated in association with the first location, and for each of the first group of developers, a first collaboration screen in communication with the first collaboration is generated. Information is conveyed between each of the first collaboration screens. The second collaboration is generated in association with the second location, and for each of the second group of developers, a second collaboration screen in communication with the second collaboration is generated. Information is conveyed between each of the second collaboration screens.

Abstract: We discuss a software design and automatic coding system particularly applicable to generating code for massively parallel computing systems. This system operates on a high performance computer and provides a collaborative, interactive, iterative method of defining and designing software for parallel computing systems, and generates software code directly from design elements without the use of code patterns, meta-data, or domain rules, reducing bugs and cost while retaining the time-to-market advantages of iterative ad-hoc methods.

Abstract: A system and method for performing functional decomposition of a software design to generate a computer-executable FSM and a graphical representation of the design in a decomposition diagram stored in a program database with source code, test code, and other program data. The method includes searching for pre-existing software modules that meet program design requirements. Modules needing work are displayed on Gantt or PERT charts as tasks, and may be annotated with start dates, and completion dates. Percent complete of the design is automatically generated and updated, and may be displayed on the charts. The decomposition is automatically used to introduce error detection states into the FSM for recognizing invalid states and saving checkpoints, and for recognizing and repairing both race conditions and deadlock conditions in the design.

Abstract: Disclosed herein is a system and method for automatically generating a test for a design process. The present system and method compares a keyword list associated with a design process and keyword lists associated with kernels and/or algorithms, temporarily associating matching kernels and/or algorithms with the design process, testing the kernels and/or algorithms with an input and designates the best output as the expected output.

Abstract: A system and method for determining engagement of members of an audience during a lecture. Speech by the lecturer is detected to initiate image processing, which is performed by first capturing the audience in multiple image frames using a video camera; performing edge detection on an image frame to generate a digital edge map of the frame; detecting an approximate facial region skeletal image candidate in the image frame including circular and elliptical shapes for iris, eye and face; extracting location information for a candidate face in the image frame, including eyes and irises in the skeletal image to generate approximate facial region location information; and determining, from the location information, whether required spatial relationships exist within a candidate, for that candidate to be considered as a face of one of the members. When an iris is essentially circular, the member with a corresponding face is considered to be engaged.

Abstract: A system and method for automatic code-design and file/database-design association. Existing source code is analyzed for process and control elements. The control elements are encapsulated as augmented state machines and the process elements are encapsulated as kernels. The new elements can then have meta-data attached (including, a name, I/O method, and test procedures), allowing software code sharing and automatic code/file/database upgrading, as well as allowing sub-subroutine level code blocks to be accessed directly.

Abstract: A system and method for communication in a parallel computing system is applied to a system having multiple processing units, each processing unit including processor(s), memory, and a network interface, where the network interface is adapted to support virtual connections. The memory has at least a portion of a parallel processing application program and a parallel processing operating system. The system has a network fabric between processing units. The method involves identifying need for communication by the first processing unit with a group of processing units, creating virtual connections between the processing units, and transferring data between the first processing units.

Abstract: A method for capturing information related to a software application. Initially, a current browser display screen is copied into a browser-based application. The browser display screen is then displayed as a popup window including an editing window comprising selectable text and graphics editing options. Text and graphics editing options are provided to annotate the popup window with application information. User information including user name and email address is received, and the application information and associated user information is stored in a database. The annotated display screen is displayed in response to receiving the name of the corresponding annotator.

Abstract: A system and method for graphically depicting an entire cloud economy by use of a graphical display allows at-a-glance understanding of the effects of pricing and effects of upgrades. The graphical display also shows the economic footprint of certain (Kernel) algorithms, and shows the rate of relative economic change between those algorithms.

Abstract: Parallel Processing Communication Accelerator (PPCA) systems and methods for enhancing performance of a Parallel Processing Environment (PPE). In an embodiment, a Message Passing Interface (MPI) devolver enabled PPCA is in communication with the PPE and a host node. The host node executes at least a parallel processing application and an MPI process. The MPI devolver communicates with the MPI process and the PPE to improve the performance of the PPE by offloading MPI process functionality to the PPCA. Offloading MPI processing to the PPCA frees the host node for other processing tasks, for example, executing the parallel processing application, thereby improving the performance of the PPE.

Abstract: Parallel Processing Communication Accelerator (PPCA) systems and methods for enhancing performance of a Parallel Processing Environment (PPE). In an embodiment, a Message Passing Interface (MPI) devolver enabled PPCA is in communication with the PPE and a host node. The host node executes at least a parallel processing application and an MPI process. The MPI devolver communicates with the MPI process and the PPE to improve the performance of the PPE by offloading MPI process functionality to the PPCA. Offloading MPI processing to the PPCA frees the host node for other processing tasks, for example, executing the parallel processing application, thereby improving the performance of the PPE.

Abstract: A parallel processing development environment has a graphical process control server that provides an interface through which a developer may access the environment to create a parallel processing routine. The development environment also includes a financial server for managing license and usage fees for the parallel processing routine, wherein the developer of the parallel processing routine receives a portion of the license and usage fees received for the routine. The environment identifies plagiarism and malicious software within the parallel processing routine.

Abstract: We discuss a software design and automatic coding system particularly applicable to generating code for massively parallel computing systems. This system operates on a high performance computer and provides a collaborative, interactive, iterative method of defining and designing software for parallel computing systems, and generates software code directly from design elements without the use of code patterns, meta-data, or domain rules, reducing bugs and cost while retaining the time-to-market advantages of iterative ad-hoc methods.

Abstract: Systems and methods form and control a supercomputer based upon a parallel processing architecture such as a Howard cascade. A graphical user interface allows a user to interact with one or more virtual power centers of the supercomputer facility. A plurality of processing nodes self-organize into one or more virtual power centers. The processing nodes utilize overlapped input and output for improved communication.

Abstract: A method using for performing a scatter-type data distribution among a cluster of computational devices. A number of nodes (equal to a value Cg, the number of tree generator channels) are initially generated, each connected to an initial generator, to create respective initial root nodes of an initial tree structure. Data is transmitted from the initial generator to each of the initial root nodes. Cg root nodes, each connected to a respective new generator, are generated to create respective roots of Cg newly generated tree structures. Each of the tree structures is expanded by generating Ct (the number of communication channels per node in each tree structure) new nodes connected to each node generated in each previous step. Data is then transmitted to each of the new nodes from an immediately preceding one of the nodes, and from each new generator to an associated root node.

Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.