Scheduling Predicates
نویسندگان
چکیده
In this report we present a powerful new synchronisation mechanism called scheduling predicates These predicates there are no there exists and for all allow the programmer to schedule the order of execution of operations based on relative arrival times values of parameters and built in synchronisation counters Since many synchronisation problems are in fact scheduling problems these facilitate much simpler and clearer solutions to such problems We also show that this mechanism subsumes and uni es the existing declarative synchronisation mech anisms used in some object oriented languages and extends the number of problems for which a purely declarative approach is possible
منابع مشابه
A Theorem-proving Approach to Job- Shop Scheduling
In this paper we formulate the job-shop scheduling problem in the theorem-proving framework described in 12, 5]. In the theorem-proving framework two kinds of predicates are allowed: ordinary predicates, deened by if-and-only-if-deenitions 3], and primitive predicates, \deened" by axioms that can be thought of as integrity constraints. The framework seeks to unify constraint logic programming (...
متن کاملThe Interlanguage of Persian Learners of Italian: a Focus on Complex Predicates
This paper aims at investigating the acquisition of Italian complex predicates by native speakers of Persian. Complex predication is not as pervasive a phenomenon in Italian as it is in Persian. Yet Italian native speakers use complex predicates productively; spontaneous data show that Persian learners of Italian seem to be perfectly aware of Italian complex predicates and use this familiar fea...
متن کاملA Systems Engineering Approach for Constructing Certifiable Real-Time Distributed Systems
In this paper, we present a systems engineering methodology for constructing certifiable realtime distributed systems. In the proposed approach, an architectural and algorithmic solution to an application problem is designed by considering the “weakest” models including the weakest asynchronous computational model and multimodal arrival model. Furthermore, timeliness properties are described us...
متن کاملDataflow Predication Aaron
Predication facilitates high-bandwidth fetch and large static scheduling regions, but has typically been too complex to implement comprehensively in out-of-order microarchitectures. This paper describes dataflow predication, which provides per-instruction predication in a dataflow ISA, low predication computation overheads similar to VLIW ISAs, and low complexity out-of-order issue. A twobit fi...
متن کاملTowards Global Scheduling and Register Allocation Using Predicated Execution
This paper presents an approach for register allocation and scheduling which relies on three main ideas: global optimization, solution space exploration and on-the-fly generation of a symbolic state machine. To allow global optimizations while preserving semantics, the traditional notion of control dependence is replaced by the notion of predicate. In our approach, predicates are used not only ...
متن کامل