A shared resource scheduling method and system for distributed parallel processing

Abstract

The invention discloses a shared resource scheduling method and system used in distributed parallel processing. The method and system are based on a distributed operation mechanism. The shared resource scheduling units distributed in each processor subsystem are distributed in each shared Resource locks and resource request arbitration units are implemented. These distributed processing units communicate by sending messages (resource access requests/permissions) to each other through the switching unit. The shared resource scheduling unit in the processor subsystem uses virtual queue technology to manage all resource access requests in the data cache, that is, a special queue is specially opened for each accessible shared resource. Resource locks in shared resources are used to ensure the uniqueness of access to shared resources at any time. Resource locks have two states: lock occupation and lock release. The request arbitration unit in the shared resource uses a priority-based fair polling algorithm to arbitrate resource access requests from different processing nodes. The invention can effectively avoid the competition problem when each processing node accesses the shared resource, can also avoid the deadlock of the shared resource and the starvation problem of the processing node, and provides high-efficiency mutually exclusive access to the shared resource.

Description

technical field [0001] The invention belongs to the technical field of distributed information processing and parallel computing, and in particular relates to a shared resource scheduling method and system for distributed parallel processing. Background technique [0002] In many information devices or systems, when the amount of information processing in data acquisition, processing, calculation, display, output control, and communication processes is large, and there are certain speed requirements, distributed dual-processor or multi-processor technology is often used. , to process the information in parallel. In this kind of distributed parallel system, each processor subsystem often needs to share many common resources, for example, realize information exchange through time-sharing access to common memory, and may also share the same I / O interface or network port for data input output. [0003] Distributed parallel processing systems often have resource competition, wh...

AI Technical Summary

Problems solved by technology

However, in a distributed parallel processing environment, each processor subsystem (that is, each processing node of the system) adopts its own independent operating system and model structure. At any time, shared resources may face access competition among multiple processing nodes. problem, because the initiators of access events to shared resources do not have a unified management model to restrict their access

Images