Abstract: Methods and apparatus for determining which of a plurality of physical blocks associated with a logical block is more recently associated with the logical block are disclosed. According to one aspect of the present invention, a method for resolving associations of a first physical block and a second physical block to a logical block associated with a non-volatile memory system includes obtaining a first identifier associated with the first physical block and obtaining a second identifier associated with the second physical block. The identifiers are compared to ascertain whether the first identifier indicates that the first physical block is more recently associated with the logical block. The method also includes completing an operation arranged to provide contents associated with the logical block to the first physical block when it is determined that the first identifier indicates that the first physical block is more newly associated with the logical block.

Abstract: Methods and apparatus for enabling a power up process of a non-volatile memory to occur efficiently are disclosed. According to one aspect of the present invention, a method for utilizing a memory system that has a non-volatile memory with at least one reserved memory area includes providing power to the memory system, initializing the non-volatile memory, and writing a first signature into the reserved memory area. The first signature is arranged to indicate that the memory system was successfully initialized. In one embodiment, the method also includes executing a power down process on the memory system, and writing a second signature into the reserved memory area which indicates that the power down process has been executed.

Abstract: Methods and apparatus for caching updates or new data associated with a logical block are disclosed. According to one aspect of the present invention, a method for processing contents associated with blocks of a non-volatile memory includes obtaining a first set of contents that is associated with a first group of logical pages associated with a first logical block, and writing the first set of contents into a memory area. The first set of contents is then written from the memory area into a first group of physical pages associated with a second physical block that is then mapped to the first logical block. In one embodiment, the memory area is one of a RAM cache and a physical block cache.

Abstract: Methods and apparatus for tracking defective blocks such that at least some of the defective blocks may be readily identified and tested for usability when desirable are disclosed. According to one aspect of the present invention, a method for identifying spare blocks within a non-volatile memory includes subjecting at least one defective physical block associated with the non-volatile memory to a test that is arranged to determine if the defective physical block is usable. The method also includes determining when the defective physical block passes the test, and identifying the defective physical block as a usable physical block when it is determined that the defective physical block passes the test.

Abstract: A communication network is arranged in a ring configuration of network elements (12) coupled by working spans (16) associated protection spans (18), with multiple rings sharing network elements (12a and 12b). A shared protection span (18ab) is coupled between pairs of shared network elements (12a and 12b). A matrix 28 in a shared network element (12a or 12b) can couple any channel from one of the incoming working spans or protection spans to any channel of the shared protection span (18ab).

Abstract: A communication network using a ring structure incorporates shared protection channels (22ab, 22bc, 22bd) to reduce costs in implementing protection spans. The shared protection network elements (12a, 12b, 12c, 12d) use a protocol of conventional messaging to integrate with traditional fully redundant network elements.

Abstract: A communication network is arranged in a ring configuration of network elements (12) coupled by working spans (16) associated protection spans (18), with multiple rings sharing network elements (12a and 12b). A shared protection span (18ab) is coupled between pairs of shared network elements (12a and 12b). A matrix 28 in a shared network element (12a or 12b) can couple any channel from one of the incoming working spans or protection spans to any channel of the shared protection span (18ab).

Abstract: A bun laner sorts buns into a predetermined number of lanes, for providing buns to a packaging unit. The bun laner detects when some lanes are filling faster than other and closes those lanes while the other lanes fill. A vacuum may be used to hold buns in a filled lane in order to close the lane. An optical detection unit may be used to determine when a bun has been stationary at a certain position in the lane for a predetermined amount of time.

Abstract: Protection paths are dynamically allocated in a wavelength-division multiplexed network including a plurality of nodes (12) coupled by communication links (14). A database (26) stores information regarding the status of the network including information associating channels in each link of the node to one or more protection paths and information associating channels in each link to respective working paths. Upon receiving a request for a new protection path to protect a defined working path, links are identified that have at least one shareable channel which may be shared between the new protection path and one or more existing protection paths, as are links that do not have a shareable channel but do have an unused channel that may be used for the new protection path. Costs are assigned to identified links where links that have at least one shareable channel are weighted differently than links that do not have a shareable channel. A protection path is determined using the found links based on the costs.

Abstract: A voice over IP (VOIP) network 8 includes a graphical proxy server 34 that allows “dumb” terminals (32) to act as SIP phones or H.323 phones; only the graphical proxy server (34) needs to support the underlying signaling protocol. The graphical proxy server (34) includes a graphical server (40) and a terminal management system (42). The terminal management system (42) handles the calls for each associated graphical terminal (32) and interacts with the graphical server (40) to provide a customized GUI for each graphical terminal (32) to display current call status. Each terminal (32) has a respective instance of a terminal controller program (56) in the terminal management system (42). The terminal controller for a terminal (32) controls the terminal's GUI responsive to incoming SIP messages directed to the terminal and generates SIP messages responsive to user interaction with the terminal's GUI.

