text: embodiments of the present invention are described for use in an fpga . the network switch according to the present invention provides for communications between nodes or modules programmed into the logic of an fpga . the network switch is also programmed into the logic . further , the fpga memory can be configured to meet the parameters defined for the switch . although the following description of embodiments of the present invention are described with respect to particular components of an fpga , it is understood that other integrated circuits with on board programmable logic and memory can be programmed to include a network switch according to embodiments of the present invention . for reference , fig1 shows one configuration of components of an fpga that can be configured to include a network switch according to the present invention . the fpga of fig1 includes a large number of different programmable tiles including mgts 101 , configurable logic blocks ( clbs 102 ), brams 103 , input / output blocks ( iobs 104 ), configuration and clocking logic ( config / clocks 105 ), digital signal processing blocks ( dsps 106 ), specialized input / output blocks ( i / o 107 ) ( e . g ., configuration ports and clock ports ), and other programmable logic 108 such as digital clock managers , analog - to - digital converters , system monitoring logic , and so forth . the fpga can also include a dedicated processor blocks ( proc 110 ). each programmable tile includes a programmable interconnect element ( int 111 ) having standardized connections to and from a corresponding interconnect element in each adjacent tile . therefore , the programmable interconnect elements taken together implement the programmable interconnect structure for the illustrated fpga . the programmable interconnect element ( int 111 ) also includes the connections to and from the programmable logic element within the same tile , as shown by the examples included at the top of fig2 . for example , a clb 102 can include a configurable logic element ( cle 112 ) that can be programmed to implement user logic plus a single programmable interconnect element ( int 111 ). a bram 103 can include a bram logic element ( brl 113 ) in addition to one or more programmable interconnect elements . typically , the number of interconnect elements included in a tile depends on the height of the tile . in the pictured embodiment , a bram tile has the same height as four clbs , but other numbers ( e . g ., five ) can also be used . a dsp tile 106 can include a dsp logic element ( dspl 114 ) in addition to an appropriate number of programmable interconnect elements . an iob 104 can include , for example , two instances of an input / output logic element ( iol 115 ) in addition to one instance of the programmable interconnect element ( int 111 ). as will be clear to those of skill in the art , the actual i / o pads connected , for example , to the i / o logic element 115 are manufactured using metal layered above the various illustrated logic blocks , and typically are not confined to the area of the input / output logic element 115 . in the pictured embodiment , a columnar area near the center of the die ( shown shaded in fig1 ) is used for configuration , clock , and other control logic . horizontal areas 109 extending from this column are used to distribute the clocks and configuration signals across the breadth of the fpga . some fpgas utilizing the architecture illustrated in fig1 include additional logic blocks that disrupt the regular columnar structure making up a large part of the fpga . the additional logic blocks can be programmable blocks and / or dedicated logic . for example , the processor block proc 110 shown in fig1 spans several columns of clbs and brams . note that fig1 is intended to illustrate only an exemplary fpga architecture . the numbers of logic blocks in a column , the relative widths of the columns , the number and order of columns , the types of logic blocks included in the columns , the relative sizes of the logic blocks , and the interconnect / logic implementations included at the top of fig1 are purely exemplary . for example , in an actual fpga more than one adjacent column of clbs is typically included wherever the clbs appear , to facilitate the efficient implementation of user logic . fig2 shows a block diagram of components of a memory switch 200 constructed in an fpga according to embodiments of the present invention . the memory switch 200 provides for communication between transmit cells 202 1 - n ( tx cell ) and receive cells 204 1 - n ( rx cell ). the cells are formed by the transmitters and receivers in nodes or modules programmed into the fpga . the transmitter of one node communicates by sending data in the form of packets , cells or data - grams through the network switch 200 to a receiver of another node . data from the transmit cells 202 1 - n are provided to input ports 208 of the network switch 200 , while data is directed from the output ports 210 of the network switch to receive cells 204 1 - n . the transmit cells and receives cells can be connected to the ports of the network switch 200 either directly using a crossbar connection configuration , or connected through a bus to the ports 208 of the switch . the network switch architecture according to the present invention allows the number of input ports and output ports to be scalable by programming the fpga resources to form an n × n port memory , where n is an integer . the size n × n of the network switch can be chosen depending on design requirements to optimize the tradeoff between operation speed and use of the fpga resources . data from the input ports 208 are provided to a lookup and classification module 212 as well as to a write controller 214 . the lookup and classification module 212 removes the header from the packet of data , and does necessary error correction checking such as a cyclic redundancy check . from the header information , the lookup and classification module 212 further generates a pointer to identify the storage location in a cell buffer 220 where the packet will be stored . the pointer and classification information is then passed on to the class queue 216 . the write controller 214 operates to write or stripe data in a defined manner into memory sections that are provided in a cell buffer 220 . the write controller 214 breaks up the packets of data into individual bytes , the size of the data bytes depending on how the cell buffer 220 is divided up . the write controller 214 stripes the individual bytes in locations of the cell buffer 220 in multiple access segments of the cell buffer 220 in a manner to avoid data collisions on read in as well as read out . more details of pointer generation and striping of data are described subsequently . the cell buffer 220 is formed using bram memory devices of the fpga . the cell buffer 220 is formed by subdividing the bram memory into input sections . in one embodiment , the number of input sections , or columns , of the bram is set as a multiple of the number of input and output ports n . for example , the number of memory sections may be 2n , for the n × n port memory switch . class queue 216 helps manage or locate data stored in the cell buffer 220 based on the storage of pointers . the pointers are stored in a timed manner to eliminate the need for addressing of data stored . timed storage of pointers also eliminates the need for link lists that are typically used to address groups of pointers within the class queue . elimination of addressing eliminates the need for logic from the fpga that will be used for decoding of address information . addressing logic and link lists can use up to 90 % of the available logic in an fpga just to make a memory switch . elimination of addressing can further reduce the amount of memory space required for storage of the class queue information . the class queue 216 also maintains a priority for the data stored in the cell buffer 220 based on an ordering of pointers . the class queue 216 includes a number of rows for storage of pointers . each row of the class queue 216 corresponds to a class of data . data pointers are then stored in rows of the class queue 216 according to class . further details of the class queue are described subsequently . a scheduler 222 determines the order for readout of data . the scheduler 222 can be selected according to user needs . for example , the scheduler 222 can be a round - robin type , a first - in - first - out type , or other type known in the art . the scheduler 222 determines the next class of data to be read out and with the selection obtains one or more pointers from the class queue 216 . the scheduler 222 then passes the pointers obtained from the class queue 216 to a read controller 224 for readout of the cell buffer 220 . the scheduler 222 , otherwise , operates independent from the read controller 224 . the read controller 224 reads or un - stripes the data from the cell buffer . the read controller uses the pointer information passed from the class queue 216 by the scheduler 222 to determine from which ports to read the data . the data once read out and concatenated back together in packet form is provided to an output port 210 identified by the one or more pointers . from the data output port 210 , the data packets are the provided to the appropriate one of the receive cells 204 1 - n . fig3 illustrates a pipeline structure established using the memory switch of fig2 . pipelining of the data enables a timed data storage used by embodiments of the present invention , as opposed to addressing . clock cycles from arrival of data at the input ports 208 are used to determine how the write controller 214 does striping as well as how the class queue 216 locates data pointers . pipelining also enables buffering of data so that required memory space for data storage is minimized . data is effectively buffered in the pipeline steps separate from the cell buffer 220 pipelining also provides a guaranteed latency for data to travel through the network switch . the switch on a cell - by - cell basis provides upper and lower bounds on the latency through the pipeline . in one embodiment , state machines running in modules of the network switch at every stage in the pipeline provide their state information to a central state register ( not shown in fig2 - 3 ). the sum - total of all the states forms the state of the switch and also provides information as to which stage in the pipeline a cell is passing through or is in at any given instant . as illustrated in fig3 , the pipeline begins with pipeline step 301 with transmission of cells from one of the transmitters into an input port 208 of the network switch 200 . in step 302 , data in the form of packets or cells is provided from the input port 202 to both the look up and classification module 212 and write controller 214 . as indicated above , during step 302 the lookup and classification module 212 removes the packet header , determines a class , does error checking , and prepares pointer information for the class queue 216 . the write controller 214 during step 302 subdivides the data packets into defined bytes and stripes data into individual input sections of the cell buffer 220 . in step 303 pointers are stored in appropriate locations in the class queue 216 , and data bytes are stored into individual sections of the cell buffer 220 . in step 304 the scheduler 222 determines next data to be read out and provides the appropriate pointers from the class queue 216 to the read controller 224 for locating data to read out of memory . in step 305 , the read controller 224 passes the data from the cell buffer 220 to an output port 210 of the network switch 200 . in one embodiment , two bytes are transferred in each pipeline state per clock cycle , and two bytes of data will take 32 clock cycles to transfer through the pipeline . fig4 illustrates a method for striping data into memory ports according to some embodiments of the present invention . fig4 shows one example of how the cell buffer 220 can be divided up into sections , labeled sect 1 - 4 . in fig4 , the number of input ports n = 4 is the same as the number of sections sect 1 - 4 . to avoid data collisions , however , the number of sections sect 1 - 4 may need to be an integral multiple of the number of ports n . data from the input ports are divided up into bytes , labeled p 1 - 4 for storage in the rows of the memory sections sect 1 - 4 from the write controller 214 . the byte sections stored in the memory sections sect 1 - 4 are then concatenated back together on readout by the read controller 224 for sending to the output ports . the word received at an input port for breaking up in the write controller 214 will be subdivided into an integral multiple of the total number of bytes of the word for storage in sections sect 1 - 4 . for example , if the total word received at a port is 4 bytes , and each word is subdivided for storage in a section to 2 byte units , then each stored element p 1 - 4 will be 2 bytes . with bytes stored being ½ the total word received at a port , the effective dequeuing rate can be twice that of the enqueuing rate of the system . in this one example , the internal clock frequency of the cell buffer can be twice that of the system clock . if , however , the number of input ports and the number of cell buffer sections match , as with the case shown in fig4 , then no difference from input buffer pipeline cycles will be required . the write controller 214 controls data striping to align the data bytes across the sections sect 1 - 4 of the dual port memories making up the cell buffer 220 . the write controller 214 functions as a circular shifter that can implement a left shift or a right shift depending on the striping scheme desired . fig4 illustrates a right shift scheme . the striping scheme can be described with reference to fig4 by observing the alignment of the data portions p 1 - 4 from the input ports with the sections sect 1 - 4 of the cell buffer 220 on a clock cycle basis . the dashed line illustrates how bytes from input port 1 are striped into the cell buffer 220 according to this striping scheme . assume a setup in an n port switch where n = 4 , as shown in fig4 , and that data is continually received at all ports at the same time at each clock cycle . at the start time , to , the input port 1 bytes ( p 1 ) are aligned with memory section sect 1 , input port 2 bytes ( p 2 ) are aligned with memory section sect 2 , and so forth . at time t 1 , input port 1 bytes ( p 1 ) are aligned with memory section sect 2 , input port 2 bytes ( p 2 ) are aligned with memory section sect 3 , and so forth . looking at fig4 , one can see the alignment of the input port bytes p 1 - 4 to the memory sections every clock cycle by 1 to the right . this continues in a circular fashion with the write controller 214 striping the data from a cell across the sections of the cell buffer 220 . the cell buffer 220 internally is configured to take care of the start address of every stripe that starts every number of bit cycles that a cell or packet is broken into for storage . the number of bytes to a word stored is determined in one embodiment by the series to parallel conversion speed of the port transceiver . the network switch designer , however , can program to set the number of bytes stored in each cell buffer section . the striping in a right or left shift manner is provided so that no cell buffer section will have consecutive column entries from the same port . otherwise , readout collisions can occur . in fact , the right or left shifting will provide a number of column entries in a section before data from the same port packet will be stored again . in the configuration shown in fig4 , for example , with right shifting by 1 the memory section sect 1 will only store bytes from port 1 ( p 1 ) every four clock cycles . fig5 illustrates how the number of cell buffer sections can be increased so that striping can further minimize readout collisions . in fig5 , the buffer memory 220 is subdivided into 2n , or 8 sections , where the number of ports n = 4 . with added sections or rows , collisions from one column will be less likely to occur . although shown with 2n sections in fig5 , the number of sections can be expanded to 3n , 4n , and so forth depending on desired design requirements to reduce collisions . fig6 and 7 show an example of an alternative striping technique that can be used to store data segments in sections of the cell buffer 220 to minimize readout collisions . data is provided in sections of the cell buffer 220 from n = 8 different input ports , labeled 1 - 8 . successive port data is stored in consecutive column segments . a total of 2n columns are shown . after the last ( or nth ) column segment is stored , n + 1 null segments are stored in successive sections of the cell buffer 200 before data from the first port is again stored . once the last column in a row is reached , data is simply wrapped around back to the first column of the next row . although storage for n = 8 ports are shown in fig6 and 7 , with n + 1 null pointers used between storage of point segments , it is understood that a different number of ports or null pointers between ports could be used depending on desired design requirements . fig8 illustrates storage of data pointers into the class queue 216 . the class queue 216 stores data pointers provided from the write controller 214 . data pointers are provided from the write controller 214 according to class to a controller 601 of the class queue 216 , as shown . the controller then directs the pointers into the individual class queues 602 1 - n according to the time period when they were received . there are at most n null pointers that can be stored per class queue , and this is used to align the pointers in such a way as to represent time as described in more detail to follow . the scheduler 222 provides a read signal to the class queue controller 601 to read the data pointers from the class queues 602 1 - n . the data pointers are stored in the class queues and read out in a first come first serve ( fcfs / fifo ) manner . fig9 illustrates how null pointers are used to indicate timing of storage of the data pointers . as shown , for a time t 0 a pointer p 1 is stored for class 1 . a null pointer n is then stored in subsequent cycles t 1 - 4 when no data is received . a null pointer is also provided by the controller 601 into class queues if a data error occurs as determined from the cyc check and data from a port must be discarded . this provides for a non - blocking pipeline , since otherwise once data is discarded readdressing would be needed . continuing with reference to fig9 , the pointer p 3 is provided to the queue for class 2 , and arrives at time t 1 , so null pointers n are stored at other times when no data is received for class 2 . a pointer p 2 is received for both t 2 and t 4 in class 3 , but otherwise null pointers are provided by the controller 601 . pointers and null pointers are similarly provided in queues for other classes according to embodiments of the present invention . data to be read out as determined by the scheduler 222 from a class queue can be easily located in the cell buffer 220 by the read controller 224 . the dequeuing of data is done in parallel from all the class queues , i . e . on every hardware clock cycle the scheduler provides the number of pointers making up a packet . for a random access memory where data is not striped into the memory , one would need a number to indicate the sequencing of cells . a linked list type structure would be required that would allow one to de - queue cells associated with the same packet in sequence . this would simply reassembly of data packets from the cell buffer memory segments , but the class - queue would have to store the entire link list associated with the cells belonging to a packet of a particular class . the controller would then have to dynamically manage n link lists at a minimum every switching cycle . although the present invention has been described above with particularity , this was merely to teach one of ordinary skill in the art how to make and use the invention . many additional modifications will fall within the scope of the invention , as that scope is defined by the following claims .