System and method for representing and manipulating three-dimensional objects on massively parallel architectures

Title: System and method for representing and manipulating three-dimensional objects on massively parallel architectures

Full Record
Similar

A parallel computing system is described that comprises a plurality of uniquely labeled, parallel processors, each processor capable of modelling a three-dimensional object that includes a plurality of vertices, faces and edges. The system comprises a front-end processor for issuing a modelling command to the parallel processors, relating to a three-dimensional object. Each parallel processor, in response to the command and through the use of its own unique label, creates a directed-edge (d-edge) data structure that uniquely relates an edge of the three-dimensional object to one face of the object. Each d-edge data structure at least includes vertex descriptions of the edge and a description of the one face. As a result, each processor, in response to the modelling command, operates upon a small component of the model and generates results, in parallel with all other processors, without the need for processor-to-processor intercommunication.

Inventors:

Karasick, Michael S. ^[1]; Strip, David R. ^[2]

(Ridgefield, CT)
(Albuquerque, NM)

Issue Date:: 1996-01-01

OSTI Identifier:: 870279

Assignee:: International Business Machines Corporation (Armonk, NY) SNL

Patent Number(s):: US 5488692

Contract Number:: AC04-76DP00789

Research Org:: AT & T CORP

Country of Publication:: United States

Language:: English

Subject:: method; representing; manipulating; three-dimensional; massively; parallel; architectures; computing; described; comprises; plurality; uniquely; labeled; processors; processor; capable; modelling; vertices; edges; front-end; issuing; command; relating; response; unique; label; creates; directed-edge; d-edge; data; structure; relates; edge; vertex; descriptions; result; operates; component; model; generates; results; processor-to-processor; intercommunication; parallel computing; massively parallel; parallel processor; parallel process; data structure; /345/

Full Text
File size N/AView Full Text

Similar records in DOepatents and OSTI.GOV collections:

System and method for representing and manipulating three-dimensional objects on massively parallel architectures

Patent Karasick, M.S. ; Strip, D.R.

A parallel computing system is described that comprises a plurality of uniquely labeled, parallel processors, each processor capable of modeling a three-dimensional object that includes a plurality of vertices, faces and edges. The system comprises a front-end processor for issuing a modeling command to the parallel processors, relating to a three-dimensional object. Each parallel processor, in response to the command and through the use of its own unique label, creates a directed-edge (d-edge) data structure that uniquely relates an edge of the three-dimensional object to one face of the object. Each d-edge data structure at least includes vertex descriptions ofmore »« less
January 1996
Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

Patent Archer, Charles Jens ; Musselman, Roy Glenn ; Peters, Amanda ; Pinnow, Kurt Walter ; Swartz, Brent Allen ; Wallenfelt, Brian Paul

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.
Full Text Available March 2010
Method and apparatus for obtaining stack traceback data for multiple computing nodes of a massively parallel computer system

Patent Gooding, Thomas Michael ; McCarthy, Patrick Joseph

A data collector for a massively parallel computer system obtains call-return stack traceback data for multiple nodes by retrieving partial call-return stack traceback data from each node, grouping the nodes in subsets according to the partial traceback data, and obtaining further call-return stack traceback data from a representative node or nodes of each subset. Preferably, the partial data is a respective instruction address from each node, nodes having identical instruction address being grouped together in the same subset. Preferably, a single node of each subset is chosen and full stack traceback data is retrieved from the call-return stack within themore » chosen node.« less
Full Text Available March 2010
Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

Patent Archer, Charles Jens ; Musselman, Roy Glenn ; Peters, Amanda ; Pinnow, Kurt Walter ; Swartz, Brent Allen ; Wallenfelt, Brian Paul

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robinmore »« less
Full Text Available November 2010
Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

Patent Archer, Charles Jens ; Musselman, Roy Glenn ; Peters, Amanda ; Pinnow, Kurt Walter ; Swartz, Brent Allen ; Wallenfelt, Brian Paul

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allowsmore » greater flexibility in routing.« less
Full Text Available November 2010