Xerox Corporation

Terarecon, Inc.

Newbridge Networks Corporation

Christopher J Kappler

J Bryan Lyles

Hanspeter Pfister

Hugh C Lauer

Joseph B Lyles

Landis C Rogers

James M Knittel

Takahide Ohkami

Jan C Hardenbergh

William R Peet

Stephen R Burgess

Kenneth W Correll

Jay C Wilkinson

Stephen F Mason

Beverly J Schultz

A plurality of identical rendering pipelines are connected in parallel to read an array of voxels and to write an array of pixels. Each pipeline processes one voxel in one processing cycle of the pipelines. Each pipeline includes a plurality of serially connected different stages. The stages can include interpolation, classification, gradient estimation, illumination, and compositing stages. Interfaces connect identical stages in adjacent pipelines as one-way rings to communicate information associated with spatially adjacent voxels, and delay buffers connected parallel to particular stages communicate information associated with temporally adjacent voxels.

Volume rendering pipeline

A volume rendering integrated circuit includes a plurality of interconnected pipelines having stages operating in parallel. The stages of the pipelines are interconnected in a ring, with data being passed in only one direction around the ring. The volume integrated circuit also includes a render controller for controlling the flow of volume data to and from the pipelines and for controlling rendering operations of the pipelines. The integrated circuit may further include interfaces for coupling the integrated circuit to various storage devices and to a host computer.

Volume rendering integrated circuit

This invention provides rate shaping in per-flow output queued routing mechanisms for unspecified bit rate service.

Rate shaping in per-flow output queued routing mechanisms for unspecified bit rate service

Multiple rate sensitive priority queues reduce relative data transport unit delay variations in time multiplexed from output queued routing mechanisms.

Multiple rate sensitive priority queues for reducing relative data

Rate shaping is provided in per-flow queued routing mechanisms for statistical bit rate service.

Rate shaping in per-flow output queued routing mechanisms for

Rate shaping is provided in per-flow output queued routing mechanisms having output links servicing multiple physical layers.

Rate shaping in per-flow output queued routing mechanisms having output

Rate shaping is provided in per-flow queued routing mechanisms for available bit rate service. A traffic shaper in a packet switched communications system serially emits packets of time multiplexed flows in substantial compliance with individual network traffic contracts for the respective flows. The individual network traffic contracts include contracts which specify respective peak packet emission rates and associated peak rate tolerances for certain of the flows and which cause each of the flows to fall into mutually exclusive categories. The traffic shaper includes a queuing mechanism and a scheduling mechanism. The queuing mechanism organizes pending packets of active flows, including the certain flows, in respective queues in accordance with an oldest pending packet at head of queue order. The scheduling mechanism is coupled to the queuing mechanism for scheduling the packets of the active flows for emission. The scheduling mechanism includes a relatively high priority non-work conserving calendar queue, at least one relatively low priority work conserving queue, and another non-working conserving calendar queue of indeterministic priority relative to the high and low priority queues. The scheduling mechanism can also include a control mechanism for monitoring emissions from the high and low priority queues and for selectively descheduling packets scheduled on the high and low priority queues.

Growing community of inventors

Charlestown, MA, United States of America

Christopher J Kappler