Embedded networked systems are increasingly complex, requiring development effort that spans a team of designers and implementers. Resource utilization budgets must be carefully specified and enforced to ensure the expected behavior of a composite system. In this paper, we present early results of a project aimed at specifying and enforcing time, space, and power utilization constraints. Our ap...

Most tasks in DSP-applications require multiple resources for their execution. If only CPU-usage is considered while constructing a static schedule, the actual run-time performance of the application can differ a lot from the predicted one. In this paper we present a scheduling method that takes non-CPU resourcerequirements into account as well while constructing the static schedule. Situation ...

One well-studied model of a multiprocessing system involves a fixed number n of identical abstract processors, a finite set of tasks to be executed, each requiring a specified amount of computation time, and a partial ordering on the tasks which requires certain tasks to be completed before certain others can be initiated. The nonpreemptive operation of the system is guided by an ordered list L...

In this paper, we aim to take a step toward a tighter integration of automated planning and Bayesian Optimization (BO). BO is an approach for optimizing costlyto-evaluate functions by selecting a limited number of experiments that each evaluate the function at a specified input. Typical BO formulations assume that experiments are selected one at a time, or in fixed batches, and that experiments...

In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This paper proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution method...

We present a decision-theory based approach for efficiently sampling information sources in resource-constrained environments, where there is uncertainty regarding source trustworthiness. We exploit diversity among sources to stratify the population into homogeneous subgroups to both minimise redundant sampling and mitigate the effect of certain biases (e.g., source collusion). After presenting...

One of the most recent techniques for propagating resource constraints in Constraint Based scheduling is Energy Constraint. This technique focuses in precedence based scheduling, where precedence relations are taken into account rather than the absolute position of activities. Although, this particular technique proved to be efficient on discrete unary resources, it provides only loose bounds f...

Modern computer architectures, particularly multicore systems, include shared hardware resources such as caches and interconnects that introduce timing-interference channels. Unmanaged access to such resources can adversely affect the execution time of other tasks, and lead to unpredictable execution times and associated analysis pessimism that can entirely negate the benefits of a multicore pr...

The decision to take vaccinations and other protective interventions for avoiding an infection is a natural game-theoretic setting. Most of the work on vaccination games has focused on decisions at the start of an epidemic. However, a lot of people defer their vaccination decisions, in practice. For example, in the case of the seasonal flu, vaccination rates gradually increase, as the epidemic ...

T h e theoret ical available i n s t r u c t i o n level paral le l i sm in m o s t b e n c h m a r k s is v e r y high. Vulnerabi l i ty i s related t o t h e di f f icul ty with w h i c h w e can extract t h i s paral le l i sm with f i n i t e resources . This s t u d y characterizes t h e vu lnerabi l i ty of paral le l i sm t o resource cons tra in ts by scheduling d y n a m i c dependence...