specific embodiments of the invention will now be described in detail with reference to the accompanying figures . like elements in the various figures are denoted by like reference numerals for consistency . in the following detailed description of embodiments of the invention , numerous specific details are set forth in order to provide a more thorough understanding of the invention . however , it will be apparent to one of ordinary skill in the art that the invention may be practiced without these specific details . in other instances , well - known features have not been described in detail to avoid unnecessarily complicating the description . in general , embodiments of the invention relate to a method and system for managing a failed memory module ( mm ) in a group of interleaved mms . specifically , upon detecting the failure of the mm , a memory region is vacated . subsequent access requests for the failed mm may be remapped to the vacated memory region . the remapping may be dependent on a barrier pointer , which tracks locations in the failed mm that have , and have not , been relocated to the vacated memory region . fig1 shows a system in accordance with one or more embodiments of the invention . as shown in fig1 , the system includes a processor ( 102 ), one or more buffer chips ( e . g ., buffer chip a ( 108 a ), buffer chip b ( 108 b ), buffer chip c ( 108 c ), buffer chip d ( 108 d )), and one or more memory modules ( mms ) ( e . g ., mm a ( 112 a ), mm b ( 112 b ), mm c ( 112 c ), mm d ( 112 d ), mm e ( 112 e ), mm f ( 112 f ), mm g ( 112 g ), mm h ( 112 h ), mm i ( 112 i ), mm j ( 112 j ), mm k ( 112 k ), mm l ( 112 l ), mm m ( 112 m ), mm n ( 112 n ), mm o ( 112 o ), mm p ( 112 p )). each component is described below . in one or more embodiments of the invention , the multiple mms use an interleaved memory addressing scheme . in other words , sequential addresses are located in different mms . each mm has a mm identifier that uniquely identifies the mm . one or more of the mms may be a dual in - line memory module ( dimm ). in one or more embodiments of the invention , the address specifies both the mm and the location ( e . g ., row ) within the mm . for example , the end bit segment may identify the mm ( i . e ., the end bit segment is the mm identifier ), while the remaining bits identify an address ( e . g ., a row or cache line ) within the mm . for example , suppose a hexadecimal ( hex ) address is 0a3 ( 0a3 in binary = 0000 1010 0011 ) in a system with 16 mms . in this example , since the example system has 16 or 2 4 mms , the end bit segment corresponds to the final four bits ( 0011 ). the mm is identified by the last four bits , while the row of the mm is identified by the remaining bits which are 0a . accordingly , address a03 is in mm number 3 , in row a0 . the following example illustrates how the memory is interleaved in the different mms based on the interleaved addressing scheme described above . suppose four mms form an interleaved memory and there are four write requests to four sequential hex addresses : 000 , 001 , 002 , 003 . the first write is allocated to row 00 of mm 0 , the second write is allocated to row 00 of mm 1 , the third write is allocated to row 00 of mm 2 , and the fourth write is allocated to row 00 of mm 3 . the four write requests are not allocated to the same mm when the four mms are interleaved . rather , as shown in the example , sequential addresses are located in different mms . a mm may fail at any time . following the failure of the mm , or upon determining that the mm will likely fail , it may be necessary to select a new set of addresses within the remaining ( i . e ., still operational ) mms , and relocate the content in the failed mm to this new set of addresses . in one or more embodiments of the invention , the new set of addresses is referred to as a region of memory , and the size of the region of memory ( e . g ., number of locations / entries ) is equal to the size of the failed mm . in one or more embodiments of the invention , processor ( 102 ) may include one or more memory controller units ( mcus ) ( e . g ., memory controller unit a ( 106 a ), memory controller unit b ( 106 b ), memory controller unit c ( 106 c ), memory controller unit d ( 106 d )). the mcus ( 106 a - 106 d ) include circuitry necessary to interpret a specified address and identify the corresponding entry / location in the appropriate mm that corresponds to the specified address . the mcus ( 106 a - 106 d ) also include circuity necessary to read data from and / or write data to the identified entry / location in the appropriate mm . in one or more embodiments of the invention , the mcus ( 106 a - 106 d ) include functionality to vacate a region of memory distributed across the multiple memory modules . the region of memory may be vacated following a determination that a mm has , or is likely to , fail . the region of memory may correspond to the top n addresses of the multiple interleaved mms , where n is the size of the failed mm . vacating the region of memory may include writing back the content stored in the region of memory to main memory or disk . in one or more embodiments of the invention , migration of the content in the failed mm to the region of memory is initiated after the top n addresses have been vacated . in one or more embodiments of the invention , the mcus are operatively connected to one or more buffer chips ( e . g ., buffer chip a ( 108 a ), buffer chip b ( 108 b ), buffer chip c ( 108 c ), buffer chip d ( 108 d )) via one or more links ( e . g ., link a ( 110 a ), link b ( 110 b ), link c ( 110 c ), link d ( 110 d )). in one or more embodiments of the invention , the buffer chips then connect to a set of two mms via one or more channels ( e . g ., channel a ( 114 a ), channel b ( 114 b ), channel c ( 114 c ), channel d ( 114 d ), channel e ( 114 e ), channel f ( 114 f ), channel g ( 114 g ), channel h ( 114 h )). alternatively , in one or more embodiments of the invention , the mcus may connect directly to the mms . in one or more embodiments of the invention , processor ( 102 ) includes the cou ( 104 ). the cou ( 104 ) is a hardware unit in the processor ( 102 ) that sees all ( or most ) memory traffic . the cou ( 104 ) includes a barrier pointer . the barrier pointer partitions all the addresses referring to locations in the failed mm into a set of migrated addresses and a set of un - migrated addresses . for example , every address “ above ” the address referenced by barrier pointer may be considered a migrated address . the content previously stored in these locations has been relocated to the vacated memory region . every address “ below ” the address referenced by the barrier pointer may be considered an un - migrated address . content in the un - migrated addresses has not yet been relocated to the vacated memory region . the address referenced by the barrier pointer may be referred to as the barrier address . the barrier address is considered an un - migrated address . in one or more embodiments , the barrier pointer is implemented as a register . in one or more embodiments , the cou ( 104 ) has functionality to receive an access request for any memory location within the mms . these requests may originate from a user application ( not shown ) executing on the processor ( 102 ). an access request may correspond to a read only access request , a write only access request , a read / write access request , or any request to manipulate or examine data in a mm . in one or more embodiments of the invention , the cou ( 104 ) includes functionality to identify / extract the mm identifier from the end bit segment of the address in the access request . the cou ( 104 ) further includes functionality to : ( i ) determine whether the extracted mm identifier belongs to the failed mm ; and ( ii ) compare the address with the barrier address referenced by the barrier pointer to determine whether the address in the access request falls within the set of un - migrated addresses or within the set of migrated addresses . further still , the cou ( 104 ) includes functionality to update / revise the memory address ( discussed below ) in the access request when the address falls within the set of migrated addresses . in one or more embodiments of the invention , when the access request is a write only or read / write request and the memory address specified in the access request is the barrier address , the cou ( 104 ) includes functionality to update / revise the memory address ( discussed below ) in the access request and to update the barrier pointer to reference the next un - migrated memory address of the failed mm . those skilled in the art , having the benefit of this detailed description , will appreciate that updating the barrier pointer may include incrementing or decrementing the barrier pointer . in one or more embodiments of the invention , a scrubber application ( not shown ) includes functionality to force the barrier pointer to update if such an update has not occurred within a predetermined time window . the scrubber application may be separate from the user application that is traditionally issuing the access requests . when the barrier pointer is updated to reference a new barrier address , the scrubber application initiates a timer or time window . if the barrier pointer continues to reference the same barrier address for a predetermined time window ( e . g ., 5 msecs , 10 seconds , 3 cycles , etc . ), the scrubber is triggered to issue a read request for the content ( i . e ., data value ) stored in the location referenced by the barrier address , and then issue a write request with the data value for the location reference by the barrier address . as discussed above , this will force the cou ( 104 ) to update the barrier pointer to reference another new barrier address . in one or more embodiments of the invention , the operating system ( 118 ) executes on the processor ( 102 ). the operating system ( 118 ) is configured to determine that a mm has failed or is likely to fail . for example , the operating system ( 118 ) may execute one or more error detection schemes on data values retrieved from the mm in response to access requests . if a high number of errors are detected ( e . g ., the number of errors exceeds a predefined thresholds , the number of errors is statistically significant , etc . ), the operating system ( 118 ) may deem the mm as failed or likely to fail . this triggers the memory region to be vacated and the subsequent migration of the content in the failed mm to the memory region . although fig1 shows 16 mms , 2 n mms may be used without departing from the invention . further , while fig1 shows a configuration of components , other configurations may be used without departing from the scope of the invention . for example , various components may be combined to create a single component . as another example , the functionality performed by a single component may be performed by two or more components . fig2 shows a flowchart in accordance with one or more embodiments of the invention . one or more of the steps shown in fig2 may be executed by the components shown in fig1 ( e . g ., operating system ( 118 ), cou ( 104 ), etc .). while the various steps in these flowchart are presented and described sequentially , one of ordinary skill will appreciate that some or all of the steps may be executed in different orders , may be combined or omitted , and some or all of the steps may be executed in parallel . furthermore , the steps may be performed actively or passively . for example , some steps may be performed using polling or be interrupt driven in accordance with one or more embodiments of the invention . by way of an example , determination steps may not require a processor to process an instruction unless an interrupt is received to signify that condition exists in accordance with one or more embodiments of the invention . as another example , determination steps may be performed by performing a test , such as checking a data value to test whether the value is consistent with the tested condition in accordance with one or more embodiments of the invention . initially , a failed mm in a group of mms is detected ( step 202 ). as discussed above , the failed mm may be detected by the operating system . specifically , the operating system may execute one or more error detection schemes on data items being retrieved from the mm in response to read or read / write requests from a user application . if the number of errors is statistically significant and / or exceeds a predetermined threshold , the mm is deemed as failed or likely to fail . the multiple mms use an interleaved memory addressing scheme . in other words , sequential addresses are located in different mms . in step 204 , a memory region distributed across the memory modules is vacated . this vacated memory region may eventually be the new storage location for the content currently stored in the failed memory module . in one or more embodiments of the invention , the memory region corresponds to the top n addresses of the addressing scheme , where n is the number of locations in the failed mm . for example , if there are 16 memory modules of equal sizes , the contents of the top 1 / 16 of the addresses ( i . e . highest addresses ) distributed across the memory modules may be returned to main memory . then the top 1 / 16 is free to allocate the addresses of the failed memory module as the size of the failed memory module is 1 / 16 ( i . e ., the failed memory module is one memory module out of 16 memory modules ). in step 206 , an access request for an address is received in accordance with one or more embodiments of the invention . the access request may be issued by a user application . the access request may correspond to a read request , a write request , or a read / write request . in step 208 , a memory module identifier ( id ) is identified from an end bit segment of the address in the access request in accordance with one or more embodiments of the invention . for example , in the case 16 memory modules , the module identifier ( id ) may be the last four bits of the address . in step 209 , it is determined whether the identified mm id matches the failed mm . when it is determined that the mm id matches the failed mm , the process proceeds to step 210 . when it is determined that the mm id does not match the failed mm , the process proceeds to step 214 . in step 210 , a determination is made whether the requested address is on the migrated side of the barrier address . as discussed above , the barrier pointer references the barrier address and separates / groups the set of addresses referring to locations in the failed mm into a set of migrated address and a set of un - migrated addresses . for example , the set of migrated addresses may be the addresses that are “ below ” ( i . e ., smaller than ) the barrier address referenced by the barrier pointer . in one or more embodiments , determining whether the requested address is on the migrated side of the barrier address includes comparing the address in the access request with the barrier pointer . when it is determined that the requested address is on migrated side of the barrier pointer , the process proceeds to step 212 . when it is determined that the requested address is not on the migrated side of the barrier address ( i . e ., the requested address is on the un - migrated side of the barrier address ), the process may proceed to step 214 , where the access request is sent to the mcus for interpretation . in step 212 , a revised memory address is generated . the revised memory address is for a location in the memory region that was previously vacated in response to the failure ( or predicted failure ) of the mm . in one or more embodiments of the invention , the updated memory address is generated by shifting the address , and concatenating the shifted address with a new bit segment . the shifting effectively discards the end bit segment from the address . the new bit segment has the same cardinality as the end bit segment . in one or more embodiments , the new bit segment is all ones ( e . g ., “ 1 ”). in step 213 , it is determined if the mm id of the updated address ( i . e ., end bit segment of updated address ) matches the failed mm . when it is determined that the mm id of the updated address matches the failed mm , the process returns to step 212 ( i . e ., the process is recursive ). if the mm id of the updated address does not correspond to the failed mm , the access request with the updated address is sent to one or more mcus for interpretation ( step 214 ). fig3 shows a flowchart in accordance with one or more embodiments of the invention . one or more of the steps shown in fig3 may be executed by the components shown in fig1 ( e . g ., operating system ( 118 ), cou ( 104 ), etc .). while the various steps in these flowchart are presented and described sequentially , one of ordinary skill will appreciate that some or all of the steps may be executed in different orders , may be combined or omitted , and some or all of the steps may be executed in parallel . initially , an access request is received ( step 302 ). the access request specifies the barrier address referenced by a barrier pointer . the access request may be received following step 209 , discussed above in reference to fig2 . as discussed above , the barrier address references a location in a failed mm . the access request may be issued by a user application and / or a scrubber application ( discussed above ). in step 304 , if the access request is a read - only access request or read / write access request , the access request with the address is sent to the mcus for interpretation in accordance with one or more embodiments of the invention . in other words , step 304 is optional and might not be used if the request is a write only access request . in step 306 , an updated address located in the vacated memory region is generated in accordance with one or more embodiments of the invention . the updated address may be generated using the same shifting and concatenation steps discussed above in reference to fig2 . in step 308 , the access request with the updated address is sent to the mcus for interpretation in accordance with one or more embodiments of the invention . in step 310 , the barrier pointer is updated to reference a new barrier address . the barrier pointer may be updated by incrementing the barrier pointer , decrementing the barrier pointer , or performing any logical operation to traverse each address ( e . g ., row , cache line ) within the memory module . in one or more embodiments of the invention , because of the interleaving , the barrier pointer is incremented by 2 k , where 2 k is the number of mms ( i . e ., the cardinality of mms ). in one or more embodiments of the invention , the cou ( 104 ) maintains a data structure ( e . g ., list , array , etc .) with all of the memory addresses in the failed mm . in such embodiments , the barrier pointer may be incremented ( or decremented ) by one to reference the next memory address in the data structure . fig4 a shows an example of the migration determination process . specifically , fig4 a shows a set of memory addresses ( mas ): ma 1 to ma n . assume , ma k is the barrier address referenced by a barrier pointer ( 404 ). accordingly , ma 1 through ma k − 1 are migrated ( 402 ), while ma k + 1 through ma n are un - migrated ( 406 ). now assume a first access request ( r1 ) is received for ma 2 . the address specified in r1 is compared to the barrier address ( ma k ) and it is determined that the specified address is on the migrated side of the barrier address . accordingly , r1 is revised ( e . g ., shift and concatenate ), and sent to the mcus for interpretation . the barrier pointer continues to reference ma k . now suppose a second access request ( r2 ) is received and specifies ma k . r2 is a write request . the address specified in r2 is compared to the barrier address ( ma k ). in response to a match , r2 is revised ( e . g ., shift and concatenate ) and sent to the mcus for interpretation . moreover , the barrier pointer is incremented to a new location , ma k + 1 , which becomes the new barrier address . fig4 b shows an example of the shifting and concatenating process . assume there exists 16 dimms : dimm 0 through dimm 15 . moreover , assume that dimm 5 ( 408 ) is predicted to fail . the cou receives an access request to access hexadecimal ( hex ) address 045 ( 410 ). hex address 045 is made up of 3 bit segments ( i . e . 5 hex is a first bit segment , 4 hex is a second bit segment , and 0 hex is a third bit segment ). the mm id is identified from the end bit segment , which in this example is 5 ( i . e ., first bit segment ). the mm id matches the failed mm . the hex address is shifted to the right ( i . e ., the first bit segment is discarded ) and an f hex value is concatenated to the left ( 412 ), resulting in hex address f04 ( 414 ). the mm id is now identified from the new end bit segment , which in this example is 4 ( i . e ., shifted second bit segment ). as the mm id does not match the failed mm , the access request is sent to the mcus for interpretation . this new address ( hex f04 ) corresponds to a location in the vacated memory region . fig4 c shows an example of the recursive shift and concatenation process . once again , assume there exists 16 dimms : dimm 0 through dimm 15 . moreover , assume that dimm 5 ( 416 ) is predicted to fail . the cou receives an access request to hex address 055 ( 418 ). hex address 055 is made up of 3 bit segments ( i . e . 5 hex is a first bit segment , 5 hex is a second bit segment , and 0 hex is a third bit segment ). the mm id is identified from the end bit segment which in this example is 5 ( i . e ., first bit segment ). the mm id matches the failed mm . because the mm id matches the failed mm , the hex address is shifted to the right ( i . e ., the first bit segment is discarded ), an f hex value is concatenated to the left ( 420 ) to output the hex address f05 ( 422 ). the mm id is one again identified from the new end bit segment , which in this example is 5 ( i . e ., second bit segment ). as the mm id once again matches the failed mm , the hex address is shifted to the right again and an f hex value is again concatenated to the left ( 424 ), resulting in hex address ff0 ( 426 ). the mm id is once again identified from the new end bit segment , which in this example is 0 hex ( i . e ., third bit segment ). as the mm id does not match the failed mm , the access request with the revised address of hex ff0 is sent off for interpretation . in the above example , the 16 dimms are configured in a fine - grain interleave mode . this means that sequential addresses reside in different dimms . for example , address 0 is in dimm 0 , address 1 is in dimm 1 , etc . in this configuration , the lowest order parts of the address are used as the dimm id , and the rest of the address is used as the row within the dram . if the lowest order bits of the address end up selecting the failed dimm , then it is desirable to remap the rest of address in a manner which distributes the contents of the failed dimm among the remaining dimms in a fine - grain manner . the address transformation is to do right shift until the first bit - segment drops out , while appending ones on the left . the choice of all - ones is because the memory locations which will be the new home of the failed dimm &# 39 ; s contents are at the highest addresses of the remaining dimms , and those locations have logic 1 as their left most address bit . now , the second bit - segment has become the lowest part of the address , and used for dimm select . however , this bit - segment may also match the failed dimm id . so the process of delete on the right and append 1 to the left continues until the rightmost part of the address does not match the failed dimm id . one or more embodiments of the invention may have the following advantages : the ability to de - configure an mm without de - configuring other mms ; the ability to vacate a memory region ; the ability to remap access requests to the vacated memory region using a recursive shift and concatenate technique ; the ability to use a barrier pointer to partition addresses corresponding to locations in the failed mm into migrated and un - migrates sets ; the ability to force the barrier pointer to update using a scrubber application ; etc . embodiments of the invention may be implemented on virtually any type of computing system regardless of the platform being used . for example , the computing system may be one or more mobile devices ( e . g ., laptop computer , smart phone , personal digital assistant , tablet computer , or other mobile device ), desktop computers , servers , blades in a server chassis , or any other type of computing device or devices that includes at least the minimum processing power , memory , and input and output device ( s ) to perform one or more embodiments of the invention . for example , as shown in fig5 , the computing system ( 500 ) may include one or more computer processor ( s ) ( 502 ), associated memory ( 504 ) ( e . g ., random access memory ( ram ), cache memory , flash memory , etc . ), one or more storage device ( s ) ( 506 ) ( e . g ., a hard disk , an optical drive such as a compact disk ( cd ) drive or digital versatile disk ( dvd ) drive , a flash memory stick , etc . ), and numerous other elements and functionalities . the computer processor ( s ) ( 502 ) may be an integrated circuit for processing instructions . for example , the computer processor ( s ) may be one or more cores , or micro - cores of a processor . the computing system ( 500 ) may also include one or more input device ( s ) ( 510 ), such as a touchscreen , keyboard , mouse , microphone , touchpad , electronic pen , or any other type of input device . further , the computing system ( 500 ) may include one or more output device ( s ) ( 508 ), such as a screen ( e . g ., a liquid crystal display ( lcd ), a plasma display , touchscreen , cathode ray tube ( crt ) monitor , projector , or other display device ), a printer , external storage , or any other output device . one or more of the output device ( s ) may be the same or different from the input device ( s ). the computing system ( 500 ) may be connected to a network ( 514 ) ( e . g ., a local area network ( lan ), a wide area network ( wan ) such as the internet , mobile network , or any other type of network ) via a network interface connection ( not shown ). the input and output device ( s ) may be locally or remotely ( e . g ., via the network ( 512 )) connected to the computer processor ( s ) ( 502 ), memory ( 504 ), and storage device ( s ) ( 506 ). many different types of computing systems exist , and the aforementioned input and output device ( s ) may take other forms . software instructions in the form of computer readable program code to perform embodiments of the invention may be stored , in whole or in part , temporarily or permanently , on a non - transitory computer readable medium such as a cd , dvd , storage device , a diskette , a tape , flash memory , physical memory , or any other computer readable storage medium . specifically , the software instructions may correspond to computer readable program code that when executed by a processor ( s ), is configured to perform embodiments of the invention . further , one or more elements of the aforementioned computing system ( 500 ) may be located at a remote location and connected to the other elements over a network ( 514 ). further , embodiments of the invention may be implemented on a distributed system having a plurality of nodes , where each portion of the invention may be located on a different node within the distributed system . in one embodiment of the invention , the node corresponds to a distinct computing device . alternatively , the node may correspond to a computer processor with associated physical memory . the node may alternatively correspond to a computer processor or micro - core of a computer processor with shared memory and / or resources . while the invention has been described with respect to a limited number of embodiments , those skilled in the art , having benefit of this disclosure , will appreciate that other embodiments can be devised which do not depart from the scope of the invention as disclosed herein . accordingly , the scope of the invention should be limited only by the attached claims .