More Accurate Semantics Defining Constraint Combination for Software Systems Having Client-Server Relationships

摘要

In this paper we present a new method of combining multiple precedence constraints for a single task to support software systems having client-server relationships. In these types of software systems, the combination of the precedence constraints must support the dynamic job structure of the system. Existing formalisms do not offer this support while accurately representing the desired behavior of the software. Additionally, the application of existing formalisms to software systems having periodic clients is ill defined. The new semantics presented here can be applied at the task graph level of description, support the underlying dynamic job structure of these systems, accurately represent the desired behavior of these software systems including those with periodic workloads, and easily map to commercial-off-the-shelf, asynchronous, event-driven, priority-based scheduling environments.