Abstract: The present application is directed to employing prefetch to reduce write overhead. A device may comprise a processor and a cache memory. The processor may determine if data to be written to the cache memory comprises multiple cache lines wherein at least one of the cache lines will be fully written. If the data comprises at least one cache line to be fully written, then the processor may perform a “prefetch” wherein the processor may write dummy data to sections of the cache memory corresponding to the data to be written in full cache lines. The processor may then write actual data to the sections containing the dummy data without the processor first having to verify ownership of the sections. Any remaining data that will not be written in full cache lines may then be written to the cache memory utilizing a standard write transaction.

Abstract: The present application is directed to employing prefetch to reduce write overhead. A device may comprise a processor and a cache memory. The processor may determine if data to be written to the cache memory comprises multiple cache lines wherein at least one of the cache lines will be fully written. If the data comprises at least one cache line to be fully written, then the processor may perform a “prefetch” wherein the processor may write dummy data to sections of the cache memory corresponding to the data to be written in full cache lines. The processor may then write actual data to the sections containing the dummy data without the processor first having to verify ownership of the sections. Any remaining data that will not be written in full cache lines may then be written to the cache memory utilizing a standard write transaction.

Abstract: A method of performing transactions in a code management software system. The method includes starting a transaction, determining existence of a state table for a workspace, creating the state table for the workspace if the state table does not exist, updating the state table for the workspace, and comparing a state table of a first workspace with a state table of a second workspace. A list of names of different files is created from the comparison of the state table of the first workspace and the state table of the second workspace. The list of names of different files is accessed during a match files phase. The state table is updated if the workspace is modified prior to an end of the transaction. The code management system is accessed using a graphical user interface.

Abstract: A mechanism for controlling access to workspaces includes a repository for storing the workspaces, an interface having a set of methods that can be invoked to access the repository, and a server having at least one server object which implements the interface.

Abstract: A method for propagating changes from a local workspace that is accessible by a client to a remote workspace that is accessible by a server includes generating a request from the client to the server to create a temporary workspace, obtaining selected data from the local workspace and requesting the server to store the selected data in the temporary workspace, and updating the remote workspace with the data in the temporary workspace. To propagate changes from the remote workspace to the local workspace, the method includes creating a temporary workspace that is accessible by the client, requesting the server to send selected data from the remote workspace, storing the selected data in the temporary workspace, and updating the local workspace with the selected data in the temporary workspace.