Abstract:
Disclosed are techniques for simulating a multiprocessor system is disclosed. Aspects of the present invention are based on such an observation that most memory accesses from different simulated processors do not conflict, and therefore the conservative policy for performing synchronization of all the memory accesses can waste a large amount of processing time. By identifying possibly conflicting memory accesses and only performing synchronization of these memory accesses, the synchronization cost can be reduced considerably. Since the function simulator is able to operate faster and to perform the same memory accesses, the possibly conflicting memory accesses can be identified by first executing the function simulator.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application claims priority under 35 U.S.C. §119 to Chinese Patent Application No. ______ filed Feb. 27, 2007, the entire text of which is specifically incorporated by reference herein. 
       BACKGROUND OF THE INVENTION 
       [0002]    The present invention relates to simulating a multiprocessor system, and especially relates to a simulating system and method for simulating a multiprocessor system. 
         [0003]    A cycle-accurate simulator is an important tool in evaluating the design alternatives of multiprocessor systems. As the number of processors increases, the conventional sequential simulation techniques show their drawbacks of extreme slow speeds. Parallel simulation techniques are natural extensions to the sequential simulation techniques for purpose of higher speeds. However, a challenge in parallel simulation is to ensure that memory accesses are performed in a globally consistent order, i.e., respective memory accesses are synchronized with the global progress (global time). For example, it is assumed that a parallel simulating system including host processors A and B is used to simulate behaviors of two processors a and b, wherein processor a is simulated by host processor A to write memory unit c, and processor b is simulated by host processor B to read memory unit c. Then the memory accesses must be synchronized in a globally consistent order, otherwise erroneous results will occur. Conventional solutions to this problem comprise: 
         [0004]    1) Per-cycle synchronization (see David A. Penry, Daniel Fay, David Hodgdon, Ryan Wells, Graham Schelle, David I. August and Daniel A. Connors, “Exploiting Parallelism and Structure to Accelerate the Simulation of Chip Multi-processors”, Proceedings of the Twelfth International Symposium on High-Performance Computer Architecture (HPCA), February 2006). In this technique, all the simulated processors are synchronized at beginning of each cycle. Since a cycle is the minimum time unit, the correctness can be guaranteed. However, the simulation costs are extremely high due to too fine granularity, hence considerably reducing the overall simulation speed. 
         [0005]    2) Barrier synchronization (see M. Chidister and A. George, “Parallel Simulation of Chipmultiprocessor architectures”, ACM Transactions on Modeling and Computer Simulation, 12(3):176-200, July 2002). In this technique, all the simulated processors are synchronized every t time units, the total time of which must be less than the memory access latency to ensure the correctness. However, since the memory access latency is usually cycle-level, the synchronization costs are still high. 
         [0006]    3) Memory access based on synchronization (see M. Chidister and A. George, “Parallel Simulation of Chipmultiprocessor architectures”, ACM Transactions on Modeling and Computer Simulation, 12(3):176-200, July 2002). In this technique, all the simulated processors are synchronized each time a memory access is to be performed. However, the statistics shows that 30% to 40% of all the instructions are memory access instructions. Therefore the time costs for synchronization is still high. 
         [0007]      FIG. 2  shows the general functional structure of a conventional cycle-accurate simulator. As shown in  FIG. 2 , a cycle-accurate simulator  20  usually comprises a fetching module  21 , a decoding module  22 , an issuing module  23 , a functional unit  24 , a writing back module  25 , a committing module  26 , a memory management unit (MMU)  27  and a memory hierarchical structure  28 . For example, the modules and units as shown in the cycle-accurate simulator  20  may be implemented in hardware and/or software. A multiprocessor system may be simulated in parallel through a time-shared or parallel architecture. An example of the conventional cycle-accurate simulator may be available from SimpleScalar LLC located at Ann Arbor, Mich., USA (http://www.simplescalar.com/). 
         [0008]    As compared to the cycle-accurate simulator, the function simulator is faster in speed due to less consideration on microcosmic architectural details, and is still able to achieve the same memory access effect.  FIG. 1  shows the general functional structure of a conventional function simulator. As shown in  FIG. 1 , a function simulator  10  usually comprises a fetching module  11 , a decoding module  12 , an execution module  13 , a committing module  14 , a memory management unit (MMU)  15  and a memory hierarchical structure  16 . For example, the modules and units as shown in the cycle-accurate simulator  10  may be implemented in hardware and/or software. A multiprocessor system may be simulated in parallel through a time-shared or parallel architecture. An example of the conventional cycle-accurate simulator may be available from SimpleScalar LLC located at Ann Arbor, Mich., USA (http://www.simplescalar.com/) 
       BRIEF SUMMARY OF THE INVENTION 
       [0009]    In view of the above, aspects of the present invention provide a simulating system and method for simulation the multiprocessor system in order for increasing the cycle-accurate simulator&#39;s execution speed. 
         [0010]    Aspects of the present invention are based on such an observation that most memory accesses from different simulated processors do not conflict, and therefore the conservative policy for performing synchronization of all the memory accesses can waste a large amount of processing time. By identifying possibly conflicting memory accesses and only performing synchronization of these memory accesses, the synchronization cost can be reduced considerably. Since the function simulator is able to operate faster and to perform the same memory accesses, the possibly conflicting memory accesses can be identified by first executing the function simulator. 
         [0011]    An exemplary aspect of the present invention provides a simulating system for simulating a multiprocessor system, comprising a function simulator and a parallel cycle-accurate simulator, said function simulator further comprises an access record extracting module for obtaining a memory access record of an instruction, each of parallel simulation units of said parallel cycle-accurate simulator further comprises a memory access control module for providing information for identifying an instruction causing an access to a memory hierarchy structure, and said simulating system further comprises a synchronization control system, the synchronization control system comprising: identifying means for identifying sets of instructions, memory accesses of each set being necessary to be synchronized, according to memory access records of the instructions provided by said access record extracting module when the execution of an executable program by said multiprocessor system is simulated in said function simulator; and synchronizing means for determining execution of instructions in one of said sets by said parallel simulation units according to said information provided by said memory access control module, so that the memory accesses of said instructions are performed in the order corresponding to global simulation times of the instructions, wherein said memory access control module is configured to hang up the execution of respective memory accesses before the completion of said synchronization, and resume the execution of the hung up memory accesses in response to a control from said synchronizing means. 
         [0012]    Another aspect of the present invention provides a method of performing memory access synchronization control in a simulating system for simulation a multiprocessor system, said simulating system comprising a function simulator and a cycle-accurate simulator, the method comprising steps of: simulating, through said function simulator, the execution of an executable program by said multiprocessor system, wherein memory access records of instructions are obtained; identifying sets of instructions where each of the sets need a synchronization according to said memory access records of said instructions; and simulating, through said parallel cycle-accurate simulator, the execution of the executable program by said multiprocessor system, wherein each of parallel simulation units of said parallel cycle-accurate simulator is configured to provide information for identifying an instruction causing an access to a memory hierarchy structure so as to determine execution of instructions in one of said sets by said parallel simulation units according to said information, so that the memory accesses of said instructions are performed in the order corresponding to global simulation times of the instructions, and wherein said parallel simulation units are configured to hang up the execution of respective memory accesses before the completion of said synchronization, and resume the execution of the hung up memory accesses in said order. 
         [0013]    A further aspect of the present invention further provides a computer program product embodying a computer program for executing the above method. 
         [0014]    According to embodiments of the present invention, since it is able to determine possibly conflicting memory accesses through the simulation in the function simulator, it is possible to avoid synchronization of all the memory accesses in the later simulation in the cycle-accurate simulator, thereby considerably reducing the synchronization costs and increasing the simulation speed. 
     
    
     
       BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS 
         [0015]    The accompanying drawings incorporated into the specification and forming a part of the specification illustrate embodiments of the present invention, and is used to illustrate the principle of the present invention along with the above general description and the following detailed description of the embodiments, wherein: 
           [0016]      FIG. 1  is a block diagram showing general functional structure of a function simulator; 
           [0017]      FIG. 2  is a block diagram showing general functional structure of a cycle-accurate simulator; 
           [0018]      FIG. 3  is a block diagram showing an example of general functional structure of a simulating system according to an embodiment of the present invention; 
           [0019]      FIG. 4  is a flow chart showing general procedure of a simulation method according to an embodiment of the present invention; 
           [0020]      FIG. 5  is a flow chart specifically showing a control procedure of memory access synchronization in step S 5  of  FIG. 4 . 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0021]    The technical solution of the present invention will be described by referring to specific embodiments. In the following description, some specific details are provided in order to provide a detailed explanation to the embodiments of the present invention. However, one skilled in the art knows that the present invention can also be implemented without these details. Further, there is no detailed description on the known structures relating to computers, processors and so on, in order to prevent from unnecessarily obscuring the description of the present invention&#39;s embodiments. 
         [0022]    It should be noted that, the sections for performing predetermined processing in the following embodiments may be implemented in hardware and/or software. For example, a specific processing may be performed using software and/or firmware executed on one or more processing modules. In general, a system for performing processing may include a more generic processing module and memory. The processing module can be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, micro-controller, digital processor, microcomputer, a portion of the central processing unit, a state machine, logic circuitry, and/or any device that manipulates the signal. The memory may be a single memory device or a plurality of memory devices. Such a memory device may be a read only memory, a random access memory, a floppy disk memory, magnetic tape memory, erasable memory, a portion of a system memory, and/or any device that stores operational instructions in a digital format. Note that when the processing module implements one or more of its functions to be a state machine or logic circuitry, the memory storing in the corresponding operational instructions is embedded within the circuitry comprising the state machine and/or other logic circuitry. For example, such a system may be a circuit design tool having a compilable memory unit to facilitate implementation of memories as described herein. 
         [0023]    Unless the context requires otherwise, throughout the specification and claims which follow, the word “comprise” and variations thereof, such as, “comprises” and “comprising” are to be construed in an open, inclusive sense, that is as “including, but not limited to.” 
         [0024]      FIG. 3  is a block diagram showing an example of general functional structure of a simulating system according to an embodiment of the present invention. As shown in  FIG. 3 , a simulating system  50  comprises a function simulator  10 ′, a cycle-accurate simulator  20 ′ and a synchronization control system  40  based on threads. 
         [0025]      FIG. 4  is a flow chart showing general procedure of a simulation method according to an embodiment of the present invention. 
         [0026]    As shown in  FIG. 3 , the function simulator  10 ′ comprises a fetch module  11 , a decoding module  12 , an execution module  13 , a committing module  14 , a MMU  15 ′ and a memory hierarchy structure  16 . The fetch module  11  is used to fetch an instruction to be executed and provide the instruction to the decoding module  12 . The decoding module  12  understands the semantic of the obtained instruction and transmits it to the execution module  13 . The execution module  13  executes the decoded instruction according to its semantic and writes back the new value of the modified memory unit through the MMU  15 ′, or writes back the new value of the modified register through the committing module  14 . The committing module  14  writes back the new value of the modified register and updates a program counter in order to make the fetch module  11  to fetch the next instruction. MMU  15 ′ maps the target virtual memory space to the target physical memory space, and this is necessary for all the memory-related instructions. The memory hierarchy structure  16  simulates the memory hierarchy structure of the target system, for example, a dedicated L 1  cache and a shared L 2  cache, and maps the target physical space to the main memory space of the simulator. 
         [0027]    As compared to the prior art function simulator, the function simulator in the present invention&#39;s embodiment comprises an access record extracting module for obtaining memory access records of instructions. In the following discussion about an example, the module is set in the MMU  15 ′. When the execution module  13  is executing the semantic of an instruction, if the semantic involves accessing the memory hierarchy structure  16 , the memory access is performed through the MMU  15 ′. In response to this, the access record extracting module associated with the MMU  15 ′ extracts information relating to the instruction, i.e., the memory access record, including an identification of the CPU for executing the instruction, an identification of the instruction, and the address of the accessed memory location. According to the types of the hardware/software architectures and operation systems which the function simulator implementation is based on, various ways may be adopted to implement the function of the above access record extracting module. For example, in case of adopting WINDOWS operation system, it is possible to utilize the hook mechanism to intercept events resulted from the memory access by the MMU  15 ′, thus obtaining the information of the memory access records. This module may also be set outside the MMU  15 ′. 
         [0028]    As shown in  FIG. 4 , the method of the present invention begins at step S 1 , where the execution of a program is simulated by the function simulator  10 ′, and the memory access records are obtained by the access record extracting module. 
         [0029]    As shown in  FIG. 3 , the synchronization control system  40  based on threads comprises a thread generator  41 , a thread database  42  and a synchronizing device  43 . The synchronization control system  40  may be implemented based on a computer. 
         [0030]    As shown in  FIG. 4 , when the function simulator  10 ′ completes the simulated execution of the executable program, then at step S 2 , the thread generator  41  of the synchronization control system  40  obtains the memory access records extracted by the function simulator  10 ′. The transmission of memory access records between the synchronization control system  40  and the function simulator  10 ′ may be implemented through direct communication or intermediate storage. Then at step S 3 , the thread generator  41  analyses the accumulated memory access records, wherein in view of the address of each accessed memory unit present in the memory access records, sets of instructions are found from the accumulated memory access records, where each set includes instructions involved the accesses from different processors to the same memory unit address. I.e., for that address, it is determined whether the accumulated memory access records show that different processors have accesses the memory unit indicated by that address. If so, all the memory access records including said different processors and the address are found out, and the instructions identified by these memory access records form one of such sets. There are various possible variations of the method for finding such sets. Then at step S 4 , the thread generator  41  stores the found sets in the thread database  42 . 
         [0031]    As shown in  FIG. 3 , the cycle-accurate simulator  20 ′ comprises several parallel simulation units  20 - 1  to  20 -n. Each parallel simulation unit simulates one processor, and its work flow is similar to one serial cycle-accurate simulator. Each parallel simulation unit maintains its own present simulation time. 
         [0032]    Each parallel simulation unit comprises a fetching module  21 , a decoding module  22 , an issuing module  23 , a functional unit  24 , a writing back module  25 , a committing module  26 , a MMU  27 ′ and a memory hierarchical structure  28 . The fetching module  21  is used to fetch an instruction to be executed and provide the instruction to the decoding module  22 . The decoding module  22  understands the semantic of the obtained instruction and transmits it to the issuing module  23 . The issuing module  23  allocates a temporary register, i.e., renamed register for the instruction, and allocates the register to a respective functional unit  24 . The functional unit  24  executes the instruction to be executed according to its semantic and writes back the new value of the modified memory unit through the MMU  27 ′, or writes back the new value of the modified register through the writing back module  25  and the committing module  26 . The writing back module  25  writes back the modified temporary register, i.e., the new value of the renamed register. The committing module  26  writes back the new value of the modified register modified by the instruction and updates a program counter in order to make the fetching module  21  to fetch the next instruction. MMU  27 ′ maps the target virtual memory space to the target physical memory space, and this is necessary for all the memory-related instructions. The memory hierarchical structure  28  simulates the memory hierarchy structure of the target system, for example, a dedicated L 1  cache and a shared L 2  cache, and maps the target physical space to the main memory space of the present simulating unit. As compared to the execution module in the function simulator, the issuing modules, functional units and writing back modules in the parallel simulation units in the cycle-accurate simulator may be considered as a more complicated pipeline  30 . 
         [0033]    As shown in  FIG. 4 , after step S 4 , at step S 5 , the above executable program is executed by respective parallel simulation units of the cycle-accurate simulator  20 ′. 
         [0034]      FIG. 5  is a flow chart specifically showing a control procedure of memory access synchronization in step S 5  of  FIG. 4 . 
         [0035]    As compared to the prior art parallel cycle-accurate simulator, the parallel simulation units of the cycle-accurate simulator  20 ′ according to the embodiment of the present invention may comprise a memory access control module. In the following discussion about an example, the module is implemented in the MMU  27 ′. 
         [0036]    As shown in  FIG. 5 , at step S 10 , the synchronizing device  43  obtains information for identifying the instruction causing access to the memory hierarchical structure  28  from the MMU  27 ′ ( i.e., memory access control module). When the functional unit  24  is executing the semantic of an instruction, if the semantic involves accessing the memory hierarchy structure  28 , the memory access is performed through the MMU  27 ′. In response to this, the information on the instruction, i.e., the identification of the instruction is provided from the MMU  27 ′ by the memory access control module associated with the MMU  27 ′. According to the types of the hardware/software architectures and operation systems which the cycle-accurate simulator implementation is based on, various ways may be adopted to collect and provide the identification information on the instructions. For example, in case of adopting WINDOWS operation system, it is possible to utilize the hook mechanism to intercept events resulted from the memory access by the MMU  27 ′, thus obtaining the identification information of the instruction which the memory access is based on. This memory access control module may also be implemented outside the MMU  27 ′. 
         [0037]    Alternatively, the above information for identifying instructions provided by the MMU  15 ′ and MMU  27 ′ may be based on instruction addresses in the executable program image. 
         [0038]    It should be noted that, the instruction identification information is provided to the synchronizing device  43  before the MMU  27 ′ actually performs the memory access. At this time, the memory access control module makes the actual memory access of the MMU  27 ′ being hung up, until the synchronizing device  43  completes synchronization processing at step S 11 . 
         [0039]    At step S 11 , when the synchronizing device  43  receives the instruction identification information from the MMU of a parallel simulation unit, compares it with the instruction identification information in respective sets stored in the thread database  42 , and if it matches with the instruction identification information in a set, identifies that the memory access to be performed by the MMU needs synchronization and performs synchronization control on the memory access. 
         [0040]    The synchronizing device  43  is in charge of maintaining a global simulation time of the parallel cycle-accurate simulator. The global simulation time equals to the minimum value among all the parallel simulation unit simulation times. The synchronizing device  43  may obtain the global simulation time by checking the present simulation times of all the parallel simulation units and finding the minimum value by comparison. 
         [0041]    As an example, when the synchronizing device  43  receives the instruction identification information from the MMU of a parallel simulation unit and determines that the execution of the corresponding instruction needs synchronization, the synchronizing device  43  firstly blocks the simulation work of the MMU for the present processor, waits for the virtual time of the processor to be equal to the global virtual time, and then notifies its MMU to resume the simulation. In the present parallel simulating system, the simulation work flow of the MMU is the same as that of the MMU in a serial simulator. Thus the synchronizing device has a function of adjusting the occurrence times of the MMU&#39;s simulation actions, but not altering the MMU&#39;s internal mechanism. 
         [0042]    For example, assume that a parallel simulator has three parallel simulation units, processors P 0 , P 1  and P 2 . The simulation time of P 0  is 100 seconds, the simulation time of P 1  is 101 seconds, the simulation time of P 2  is 102 seconds, and then the present global simulation time is 100 seconds. Assuming that the instructions executed by P 0 , P 1  and P 2  at this time are marked as needing synchronization in the thread database, their executions are hung up in the synchronizing device  43 . At this time, the synchronizing device  43  determines that P 1  and P 2  must wait because the simulation times of them are greater than the global simulation time, and P 0  may start its simulated actions by the MMU because its simulation time is equal to the global simulation time. Assuming that the time is 103 seconds when P 0  completes its simulated action by the MMU, the global simulation time increases at 101 seconds and the synchronizing device  43  determines that P 1  may also start its simulated action by the MMU, and P 2  still needs waiting. Further assuming that the time is 104 seconds when P 1  completes its simulated action by the MMU, the global simulation time becomes 102 seconds and the synchronizing device  43  determines that P 2  may also start its simulated action by the MMU. 
         [0043]    As an alternative way, when the MMU of a parallel simulation unit executes an instruction, the memory access control module firstly queries the thread database to see if the instruction needs synchronization. If its needs no synchronization, it is possible to directly perform the corresponding simulation operation by the MMU, and if otherwise, the memory access control module performs control so that the MMU of the parallel simulation unit autonomously blocks the execution of the instruction, and waits for its simulation time to be equal to the global simulation time so as to resume its corresponding operations. This manner is the so-called autonomous manner. In this situation, the synchronizing device only needs to maintaining the global simulation time, or the synchronizing device may be omitted, and the memory access control module of the MMU may autonomously obtain the global simulation time (for example, taking the minimum value among the present simulation times of all the MMUs as the global simulation time). 
         [0044]    Although the device for storing the sets is described as the thread database in the above, it is also possible to adopt other means known in the art for storing, and the storage function may be independent, or may also be integrated in the function simulator or cycle-accurate simulator. Similarly, the thread generator may also be integrated in the function simulator, and the synchronizing device may be integrated in the cycle-accurate simulator. 
         [0045]    Further, although in the above embodiments the function simulator, the cycle-accurate simulator and the synchronization control system are described as separated portions, one skilled in the art knows that they can be combined arbitrarily in specific implementations. Although in the above embodiments the parallel simulation units are described as separated portions, they can be implemented by using centralized or distributed parallel computing techniques in specific implementations. In addition, communications between respective units in the above embodiments may adopt wired or wireless communication techniques such as bus, network, shared memory, DMA, interruption, message, pipe, event, dedicated connection and so on. 
         [0046]    Although the criteria for identifying the set are determined as access to the same memory address by different processors in the embodiments, it is possible to design other identifying criteria according to specific implementations. Preferably, the identified sets should comprise at least one instruction that at least causes a write access. 
         [0047]    The above-disclosed subject matter is to be considered illustrative, and not restrictive, and the appended claims are intended to cover all such modifications, enhancements, and other embodiments that fall within the true spirit and scope of the present invention. Thus, to the maximum extent allowed by law, the scope of the present invention is to be determined by the broadest permissible interpretation of the following claims and their equivalents, and shall not be restricted or limited by the foregoing detailed description.