fig1 is a diagram illustrating a basic configuration of a portion of a storage system in which this invention may be implemented . fig1 illustrates two memories 101 , 102 and storage media 103 for storing data . typically storage media 103 is a hard disk drive . the memories are usually semiconductor memories , for example dram , sram , flash , etc . memory 101 provides a work area 104 used to handle ( or buffer ) read and write requests . work area 104 is often referred to as a cache memory . memory 102 maintains a bit map 105 and a pointer 106 . the bit map 105 provides a representation of the initialization status of the media , while the pointer 106 points to an initial portion of the media awaiting initialization . generally , in the operation of media such as hard disk drive 103 , it is necessary for the media to be initialized before it can store data . the initialization step often places sector , track or other information on the media to provide an identifying location for storage of information , and usually checks the status of each storage location on the media to assure that it is functional . initialization of the media in this manner is often termed “ formatting .” in the system depicted in fig1 , the media has been divided into a series of what are referred to herein as “ chunks ” 107 which are of arbitrary size . for example , each one of the chunks or storage regions within the storage area 107 can be a sector , a block , a 1 megabyte area , or some arbitrary amount of storage as defined by the storage system . within memory 102 , the bit map maintains a record of the initialization status of each chunk of the media . in a preferred embodiment , each bit within the bit map indicates whether that corresponding portion of the storage media has been initialized . thus , an external apparatus , for example a storage controller , can check the bit map and readily determine the initialization status of each chunk 107 of media 103 . while in the illustrated embodiment memory 102 is shown as storing only a bit map and a pointer , in some implementations it will store additional information , for example , a particular pattern of initialization data to be written . often , when media is formatted , a particular data pattern is written to the media to assure its proper functionality . for example , a pattern of alternating 1 &# 39 ; s and 0 &# 39 ; s might be written to the media . pointer 106 points to the next portion 108 of the media to be initialized the initialization is carried out an ordinary sequential operation . ( as will be explained below any arbitrary order may be employed .) the pointer 106 may also be used to indicate where a resume operation should begin if the initialization process is interrupted . this eliminates the need to reinitialize the entire disk if there is an external power failure or reset operation . in a preferred embodiment media 103 will be a volume which was defined by the storage controller in the storage system . fig2 is a diagram illustrating a first system configuration . the system of fig2 illustrates an overall storage system within which this invention may be situated . shown in fig2 is a host 201 , a storage controller 202 , and a series of disk drives 203 . the disk drives are usually arranged as a raid or similar type system . generally the host will send commands to the storage controller to write data to , or read data from , the disk drives 203 , to retrieve information at the request of some external computer ( not shown ). for example , the external computer may be a terminal at an airline reservations office and the disk drives may store the passenger and ticket information . typically the host and storage controller communicate with each other over a channel 204 , and there may be multiple storage controllers and multiple hosts , depending upon the particular system configuration . channel 204 can be a fibre channel , escon , scsi , ge or other channel implementation . host 201 and channel 204 are well known commercially available components . storage controller 202 itself includes a series of components such as memory 206 , memory 211 , channel controller 207 , disk controller 208 and an internal bus system 209 . the channel controller 207 and disk controller 208 regulate communications between the storage controller and the host and between the storage controller and the disk drives 203 over bus 205 . an architecture for a storage controller such as depicted may be found in u . s . pat . nos . 6 , 689 , 729 and 6 , 385 , 681 . also see u . s . pat . no . 6 , 236 , 528 which describes a method and apparatus for recording and reproducing using a dual head structure and u . s . pat . no . 5 , 109 , 500 which describes a disk drive control unit . the memory 206 within the storage controller 202 typically will comprise a non - volatile memory , for example , a flash memory . alternatively dram or sram or other memory may be employed with battery backup systems or the like to assure that information is not lost in the case of power failure . the memory 206 includes a cache memory 210 for buffering read and write operations , and a separate memory 211 to provide the initialization status bit map and functionality described in conjunction with fig1 . these memories are connected via internal bus 209 to the controllers 207 and 208 . busses such as bus 209 are well known , and may be implemented as a bus or as a switch . the disk drives 203 can be configured as a redundant array , for example , raid or in other configurations . the disk drives are connected via disk bus 205 , which can also be a fibre channel , a scsi bus , or an ata bus to provide interconnections . generally , storage controller 202 will translate between the logical disk addresses which the host 201 employs and the physical disk addresses used in the disk drives 203 . fig3 is a flow chart illustrating a preferred initialization process of this invention employed with the storage system shown in fig2 this process is implemented in situations in which the full array of disk drives 203 is not desired to be completely initialized before use of the system , i . e . situations wherein the disk drives are to be made available for use immediately . for example , the procedure may be employed when a new storage system , such as depicted in fig2 , is added to an existing operational larger system already in operation . the initialization process in fig3 begins with a step of receiving an initialization command at step 301 . this command may be a manual command , for example , as triggered by the administrator of the system using a management console or a remote console , or it may be an inbound command generated by an external computer system . examples of such external commands are the scsi command “ format unit ” or the ata command “ cfa erase sectors .” in response , the initialization process will typically write all 0 &# 39 ; s data to the storage , but other arbitrary data patterns also may be employed , depending upon the preferences of the administrator and / or the storage system design . at step 302 the initialization process begins . the first step is to initialize the control data stored in memory 211 . in this step all the bits in the bit map are set to indicate that none of the disk drives or chunks of disk drives reflected by that bit map have been initialized . at step 303 a report is generated that the initialization request has been received and acted upon . upon receipt of this report , the storage controller and the host know that this volume or storage subsystem can receive and process requests made to it . for example , reads and writes to the disk may begin . of course , the initialization operation itself has not been completed , however , from the point of view of the overall system employing this invention , the disk ( s ) is now in an operational condition . of course , in systems not employing the invention described herein , the notification of completion of initialization would not occur until after the process actually has been completed . steps 304 to 309 shown in fig3 describe the main procedure for initialization of the disk ( s ). at step 304 the storage controller 202 checks the bit map for the chunk which is to be initialized . if the appropriate bit in the bit map has been set , it means that this chunk has already does not need to be initialized . if that is the case , as shown by the “ yes ” line from block 304 , the storage controller skips initialization of the chunk and increments the pointer 308 to point to the next chunk , at which the initialization may continue . on the other hand , if at step 304 the chunk has been determined not to have been initialized , the process flow moves to step 305 where the chunk is locked . locking the chunk prevents it from being used by other processes . data would be lost if the chunk is initialized after being partially written or read . at step 306 the chunk is initialized , for example having the desired data pattern written to it . next , at step 307 that chunk is unlocked or released and available for use . after the pointer is incremented at step 308 , a test is made at step 309 as to whether all of the desired area has been initialized . if it has not , the flow returns back to the updated step 304 for the next chunk . on the other hand , if all of the desired area has been initialized , then the control data in memory 211 is appropriately revised and the process concluded . by performing the initialization in the manner depicted in fig3 , the initialization process may be done during low load time periods . for example , initialization may be performed only during late night hours , and suspended during the day . fig4 is a flow chart illustrating a preferred embodiment of the write process as it is carried out before the &# 39 ; system is completely initialized . after the system is completely initialized , this procedure may continue to be used , or operation of the system can return to normal write operation such as in the prior art . the write operation described in conjunction with fig4 is the operation in which user data is written to the storage volumes , as opposed to the writing of null data during initialization . the write operation begins step 401 by locking the chunk . if the write request is associated with more than one chunk , then , using the process shown in fig4 , the same locking operation is performed by the storage controller 202 for all of the chunks . as shown by step 402 , the next process is to determine whether the chunk has been initialized . if it has , then the process flow moves to step 408 and data is written into the location , and the chunk is released for normal operation thereafter at step 409 . the circumstance reflects an operation very similar to a normal write request in a conventional product — except as to the determination of whether the chunk has been initialized . should the chunk have been determined at step 402 not to be initialized , the process moves to step 404 where it is determined whether the data for the chunk has been updated . if it does require writing ( updating ), then a memory is allocated at step 403 for the write request . in this case , the amount of memory needed is approximately the size of the data to be written . if the chunk is neither initialized , nor updated , then the process flow moves to the step 405 in which the bit in the bit map is set for the chunk . at step 406 memory is allocated , and at step 407 , the chunk is initialized . finally , at step 408 data will be written to the chunk by being written to the cache memory in memory 210 . at a later time the data from the cache will copied onto the hard disk . once the data is written in the cache , the chunk is released from the write operation at step 409 . this operation is described further below . fig5 is a diagram illustrating a write operation when the write is directed to an address which is in the initialized area 107 of media 103 . using the process shown in fig4 in steps 401 , 402 , 403 , 408 and 409 , a write is first performed to cache memory 104 as shown by the arrow labeled “ 1 ” in fig5 . at a later time under a control of the storage controller , an operation “ 2 ” is performed to write that data from memory 101 into media 103 as illustrated . fig6 is a diagram illustrating the write process when the address is in an un - initialized area 108 of media 103 . as shown by the illustration , the first step is to prepare a chunk sized portion 104 within memory 101 to receive the user data shown by step 2 in fig6 . the data is then written into the chunk of the memory and held there . the portions of the memory 104 not holding user data are written at a suitable time with the desired initialization pattern for the media 103 . in a parallel operation , or later , a chunk sized portion of block 108 requiring initialization is initialized . this is performed using the process described above in fig4 , and the bitmap is made current ( step 3 ). at a convenient later time data is written from memory 101 into media 103 at the targeted location shown by step 4 . in essence , in fig6 , all of the chunk 104 in memory 101 is suitably written and then all of that chunk is copied into the media 103 to thereby store the initialization data pattern and the user data for the entire chunk . for example , the portions of chunk 104 outside the user data ( shown by cross - hatching ) will be written with all zeros or whatever pattern is desired . fig7 is a diagram which illustrates a detail of the write process when the request is to an un - initialized area , but a chunk which has already been updated from the host 201 . this illustration reflects the process of fig4 by steps 401 , 402 , 404 , 403 , 408 and 409 . the process shown in fig7 is in essence a normal write operation in which the desired data is written into cache memory 104 in a first step , then written into the media 103 in a second step at a later time . fig8 is a flowchart illustrating the read process . at the first step 801 the area from which data is to be read is locked . if more than one chunk is to be read , then all chunks to be read are locked as well . next at step 802 a determination is made as to whether the addressed area has been updated . if it has already been updated , then the storage controller stages data from the disk drive 203 as shown by step 804 . this returns the data to the storage controller and is essentially a normal read operation . on the other hand , if the area from which data is to be read has not be updated , then the storage controller returns initialized data at step 803 without staging it from the disk drive 203 . in other words , the initialized data pattern is returned . finally , as shown by step 805 , the locked area is unlocked and the process proceeds on to the next operation . fig9 is a diagram illustrating details of the read process when a read request is made to a region which has already been updated . these are steps 801 , 802 , 803 and 805 from fig8 . in this situation the read operation is a normal read operation with data being staged from the hard disk drive 103 and provided to the cache memory 104 in a first step . in a later step 2 the data is transferred from the memory 104 to the host . fig1 is a diagram illustrating the read process when a request is to an area which has not been initialized . this figure corresponds to processes 801 , 802 , 804 and 805 in fig8 . in this case the read operation is different from a normal read operation and the storage controller obtains from the memory just the initialization data pattern , i . e ., the typically all “ 0 ” data pattern . thus , only a single step is required after the data is loaded into the memory . fig3 through 10 generally describe background initialization . in other words , in the process described in conjunction with these figures , initialization is performed while the system is operating normally , at least from the perspective of the host . therefore the read and write operations appear to the host to be performed in the normal manner . in an alternative implementation referred to herein as “ initialize on write ” the initialization is triggered by receipt of a write request to a given area . initialization does not occur in the background , instead occurring only when writes are requested to particular chunks . initialize on write can be implemented with steps 301 , 302 and 303 in fig3 and with fig4 through 10 . steps 304 through 309 in fig3 are unnecessary . in the implementations described above , the storage controller has provided the apparatus for implementing the initialization methods discussed . continuing advances in processor power , however , have now resulted in some disk drives including internal processors . in these disk drives it is possible to off - load functions like initialization from the storage controller and move them down into the disk drives . this reduces overload on the storage controllers . such an implementation is shown in fig1 . as evident from that figure , the structure of the system is almost identical to that discussed above , except that memories 1101 and 1102 and bit map 1103 now all reside in the disk drive . as before , these memories may be volatile or non - volatile . because they reside in the disk drive , however , implementation of the memories may consist of using reserved regions of the hard disk drive media itself to store the bit map and control information . in some such implementations it is also possible for the host to connect directly to the disk drive without an intervening storage controller . the architecture of a disk drive suitable for use in this invention is described in several patents . see , e . g ., u . s . pat . nos . 6 , 236 , 528 , 5 , 109 , 500 ; and 6 , 236 , 528 . in implementations using disk drives with internal processors , the operating procedures are essentially the same as in the storage controller configurations already described . the disk drive 203 operates like a storage system 202 for the initialization procedure . media 1105 provides the control data . thus , for example , in procedure 308 , the disk drive 203 saves the pointer 106 by updating it onto the media . at procedure 405 the disk drive 203 saves the portion of the bit map 105 , which is also updated by being stored on the media 1105 . fig1 illustrates a preferred embodiment of one example for a data layout of the disk drive 203 in an implementation where the media stores the pointer and the bitmap . by storing the control data at the end portion of the disk 203 it will not require address changing , and consumes only a small portion of the media . in fig1 the bit map 1204 is illustrated , as well as the region 1203 where the pointer location , chunk size , and other desired information may be stored . as depicted , this region is at the end of the address range for the disk . for the depicted implementation a 25 k byte bit map is needed for a 200 gigabyte drive where one bit is used for each one megabyte sized chunk . fig1 is a diagram illustrating a third approach to the structure of the system . as already described , in the first approach a storage controller maintains the bit map and control data , while in the second approach the disk drives themselves maintain that information . the embodiment depicted in fig1 is a hybrid in which two bitmaps are used to reduce the number of write operations to maintain the control data . ( in the previous implementation write operations are required to store the control data on the hard disk drive media itself .) in fig1 the storage controller 202 maintains the control data , generally being advantageous because storage controller 202 is usually more reliable than disk drive 203 . thus the control data can be used despite a failure at the disk drive level . the disk drive 203 , however , acts as a disk drive 203 in the second configuration , but just does not save the control data onto the media 1304 . in this implementation the storage controller maintains bit map 105 and handles all of the requests to the volume being initialized . this makes it easy to snoop the request for the purpose of updating the bit map 105 , which can thereby be updated every time a write command is made to the volume being initialized . in addition , a pointer 106 allows a resume operation . this eliminates the need for re - initializing the entire disk if there &# 39 ; s a failure in the middle of the initialization procedure . of course , there may be such a difference between the delayed pointer and the storage controller 202 to require initializing the entire disk again . the information regarding the pointer can be made current using vendor unique commands or messages in the status of a request to the disk drive . another concern with the embodiment in fig1 is that the disk drive 203 in the storage controller 202 need to have the same set - up data , such as chunk size and disk size . this can be achieved by having a default setting , but then using an inbound protocol such as the scsi or ata “ mode set / select ” command . fig1 is a flowchart illustrating a resume operation . if a disk drive 203 fails it may not be usable again . in this case data in the disk drive needs to be reconstructed using redundant data , for example provided by the raid configuration for use and storage in a new disk drive . this is referred to as a resume operation . in fig1 a first step is to power on the disk drive at step 1401 . this will usually be done by the storage controller 202 . after it occurs the storage controller checks whether the disk drive 203 is available or not , as shown by step 1402 . if the disk drive is available , the control data such as the bit map and pointer are down loaded , and the initialization procedure is resumed at step 1404 . on the other hand , if the disk is not available at step 1402 , then the disk failure is reported and the procedure ends . fig1 is a diagram which illustrates the resume operation under normal conditions . in this case the bit map in the storage controller 202 is made current and will be the same as the bit map in the disk drive 203 . the pointers , however , will not necessarily agree with the storage controller 202 pointer sometimes being out of date compared to the pointer within the hard disk drive 203 . fig1 illustrates the situation after the failure occurs . as shown , the control data in the memory of the disk drive have been lost by the failure . the storage controller 202 , however , has maintained the control data in its memory , preferably a non - volatile memory . after the hard disk drive restarts , the storage controller 202 downloads the control data from the storage controller back to the hard disk drive 203 . this operation is shown by fig1 which illustrates the situation after the control data has been downloaded into the disk drive 203 . the bit map remains the same as before the failure , however , the pointer will be behind the true state of the operation . in the illustration , the pointer is two chunks behind , and it will be necessary for those two chunks to be re - initialized . meanwhile , the bit map keeps status information and the pointer will have reduced the initialization time , particularly if the disk was almost finished at the time of the failure . fig1 illustrates another approach to overcoming the initialization delay discussed herein . if the storage controller has local copy functionality it can copy data in the background . this enables the storage controller to use the “ local copy ” as a background initialization process . to begin , at least one volume which has been fully initialized is required . a local pair is created using the initialized volume a and non - initialized volume b . after volume b is accessible from the host , a copy operation from volume a to volume b can be done as a background operation . at the conclusion of that operation volume b will have been initialized to match volume a . the table below summarizes the various configurations and operations . the columns represent the three configurations discussed above , one in which the storage controller handles the initialization procedure , one in which the disk drive provides that function , and the hybrid approach . the rows of the table designate the locations for the various memories , the media , and the control of the initialization operation . each of the embodiments of this invention provides unique advantages in comparison to prior art apparatus and systems for initialization of storage systems . although preferred embodiments of the invention have been described above , the scope of the invention is defined by the following claims .