fig1 shows a multiprocessor computing system comprising a plurality of processors 10 - 12 interconnected for communication by a communication medium such as a bus 15 . each processor includes at least three functional units : an interface 20 which enables the processor to communicate across bus 15 according to the protocol of bus 15 , a central processing unit ( cpu ) 21 for executing processes including application and control processes , and a memory 22 which provides storage space for storing programs , data , and other information for use by processes assigned to the processor . for ease of reference , storage space within a memory will generally henceforth be referred to as memory . processors 10 - 12 include a host processor 10 , which serves as the administrative and control center for the overall system of fig1 . illustratively , host processor 10 is the 3b15 computer of at & amp ; t - information systems inc . processors 10 - 12 also include a plurality of adjunct processors 11 - 12 each of which performs system functions specified by host processor 10 . illustratively , processors 11 - 12 each comprise a member of the we ® 32100 family of microprocessors of at & amp ; t , with attached memory . bus 15 is , in this example , a high - speed packet bus , such as a version of the s / net bus described in an article by s . r . ahuja entitled &# 34 ; s / net : a high - speed interconnect for multiple computers &# 34 ; in ieee journal on selected areas of communications , vol . sac - 1 , no . 5 ( nov . 1983 ), and in u . s . pat . nos . 4 , 384 , 323 and 4 , 514 , 728 to ahuja . the system of fig1 operates under control of an operating system , illustratively a version of the unix ® operating system of at & amp ; t . the operating system is distributed across the processors 10 - 12 . distributed operating systems are known in the art . for example , an adaptation of the unix operating system to multiprocessors is described in an article by p . jackson entitled &# 34 ; unix variant opens a path to managing multiprocessor systems ,&# 34 ; in electronics , ( july 28 , 1983 ), pages 118 - 124 . program code of the operating system kernel 31 ( the memory - resident portion of the operating system ) is stored in memories 22 and executes as a series of processes on cpus 21 . other portions of the operating system are stored on disk ( not shown ) that is illustratively attached to host processor 10 or one of processors 11 - 12 acting as a file server , and are brought into memory 22 of processor 10 - 12 when needed . kernel 31 is replicated on each processor 10 - 12 and provides each processor 10 - 12 with the same basic operating system services . kernel 31 of each processor 10 - 12 may additionally provide unique services for its processor . included among the capabilities replicated on each processor 10 - 12 are memory management functions that perform allocation and deallocation of memory to / from processes assigned to the same one of the processors 10 - 12 on which the memory management function resides . further included in the operating system kernel is a process ( or a collection of processes ) referred to as a process manager 30 . process manager 30 is not replicated ; it is located on host processor 10 only . process manager 30 is a centralized control arrangement whose functions include the assignment of processes for execution to various ones of processors 10 - 12 . memory is considered to be a local resource within the system of fig1 . that is , memory 22 of a processor 10 - 12 is allocated and deallocated to processes locally at each processor 10 - 12 , by that processor &# 39 ; s kernel 31 which has substantially no knowledge of , or control over , memory 22 of any other processor 10 - 12 . however , processes are assigned for execution to processors 10 - 12 by process manager 30 , which must know how much memory is available for initial assignment to processes on each processor 10 - 12 , so that it can determine whether a particular processor 10 - 12 is capable of executing a given process . for this reason , memory management is implemented in the system of fig1 as follows . memory 22 of each adjunct processor 11 - 12 is logically divided into two portions : local memory 41 and global memory 42 . local memories 41 together form a local memory pool , while global memories 42 together form a global memory pool . local memories 41 of the local pool are managed by kernels 31 each one of which administers the local memory 41 of its associated processor , while the global pool is administered by process manager 30 in coordination with kernels 31 . since process manager 30 administers the global pool , it always knows the size of global memories 42 thereof . process manager 30 uses this information to decide whether a processor 10 - 12 has sufficient memory available for allocation to processes to support assignment of any particular process thereto . process manager 30 directly administers all memory 22 of host processor 10 , using memory management functions of kernel 31 of processor 10 to do so . process manager 30 administers memory 22 of host processor 10 in a conventional , uniprocessor , manner . it effectively views all memory 22 of processor 10 in the same manner as it views global memory of other processors . memory of each processor 10 - 12 is also logically divided into committed memory 46 and uncommitted memory 45 . uncommitted memory 45 is memory that has not been allocated for use to any process and is , therefore , free and available for allocation . committed memory 46 is memory that has been allocated by a kernel 31 for use to a process and is therefore considered to be in use and unavailable for allocation . on adjunct processors 11 - 12 , only local memory 41 may be committed . global memory 42 is always uncommitted ; this will be made clear further below . to avoid disadvantages of static and inflexible memory partitioning , process manager 30 and kernels 31 of processors 11 - 12 may cooperatively transfer memory between local memory 41 and global memory 42 of a kernel &# 39 ; s associated processor . memory is thus allowed to &# 34 ; migrate &# 34 ; between local memory 41 and global memory 42 , upon agreement between process manager 30 and kernel 31 of adjunct processor 11 - 12 to or from whose local portion 41 the memory is migrating . memory migration is graphically illustrated by fig4 . fig4 shows that any portion -- illustratively any page -- of memory 22 of an adjunct processor 11 - 12 is capable of being in any one of three states : allocated to global memory state 400 , allocated to uncommitted local memory state 401 , and allocated to committed local memory state 402 . the occurrence of various predetermined conditions , described further below and represented in fig4 by state transitions 403 - 409 , cause memory to migrate from state to state . process manager 30 keeps track of the global memory pool by means of global structure 50 . structure 50 is shown in greater detail in fig2 . structure 50 is a data structure -- illustratively shown in fig2 as a table -- stored in memory 22 of processor 10 . structure 50 includes a plurality of entries 211 - 213 each one of which corresponds to a different one of processors 10 - 12 , respectively . each entry stores information indicating the amount of memory included in global memory 42 of the associated processor . uncommitted ct . entry 211 associated with host processor 10 stores information indicating the amount of storage space included in unallocated memory 45 of processor 10 . illustratively , memory 22 of each processor 10 - 12 is logically partitioned into pages -- each one being 2048 bytes in size , for example -- and each global ct . entry 211 - 213 stores a count of the number of pages of memory included in unallocated memory 45 ( entry 211 ) or in corresponding global memory 42 ( entries 212 - 213 ). no particular pages are associated with the count , and the memory manager 30 does not care about the identity of pages -- it cares only about numbers of pages . hence , no information identifying any particular pages need be stored in entries 211 - 213 of global structure 50 . each adjunct kernel 31 manages its corresponding local memory 41 substantially in a conventional manner . however , for purposes of efficient administration of the division of associated memory 22 into local memory 41 and global memory 42 , each kernel 31 has its own tunable structure 51 . an illustrative tunable structure 51 is shown in fig3 . structure 51 is a data structure -- illustratively shown in fig3 as a table -- stored in memory 22 of processors 11 - 12 on which kernels 31 reside . structure 51 includes a plurality of entries 201 - 207 all pertaining to the memory 22 of the one adjunct processor on which it is located . global ct . entry 201 stores information indicating the amount of memory included in global memory 42 this memory is represented by state 400 in fig4 . local ct . entry 202 stores information indicating the amount of memory included in uncommitted local memory 45 . this memory is represented by state 401 in fig4 . initlocal entry 203 stores information indicating the amount of memory to be included in unallocated local memory 45 upon initialization of the processor ; remaining unallocated memory is included upon initialization in global memory 42 . minlocal entry 204 stores information indicating the minimum amount of memory that uncommitted local memory 45 should desirably contain . if and when the amount of memory in uncommitted local memory 45 subceeds the minimum specified by entry 204 , kernel 31 attempts to have additional storage space migrate to uncommitted local memory 45 from global memory 42 . this migration is represented by state transition 404 . mingtol entry 205 stores information indicating the minimum amount of memory that should desirably be migrated at any one time from global memory 42 to local memory 41 , to avoid &# 34 ; thrashing &# 34 ;. less memory than the minimum specified by entry 205 is migrated generally only when global memory 42 contains less memory than that minimum . maxlocal entry 206 stores information indicating the maximum amount of memory that uncommitted local memory 45 should desirably contain . if and when the amount of memory in uncommitted local memory 45 exceeds the maximum specified by entry 206 , kernel 31 migrates , with approval of memory manager 30 , some of that memory from local memory 41 to global memory 42 . this migration is represented in fig4 by state transition 403 . minltog entry 207 stores information indicating the minimum amount of memory that should desirably be migrated at any one time from uncommitted local memory 45 to global memory 42 , to avoid &# 34 ; thrashing &# 34 ;. less memory than the minimum specified by entry 207 is migrated generally only when migration of that much memory would reduce the amount of memory in uncommitted local memory 45 below the minimum specified by entry 204 . certain relationships exist among entries 203 - 207 , as follows . the amount of memory indicated by maxlocal entry 206 is greater than the amount of memory indicated by minlocal entry 204 . the amount of memory indicated by initlocal entry 203 is bounded by the amounts of memory indicated by maxlocal entry 206 and minlocal entry 203 . the difference between the amounts of memory indicated by maxlocal entry 206 and minlocal entry 203 is equal to or greater than the amount of memory indicated by mingtol entry 205 and by minltog entry 207 . and preferably , the amounts of memory indicated by minltog entry 207 and by mingtol entry 205 are not equal to each other . illustratively , if memory 22 is logically partitioned into pages , each entry 201 - 207 stores a count of some number of pages ; no information identifying particular pages need be stored in tunable structure 51 . in one illustrative embodiment of the system of fig1 wherein each memory 22 of processors 11 - 12 has one or two thousand pages of storage space and wherein the operating system kernel occupies approximately 200 to 500 pages of each memory 22 , entry 203 indicates 5 pages , entry 204 indicates 5 pages , entry 205 indicates 40 pages , entry 206 indicates 75 pages , and entry 207 indicates 50 pages . the unix operating system includes three process creation and termination primitives , which require allocation and deallocation of memory to / from processes . a fork primitive duplicates an existing process . the parent and child processes are identical in program -- they share the text portion of memory allocated to them . however , each duplicated process has its own data portion in memory , so the processes can execute independently of each other . an exec primitive transforms an existing process into a different process , by causing the process issuing the exec primitive to stop executing its present program and to begin executing a specified new program . hence , the old and the new process each must have its own text and data portions in memory . as part of the exec primitive call , generally there is specified the minimum amount of memory that must initially be allocated to the transformed , new , process . an illustrative implementation of the exec primitive in a multiprocessor system is described in application of t . p . bishop et al . entitled &# 34 ; virtual execution of programs on a multiprocessor system &# 34 ;, filed on even date herewith and assigned to the same assignee as this application . generally , one process creates a new process by means of execution of the fork primitive , immediately followed by execution of the exec primitive on the child process . an exit primitive terminates a process and releases -- deallocates -- its allocated memory . the exit primitive releases both the text and the data portions of a process not sharing the text memory portion with another process ; it releases only the data memory portion of a process sharing the text memory portion with another process . additionally , the unix operating system includes four system calls by means of which an existing process can dynamically , i . e ., during its execution , request that either additional memory be allocated thereto , or that some of the memory allocated thereto be deallocated . these system calls are brk , sbrk , shmctl , and an execlnup portion of the exec system call . arguments accompanying the first three system calls specify whether memory allocation or deallocation is being requested ( execlnup only deallocates memory ), and the amount of memory being requested . the brk and sbrk system calls are for memory dedicated to a process , while shmctl is a call for memory shared by a plurality of processes . execlnup is a call for deallocation of memory of an old process that has been successfully transformed into a new process . the activities relevant to this invention that are undertaken by memory manager 30 and kernels 31 in response to the above - described primitives and system calls are diagramed in fig5 - 9 . fig5 shows the system response to a fork call . since the parent and child processes will share a common text memory portion , they will be co - located on the same processor 10 - 12 on which the parent process is currently located . hence , no choice of process - to - processor assignment is required . for purposes of illustration , assume that the fork primitive is called by a process on adjunct processor 11 . in response to the fork call , at step 500 , kernel 31 of processor 11 determines the memory requirements of the child process , at step 501 . kernel 31 knows the amount of memory being used by any process on processor 11 , and the child process is merely a copy of the parent . hence , kernel 31 determines the memory requirements of the child from those of the parent . next , at step 502 , kernel 31 of processor 11 examines entry 201 of its tunable structure 51 to determine whether there is sufficient memory available in global memory 42 to satisfy that memory requirement . illustratively , it does so by comparing the memory requirement of the child process with global count entry 201 of its tunable structure 51 to determine whether global memory 42 includes the amount of memory required by the child process . if sufficient global memory 42 is not available -- the child process &# 39 ; memory requirement exceeds entry 201 -- kernel 31 proceeds to step 506 . if kernel 31 determines at step 502 that sufficient global memory is not available for the process to fork , kernel 31 fails the fork , at step 507 . the activities undertaken by kernel 31 at step 507 are conventional . but before failing the fork , kernel 31 performs the local - to - global memory transfer function of fig9 to transfer an amount of memory from uncommitted local memory 45 to global memory 42 , at step 506 . this transfer is represented by state transition 403 in fig4 . kernel 31 does so in anticipation of the failed fork being attempted again in the very near future , and tries to ensure thereby that the next fork attempt will not fail due to lack of sufficient global memory 42 . after failing the fork at step 507 , involvement of kernel 31 in the fork comes to an end , at step 508 . if kernel 31 determines at step 502 that sufficient global memory is available for the process to fork , kernel 31 requests host processor 10 to allow the parent process to fork , at step 503 . illustratively , kernel 31 does so by causing a packet carrying information to that effect to be sent over bus 15 to process manager 30 . the transferred information includes the memory requirement of the child process . kernel 31 then awaits a response from process manager 30 , at step 504 . the communication between processor 11 and processor 10 is kernel synchronous : processor 11 cannot dispatch any new process until processor 10 answers the request . it is logically a remote subroutine call . while requesting kernel 31 waits , it can handle local interrupts and also remote requests that it may receive , but no other process can be dispatched . process manager 30 responds to receipt of the fork request , at step 510 , by examining entry 212 of global structure 50 that corresponds to adjunct processor 11 to determine whether there is sufficient memory available in global memory 42 of adjunct processor 11 , at step 511 . process manager 30 must do this because entry 212 of global structure 50 and entry 201 of tunable structure 51 of adjunct processor 11 are maintained by separate control mechanisms 30 and 31 and hence may at certain times be out of synch and not have identical contents . if process manager 30 determines at step 511 that sufficient global memory is not available , it notifies adjunct processor 11 of its refusal to allow the fork , at step 515 . process manager 30 does this illustratively by causing a packet having information to this effect to be sent to processor 11 over bus 15 . involvement of process manager 30 in the fork thus ends , at step 516 . in response to receipt at step 505 of the refusal to allow the fork , kernel 31 fails the fork , at step 507 , and ends its involvement in the fork , at step 508 . if sufficient global memory is found to be available on processor 11 , at step 511 , process manager 30 decrements entry 212 of global structure 50 by the amount of requested memory , at step 512 , thereby initiating migration of that amount of global memory 42 of processor 11 to local memory 41 of processor 11 . this migration is represented in fig4 by state transition 407 . process manager 30 then updates information that it keeps on all processes within the system of fig1 to include the child process , at step 513 . the activities undertaken by process manager 30 at step 513 are substantially conventional , but also include storing of information regarding which processor 10 - 12 the child process is located on . process manager 30 then notifies adjunct processor 11 of grant of the fork request , at step 514 . illustratively , process manager 30 does so by causing a packet carrying information to that effect to be transmitted to adjunct processor 11 over bus 15 . involvement of process manager 30 in allocating memory to the child process is thus ended , at step 516 . kernel 31 of processor 11 responds to receipt of notice of the fork grant , at step 520 , by initially blocking local - to - global ( l - to - g ) memory transfers from being made , at step 521 . the transfers are blocked by means of incrementing a count semaphore 52 ( see fig1 ) associated with tunable structure 51 of processor 11 and located on processor 11 . count semaphores are well known in the art . kernel 31 then transfers the amount of memory required by the child process from global memory 42 to uncommitted local memory 45 , at step 522 , to complete the migration represented in fig4 by state transition 407 . kernel 31 accomplishes the transfer by decrementing entry 201 of its tunable structure 51 by the amount of requested memory , and incrementing entry 202 by the same amount . local ct . entry 202 of structure 51 may now exceed maxlocal entry 206 of structure 51 . this result would generally trigger a migration , represented in fig4 by state transition 403 , of some of uncommitted local memory 46 to global memory 42 . it was for the purpose of preventing this migration from occurring that kernel 31 blocked local - to - global memory transfers at step 521 . following the memory transfer at step 522 , kernel 31 allocates the requested amount of uncommitted local memory 45 to the child process , in a conventional manner , and decrements entry 202 of its tunable structure 51 to reflect this fact , at step 523 . this allocation migrates the allocated memory from uncommitted local memory 45 to committed local memory 46 . this migration is represented in fig4 by state transition 408 . the net result of the fork on memory 22 of processor 11 thus is the migration of the required amount of memory from global memory 42 to committed local memory 46 . this net migration is indicated in fig4 by state pseudo - transition 409 , which represents the net effect of state transitions 407 and 408 . kernel 31 completes the fork , at step 525 , in a conventional manner . activities performed by kernel 31 at step 525 include updating of records that indicate which processes are assigned to processor 11 , updating of records that indicate what memory is assigned to what process , and notifying the other processes affected by the fork , including the parent process , of the success of the fork . this being done , kernel 31 unblocks local - to - global memory transfers , at step 526 , by decrementing counting semaphore 52 . involvement of kernel 31 in the fork is thus ended , at step 527 . fig6 shows the system response to an exec call . the transformed process , referred to as the new process , may end up being located on either the same processor 10 - 12 or on a different processor 10 - 12 than the original process , referred to as the old process . a choice of process - to - processor assignment is therefore required , and must be made by process manager 30 . if the new process is not assigned by process manager 30 to the old process &# 39 ; processor , no memory need be allocated on the old process &# 39 ; processor as a consequence of the exec ; only the old process &# 39 ; memory need be deallocated . for purposes of illustration , assume that the exec primitive is called by a process on processor 12 . in response to the exec call , at step 600 , kernel 31 of processor 12 determines the memory requirements of the new process , at step 601 as was indicated above , the new process &# 39 ; initial memory requirements are specified directly by the exec call , for example . alternatively , the memory requirements are specified in an object file that is to be exec &# 39 ; d , and are picked up therefrom by kernel 31 next , kernel 31 of processor 12 requests process manager 30 to assign memory of a processor to the new process , at step 602 . illustratively , kernel 31 does so by causing a packet having information about the exec , including initial memory requirements of the new process , to be sent to host processor 10 . kernel 31 of processor 12 then awaits response from process manager 30 , at step 603 . once again , the communication between processor 12 and processor 10 is kernel synchronous . process manager 30 responds to receipt of the exec request , at step 610 , by selecting a processor 10 - 12 for the new process to run on and assigning the new process thereto , at step 611 . process manager 30 bases the selection on any suitable criteria applicable to the particular configuration of the system of fig1 and the use to which the system is being put . these criteria include , for example , which processor 10 - 12 has the computing capabilities and peripherals required by the new process , and the current load distribution of processes across processors 10 - 12 . one of the criteria used by process manager 30 is the availability of memory for assignment to the new process on a processor 10 - 12 . if sufficient memory is not available to a process , the process usually cannot execute . hence , as part of the process - to - processor assignment performed at step 611 , process manager 30 compares the initial memory requirement of the new process with a processor &# 39 ; s corresponding global ct entry in global structure 50 , and assigns the new process to that processor 10 - 12 only if and when global memory 42 available on that processor 10 - 12 at least equals the initial memory requirement of the new process . for purposes of illustration , assume that processor 11 is selected at step 611 . following selection , process manager 30 decrements entry 212 of global structure 50 by the amount of initial memory requirement of the new process , at step 612 , thereby initiating migration of that amount of global memory 42 of processor 11 to local memory 41 of processor 11 . this migration is represented in fig4 by state transition 407 . process manager 30 then notifies exec - requesting processor 12 of the assignment of processor 11 to the new process , at step 613 , illustratively by causing a packet to be sent to processor 12 over bus 15 . barring occurrence of any difficulties with performance of the exec , involvement of process manager 30 therein is ended thereby , at step 614 . in response to the notice of assignment of processor 11 to the new process , at step 620 , kernel 31 of processor 12 processes the exec , at step 621 , substantially in a conventional manner . the further processing of the exec at step 621 leads to either success or failure of the exec , as suggested by step 622 . if the exec fails , kernel 31 notifies process manager 30 of the failure , at step 623 . involvement of kernel 31 of processor 12 in the exec then ends , at step 626 . process manager 30 responds to receipt of the exec failure notification , at step 630 , by incrementing entry 212 of processor 11 by the initial memory requirement of the new process , at step 631 , thereby restoring that memory to global memory portion 42 of processor 11 and terminating the migration represented in fig4 by state transition 407 . involvement of process manager 30 in the exec thus ends , at step 632 . since the exec failed , assigned processor 11 has not been actively involved in performing the exec . returning to step 622 , if the exec succeeds , kernel 31 of processor 12 notifies kernel 31 of processor 11 of its assignment to the new process , at step 624 . illustratively , notification takes place by means of a packet being transmitted from processor 12 to processor 11 via bus 15 . the packet contains information about the exec . since the transformation was successful , the old process ceases to exist and hence its allocated memory must be deallocated . for this purpose , kernel 31 calls the execlnup function of fig8 at step 625 . involvement of kernel 31 of processor 12 in the exec then ends , at step 626 . kernel 31 of processor 11 responds to being notified of the exec , at step 650 , by initially blocking local - to - global memory transfers from being made , at step 651 , by incrementing count semaphore 52 . kernel 31 then transfers the amount of memory required by the new process from global memory 42 to uncommitted local memory 45 , at step 652 , in the manner described for step 502 . kernel 31 thus completes the migration represented in fig4 by state transition 407 . kernel 31 then allocates the requested amount of uncommitted local memory 45 to the new process , in a conventional manner , and decrements entry 202 of its tunable structure 51 to reflect this fact , at step 653 . this allocation migrates the allocated memory from uncommitted local memory 45 to committed local memory 46 . this migration is represented in fig4 by state transition 408 . the net result of the exec on memory 22 of processor 11 thus is the migration of the required amount of memory from global memory 42 to committed local memory 46 . this net migration is indicated in fig4 by state pseudo - transition 409 , which represents the net effect of state transitions 407 and 408 . kernel 31 otherwise completes the exec , at step 655 , in a conventional manner . activities performed by kernel 31 at step 655 include those described for step 525 . this being done , kernel 31 unblocks local - to - global memory transfers , at step 656 , by decrementing counting semaphore 52 . involvement of kernel 31 in the exec is thus ended , at step 657 . fig7 shows the system response to a system call by a process for dynamic allocation of memory . for purposes of this invention , this response is the same for the brk , sbrk , and shmctl allocation calls . since these calls comprise a request by a process assigned to and executing on a particular processor 10 - 12 for more memory on that one processor , no process - to - processor assignment is involved therein . assume that the call occurs on processor 11 . in response to the allocation call , at step 700 , kernel 31 of processor 11 determines the amount of memory being called for by the calling process , at step 701 . typically , the call will directly specify the required memory amount . kernel 31 then examines local ct . entry 202 to determine whether uncommitted local memory 45 includes an amount of memory suitable to satisfy the call . suitability may be determined on the basis of any desirable criteria , such as sufficiency of available memory . illustratively , kernel 31 then compares the required amount against entries 202 and 204 of tunable structure 201 , at step 702 , to determine whether the required amount would reduce uncommitted local memory 45 below the minlocal amount . if so , kernel 31 compares the required amount against entry 205 of tunable structure 201 to determine whether the required amount exceeds the mingtol amount , at step 703 . if the required amount does not exceed the mingtol amount , kernel 31 requests process manager 30 to transfer the mingtol amount of global memory 42 to local memory 41 , at step 704 . if the required amount does exceed the mingtol amount , kernel 31 requests process manager 30 to transfer the required amount of global memory 42 to local memory 41 , at step 705 . illustratively , kernel 31 makes the request by causing a packet to that effect to be sent from processor 11 to processor 10 via bus 15 . kernel 31 then awaits response to the global - to - local transfer request from process manager 30 , at step 706 . once again , the communication between processor 11 and processor 10 is kernel synchronous . process manager 30 responds to receipt of the global - to - local transfer request , at step 1100 , by examining entry 212 of global structure 50 that corresponds to adjunct processor 11 to determine whether there is sufficient memory available in global memory 42 of adjunct processor 11 to satisfy the transfer request , at step 1101 . if process manager 30 determines at step 1101 that the requested amount of memory exceeds the amount of global memory 42 , it decrements entry 212 of global structure 50 to zero , at step 1102 , thereby initiating migration of all available global memory 42 of processor 11 to uncommitted local memory 45 of processor 11 . this migration is represented in fig4 by state transition 404 . if process manager 30 determines at step 1101 that the requested amount of memory does not exceed the amount of global memory 42 , it decrements entry 212 of global structure 50 by the amount of requested memory , at step 1103 , thereby initiating migration of that amount of global memory 42 of processor 11 to local memory 41 of processor 11 . this migration is likewise represented in fig4 by state transition 404 . following decrementing of global memory 42 at step 1102 or 1103 , process manager 30 notifies adjunct processor 11 of how much global memory 42 is being transferred to local memory 41 , at step 1104 . process manager 30 illustratively does so by causing a packet carrying the information to be transmitted from processor 10 to processor 11 via bus 15 . involvement of process manager 30 in the global - to - local memory transfer thus ends , at step 1105 . kernel 31 of processor 11 responds to receipt of the notice of result of the transfer request , at step 710 , by transferring the indicated amount of memory from global memory 42 to uncommitted local memory 45 , at step 711 , to complete the migration represented in fig4 by state transition 404 . kernel 31 accomplishes the transfer in the manner described for step 522 . next , kernel 31 compares entry 202 of tunable structure 51 of processor 11 against the amount of memory required by the calling process to determine whether there is sufficient memory available in uncommitted local memory 45 to satisfy the requirement , at step 712 . if the required amount of memory exceeds the amount of uncommitted local memory 45 , kernel 31 fails the allocation call , at step 716 , in a conventional manner . kernel 31 then ends its response to the memory allocation call , at step 717 . if the required amount of memory does not exceed the amount of uncommitted local memory 45 at step 712 , kernel 31 allocates the requested amount of uncommitted local memory 45 to the process , in a conventional manner , and decrements entry 202 of its tunable structure 51 to reflect this fact , at step 713 . this allocation migrates the allocated memory from uncommitted local memory 45 to committed local memory 46 . this migration is represented in fig4 by state transition 405 . kernel 31 completes the brk , sbrk , or shmctl call , at step 715 , in a conventional manner . involvement of kernel 31 in allocating memory to the calling process thus ends , at step 717 . if it is determined at step 702 that the required amount of memory would not reduce uncommitted local memory 45 below the minlocal amount , kernel 31 proceeds to step 713 to perform the activities described above for steps 713 , 715 , and 717 . fig8 shows the system response to a system call by a process for the dynamic deallocation of memory , or to an exit primitive call , and to an execlnup call . for purposes of this invention , this response is the same for the brk , sbrk , shmctl , exit , and execlnup calls . since these calls comprise a request concerning a process assigned to a particular processor 10 - 12 to release some or all of the memory allocated to the process on that one processor , no process - to - processor assignment is involved therein . assume that the call occurs on processor 11 . in response to the call , at step 800 , kernel 31 of processor 11 determines the amount of memory being released , at step 801 . typically , a deallocation call will directly specify the amount of memory being released by the process . and in response to an exit or an execlnup call , the kernel 31 is able to determine the amount of memory allocated to a process from information that it stores about that process and every other process assigned to processor 11 . kernel 31 then deallocates the released amount of committed local memory 46 , in a conventional manner , and increments entry 202 of its tunable structure 51 to reflect this fact , at step 802 . the deallocation migrates the released memory from committed local memory 46 to uncommitted local memory 45 . this migration is represented in fig4 by state transition 406 . kernel 31 completes the brk , sbrk , shmctl , exit , or execlnup call , at step 805 , in a conventional manner . kernel 31 then performs the local - to - global transfer function of fig9 at step 804 , in order to transfer excess uncommitted local memory 45 to global memory 42 . kernel 31 otherwise completes the call , at step 805 , in a conventional manner , and ends its involvement in the deallocation , at step 806 . fig9 shows the local - to - global ( l - to - g ) memory transfer function that is performed on each processor 11 - 12 periodically -- illustratively once every second -- or as part of a fork or a deallocation call ( see step 506 of fig5 and step 804 of fig8 ). the purpose of this function is to transfer excess uncommitted local memory 45 to global memory 42 . assume that the l - to - g transfer function is being performed on processor 11 . upon commencing the function , at step 900 , kernel 31 of processor 11 checks the value of counting semaphore 52 to determine whether local - to - global transfers are blocked , at step 901 . if the value of semaphore 52 is not zero , it indicates that transfers are blocked , for example because a fork or an exec call is in progress ( see step 521 of fig5 and step 651 of fig6 ). kernel 31 therefore ends the function , at step 903 . if the value of semaphore 52 is found to be zero at step 901 , indicating that local - to - global transfers are not blocked , kernel 31 compares entry 202 of its tunable structure 51 with entry 206 to determine whether the size of uncommitted local memory 45 exceeds the maxlocal size , at step 902 . if the size of memory 45 is below the specified maximum , kernel 31 again ends the function of fig9 without performing any transfers , at step 903 . if the size of memory 45 is found to exceed the specified maximum at step 902 , kernel 31 checks entries 202 , 206 , and 207 of tunable structure 51 against each other to determine whether reducing size of uncommitted local memory 45 by the minltog amount would bring it below the specified maximum , at step 904 . if so , kernel 31 requests process manager 30 to transfer the minltog amount of uncommitted local memory 45 to global memory 42 , at step 905 . if not , kernel 31 requests process manager 30 to transfer from uncommitted local memory 45 to global memory 42 that amount which will reduce the size of memory 45 to the specified maximum , at step 906 . kernel 31 illustratively places the request to memory manager 30 by means of causing a packet having information to that effect to be sent from processor 11 to processor 10 over bus 15 . following placing of the request with memory manager 30 , kernel 31 awaits response therefrom , at step 907 . once again , the communication between processor 11 and processor 10 is kernel synchronous . in response to receipt of the request , at step 910 , process manager 30 increments entry 212 of global structure 50 by the amount specified in the request , at step 911 , thereby initiating migration of memory from state 401 of fig4 to state 400 , represented by state transition 403 . process manager 30 then notifies kernel 31 of processor 11 of this result , at step 912 , illustratively by sending an acknowledging packet to processor 11 over bus 15 . involvement of process manager 30 in the transfer then ends , at step 913 . in response to receiving from process manager 30 notice of the result of the request , at step 920 , kernel 31 of processor 11 transfers the indicated amount of memory from uncommitted local memory 45 to global memory 42 , at step 921 , thereby completing the migration represented in fig4 by state transition 403 . kernel 31 accomplishes the transfer by incrementing entry 201 of its tunable structure 51 by the indicated amount of memory , and decrementing entry 202 by the same amount . the local - to - global transfer then ends , at step 922 . of course , it should be understood that various changes and modifications to the illustrative embodiment described above will be apparent to those skilled in the art . for example , a global - to - local memory transfer may be performed periodically to maintain the size of uncommitted local memory 45 at or above a predetermined minimum . such changes and modifications can be made without departing from the spirit and the scope of the invention and without diminishing its attendant advantages . it is therefore intended that all such changes and modifications be covered by the following claims .