Browse Prior Art Database

Method for Fast Initialization of Hardware

IP.com Disclosure Number: IPCOM000012857D
Original Publication Date: 2003-Jun-04
Included in the Prior Art Database: 2003-Jun-04
Document File: 2 page(s) / 45K

Publishing Venue

IBM

Abstract

Disclosed is a method to speed up hardware initialization of by saving scanned data, and verifying hardware/software configuration unchanged in order to reuse the saved init data during subsequent power-on initialization

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 51% of the total text.

Page 1 of 2

Method for Fast Initialization of Hardware

Saving scanned data will employ the following strategies to minimize the storage space and the time taken to save and/or retrieve them:

Save only one image of bit stream for rings with same data (saving space).

Algorithm to quickly determine if two rings have same bit data (saving storing time).

Format storing area for quick data retrieval (saving retrieval time).


1.


2.


3.

The scanned data are formed by a group of scan rings. Beside the bit data each ring has its own information to tell which chip it belongs to, its chip's position, the ring address, and the bit data length. In many instances the bit data is the same in rings across same chip type in a system. Therefore, only one image of the same data is saved.

A simple algorithm uses the eliminating method to quickly determine if the bit data are different between two rings. This algorithm will be used to check the data between the ring to be saved and another existing ring (of the same chip type in the storing area) to see if saving the new ring's bit data is necessary. With this algorithm, a ring that is likely having different data will be quickly identified and stored to reduce the scanned data saving time.

Obtain a new ring.

If there's a ring from another chip of the same type already saved and the existing

and the new ring have the same length, then go to 3. Otherwise, go to 4. Exclusive or the bit data of the two rings. If the result is equal to 0, then the new ring

has same data as the existing ring. Go to 5. The new bit data is different, create a new record and save it.

The new ring's bit data has already been saved.


1.


2.


3.


4.


5.

Because the bit data of the rings don't always have the same length, storing a ring's information and its bit data together (in the storing area) will create records of different ring-sizes which results in more complex code and time for data retrieval. To avoid this, the storing area will be divided into two sections. The first section will contain the information of all rings in same size records format. The second section stores all rings' bit data in a continuous bit stream. Each ring information record in the first section will contain the pointer to the location where the ring's bit data starts (in the second section) and its length. Each ring information record will be as follows:

Chip ID (Type) Chip Number Ring Address Ring Length Data location

To quickly retrieve the bit data for all rings of a desired chip the records are searched based on ChipID and Chip number. If ChipID and Chip Number are of the desired chip

then retrieve the ring info from the ring information record. From the record, retrieve th...