Abstract: Methods and apparatus for managing erase counts in a non-volatile memory system. According to one aspect of the present invention, a method for initializing an erase count block in a system memory of a non-volatile memory system, the non-volatile memory system which includes a non-volatile memory involves allocating a plurality of pages within the system memory that are divided into a plurality of entries. Each entry of the plurality of entries has an associated block in the non-volatile memory. The method also includes identifying usable blocks which are suitable for use in accepting user data, and storing values in each entry which is associated with a usable block. Storing the values in each entry which is associated with a usable block substantially identifies the usable block as being usable.

Abstract: Methods and apparatus for performing wear leveling in a non-volatile memory system are disclosed. According to one aspect of the present invention, one method for processing elements included in a non-volatile memory of a memory system includes obtaining erase counts associated with elements and grouping a number of the elements into a first set. Each element has an associated erase count that substantially indicates a number of times the element has been erased. Grouping the number of elements into the first set includes selecting elements included in the plurality of elements which have the lowest associated erase counts of the erase counts associated with the plurality of elements. The method also includes storing the erase counts associated with the first set in a memory component substantially within a table.

Abstract: Methods and apparatus for enabling updates to data structures to be scheduled are disclosed. According to one aspect of the present invention, a method for operating a memory system with a non-volatile memory that includes a plurality of physical blocks and a plurality of data structures including an erase count block involves determining when contents of at least one data structure is to be updated. A request to update the contents of the data structure is queued or scheduled when it is determined that the contents are to be updated, and the request is executed when it effectively reaches the top of the queue.

Abstract: A healthcare information network provides a global database at a central information system which is synchronized with local databases at respective healthcare provider offices. The local database are used by the healthcare providers for confirming patient and healthcare information. As patient and health plan information is added, updated or deleted from any of the local databases, files are generated to update the global database. The proposed changes to the global database are verified and the global database is modified. Modification of the global database is memorialized in a repository which is then used to produce SQL commands to update each of the local databases so that they are synchronized with the global database.

Abstract: Methods and apparatus for splitting a single logical block into two or more physical blocks are disclosed. According to one aspect of the present invention, a method for associating a plurality of physical blocks of a non-volatile memory with a logical block that includes of logical block elements involves grouping the logical block elements into at least a first logical set and a second logical set. Data associated with the first logical set is provided to a first physical block, and data associated with the second logical set is provided to a second physical block.

Abstract: A network (10) includes a plurality of packet switches (12) for routing data packets. The packet switches (12) include input ports (16) for receiving packets and output ports (20) for sending packets. A matrix (18) passes packets from an input port (16) to a desired output port (20). Input ports (16) include one or more input queues (22) and output ports (16) include an output queue (24). Each input queue (22) is associated with an output queue (24). Control messages for passed between the input ports (16) and output ports (20) for controlling the acceleration of the rate of data transfer between associated input queues (22) and output queues (24).

Abstract: Methods and apparatus for maintaining an average erase count in a system memory of a non-volatile memory system are disclosed. According to one aspect of the present invention, a method for determining an average number of times each block of a number of blocks within a non-volatile memory of a memory system has been erased includes obtaining an erase count for each block that indicates a number of times each block has been erased. Once all the erase counts have been obtained, the erase counts are summed, and an average erase count that indicates the average number of times each block of the number of blocks has been erased is created by substantially dividing the sum by the number of blocks.

Abstract: Methods and apparatus for efficiently tracking the usage of physical blocks of non-volatile memory are disclosed. According to one aspect of the present invention, a method for maintaining a data structure that stores contents relating to the usage of physical blocks includes determining when to update the contents stored in the data structure, and obtaining a first differential erase count from the data structure when the contents are to be updated. The first differential erase count provides information on a number of times a first physical block has been erased. The method also includes determining a first actual erase count when the contents are to be updated. The first actual erase count is associated with a second physical block, and provides a number of times the second physical block has been erased. Finally, the method includes updating the first differential erase count when the contents are to be updated.

Abstract: A cross-connect switch (12) uses a matrix (40) for providing connection paths. The matrix (40) includes prioritization logic (42) for receiving connection requests from restoration state machines (50) (for changing connections responsive to line conditions) and an administrative processor (for changing connections responsive to operator commands). Connection requests from both the restoration state machines (50) and the administrative processor (52) are cached in FIFO memories (54). When a FIFO memory (54) stores one or more connection requests, the switching control circuitry is notified by a data ready signal. Logic (56) inhibits passing of the data ready signal from the FIFO memory (54) to the switching control (26) until all restoration connection requests have been serviced.