Scheduling in the operation-oriented paradigm

In the operation-oriented paradigm of parallel programming, processes form a client-server relationship among themselves. Servers provide operations which can be called by the clients. The order in which the operations are executed by the server depends on the requirement of maintaining the integrity of the service (synchronization), and offering an efficient and fair service to the clients (scheduling); these two criteria are orthogonal. Parallel programming languages often do not recognize this orthogonality, and sometimes tend to ignore the second criterion. The paper establishes the orthogonality among the different aspects of a process in the operation oriented paradigm and then proposes language constructs to express scheduling independently of other aspects.<<ETX>>