×

Mechanism for efficient data access and communication in parallel computations on an emulated spatial lattice

  • US 6,205,533 B1
  • Filed: 08/12/1999
  • Issued: 03/20/2001
  • Est. Priority Date: 08/12/1999
  • Status: Expired due to Term
First Claim
Patent Images

1. A method of performing operations associated with a process occurring in at least one emulated lattice of at least one sector having lattice sites therein, the operations being performed by at least one processing node, the processing node associated with the at least one sector and including a memory, comprising:

  • associating each of the lattice sites with data in a data structure;

    partitioning the data at the lattice sites into sets of homologous bits, one from each data structure at each lattice site, to form corresponding bit-fields;

    partitioning the lattice sites in a shift-invariant manner into groups each including a plurality of lattice sites to form corresponding first site-aggregates, the data in each bit-field being correspondingly partitioned into first bit-aggregates;

    grouping together the first site-aggregates to form a plurality of second site-aggregates that partition the lattice sites in a shift-invariant manner;

    grouping together pluralities of the first bit-aggregates to form second bit-aggregates, each second bit-aggregate aggregating data associated with the lattice sites of a corresponding second site-aggregate;

    storing in the memory each second bit-aggregate as an addressable unit composed of separately addressable first bit-aggregates; and

    shifting data for at least one of the bit-fields within the at least one sector by addressing each second bit-aggregate in which a portion of the at least one of the bit-fields is stored, and addressing each of the constituent first bit-aggregates in the addressed each second bit-aggregate.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×