Method for sharing variable-grained memory of workstations by sending particular block including line and size of the block to exchange shared data structures

• US 5,933,598 A
• Filed: 07/17/1996
• Issued: 08/03/1999
• Est. Priority Date: 07/17/1996
• Status: Expired due to Term

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Scales, Daniel J., Gharachorloo, Kourosh
• Primary Examiner(s): Luu, Le Hien
• Application Number:
  US08/682,348
• Time in Patent Office: 1,112 Days
• Field of Search: 395/200.43, 395/200.46, 395/200.44, 395/200.48, 711/171, 711/173, 711/147, 711/148
• US Class Current: 709/216
• CPC Class Codes: G06F 9/5016 the resource being the memory

Abstract

In a distributed shared memory system, workstations are connected to each other by a network. Each workstation includes a processor, a memory having addresses, and an input/output interface to interconnect the workstations. A software implemented method enables data sharing between the workstations using variable sized quantities of data. A set of the addresses of the memories are designated as virtual shared addresses to store shared data. A portion of the virtual shared addresses are allocated to store a shared data structure as one or more blocks. The shared data structure is accessible by programs executing in any of the processors. The size of a particular allocated block can vary for different shared data structures. Each block includes an integer number of lines, and each line includes a predetermined number of bytes of shared data. Access information of a particular block is stored in the memory of a home one of the workstations. The access information includes the size of the particular block and an identity of workstations having a copy of the block.

Claims

1. In a computer system including a plurality of workstations, each workstation including a processor, a memory having addresses, and input/output interfaces connected to each other by a bus, the input/output interfaces connecting the workstations to each other by a network, a software implemented method for sharing access to data stored in the memories of the workstations, comprising the steps of:

designating a set of the addresses of the memories as virtual shared addresses to store shared data;

allocating a portion of the virtual shared addresses to store a shared data structure as one or more blocks accessible by programs executing in any of the processors, the size of a particular allocated block to vary with the size of the shared data structure, each block including an integral number of lines, each line including a predetermined number of bytes of shared data;

storing access information of a particular block of the shared data structure in the memory of a home of one of the workstations, the access information including the size of the particular block;

instrumenting the programs to check for instructions which access a target address of a particular line of the shared data structure; and

in response to receiving an access request from a requesting one of the workstations to access shared data at the target address of the particular line, sending shared data of a particular block including the particular line and the size of the particular block to said requesting workstation via the network to enable the workstations to exchange shared data structures stored in variable sized blocks via the network.

2. The method of claim 1 further comprising:

storing the access information in a directory maintained by the home workstation, the directory including a line entry for each line of the one or more blocks of the shared data structure, each line entry including the size the particular block including the line.

3. The method of claim 2 further comprising:

maintaining, in the line entry for each line of the particular block, an identity of a controlling one of the workstations, the controlling workstation last having an exclusive copy of the particular block including the particular line.

4. The method of claim 3 further comprising:

maintaining, in the line entry, a bit vector, the bit vector including one bit for each workstation, each bit to indicate whether a corresponding workstation has a shared copy of the particular block.

5. The method of claim 1 further comprising:

dynamically changing the size of the one or more blocks allocated for the shared data structure while the programs are executing.

6. The method of claim 5 further comprising:

maintaining a state table including a state entry for each line of the one or more blocks, each state entry to indicate a possible state of the line, the possible states being invalid, shared, and exclusive.

7. The method of claim 6 further comprising:

setting the state of each line of the one or more blocks to invalid before dynamically changing the size of the one or more blocks.

8. The method of claim 5 further comprising:

making the size of the one or more blocks equal to the size the line if the size of the shared data structure exceeds a threshold size.

9. The method of claim 1 wherein the number of lines of the one ore more blocks of a first shared data structure are different than the number of lines of the one or more blocks of a second data structure.

10. The method of claim 1 wherein the number of bytes in one of the lines of the first data structure in one program are different than the number of bytes in one of the lines of a second data structure in another program.