In this paper we offer an approach for reasoning about resource allocation and scheduling in multiagent systems that takes into consideration the costs of preempting an agent from its current task. We apply our methodology to the motivating medical application of allocating doctors to patients in hospitals during mass casualty incidents and demonstrate noticeable improvements in performance (ge...

This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of preemption, and can be applied to the modelling of the semantics of highlevel parallel programming languages with preemption-related features. As an illustration, the paper gives an application to the modelling of a mult...

Causation is defined recursively: event e is the cause of condition φ in context c iff e is the only sufficient cause of φ in c, and removing e from c either removes φ from c or results in some other event causing φ. A logical language is then defined, in which it is possible to represent and reason about actual and counterfactual events in evolving partial contexts. Axiomatic theories of event...

Now-a-days Hardware and Software are developing very high level. But with the increasing of SOC designs, Hardware dependent Software (HDS) become Critical. In Previous work they introduced abstract RTOS modeling, which exposes dynamic scheduling effects early in the system design. However, such models insufficiently capture preemption. But the accuracy of preemption depends on the granularity o...

This paper develops an iterative genetic fuzzy logic controller (GFLC) model to adaptively control the transit-preemption signal (TPS) along an arterial with consideration of the traffic flows from all approaches. Two transit-preemption strategies, green extension and red truncation, are incorporated with simultaneous, progressive, and alternative coordinated signal systems. Compared with the s...

We consider polynomial-time algorithms for partitioning a collection of non-preemptive or restricted-preemption tasks among the processors of an identical multiprocessor platform. Since the problem of partitioning tasks among processors (even with unlimited preemption) is NP-hard in the strong sense, these algorithms are unlikely to be optimal. For task systems where the ratio between the large...

We analytically decide whether the broadcast transmission scheme or unicast achieves optimal age of information (AoI) performance a multiuser system where base station (BS) generates and transmits status updates to multiple user equipments (UEs). In scheme, update for all UEs is jointly encoded into packet transmission, while in each UE individually transmitted by following round robin policy. ...

The multi-skill project scheduling problem (MSPSP) has been first addressed in the community for more than 15 years. This article deals with a new variant of this problem, MSPSP partial preemption, where only subset resources can be released during preemption periods. Like standard is NP-hard, because which we propose series heuristic algorithms to solve instances arising from an industrial app...