In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activit...

The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times must be found such that some optimization function, e. g. the makespan, is optimized. When determining an optimal (or at least feasible) assignment of decisio...

The dynamic semantics of LOTOS are defined in terms of axioms and inference rules which generate, from a given behaviour expression, the next possible actions and their resulting behaviour expressions. In this paper, we present a new type of inference rules, which are capable of generating traces of actions leading to a pre-selected action in the specification. These inference rules are guided ...

Classical reverse-mode automatic differentiation (AD) imposes only a small constant-factor overhead in operation count over the original computation, but has storage requirements that grow, in the worst case, in proportion to the time consumed by the original computation. This storage blowup can be ameliorated by checkpointing, a process that reorders application of classical reverse-mode AD ov...

In this paper, we introduce a model based approach for integration test cases generation. The approach is based on UML 2 Testing Profile and follows the Mode-Driven Architecture for generating integration test cases from unit test models. The generated test models can be exported to test execution environments such as JUnit and TTCN-3 for execution and evaluation.

Most algorithms developed for scheduling applications on global Grids focus on a single Quality of Service (QoS) parameter such as execution time, cost or total data transmission time. However, if we consider more than one QoS parameter (e.g. execution cost and time, which may be in conflict) then the problem becomes more challenging. To handle such scenarios, it is convenient to use heuristics...

 Due to the temporal execution locality present in programs, even small instruction caches (16-Kbyte) can provide processors with fast access to instructions most of the time. The Dynamically Trace Scheduled VLIW (DTSVLIW) architecture exploits programs’ temporal execution locality by executing code in two distinct modes. In the first execution encounter, fragments of the code are executed in ...

microarchitecture B. Sinharoy R. N. Kalla J. M. Tendler R. J. Eickemeyer J. B. Joyner This paper describes the implementation of the IBM POWER5e chip, a two-way simultaneous multithreaded dual-core chip, and systems based on it. With a key goal of maintaining both binary and structural compatibility with POWER4e systems, the POWER5 microprocessor allows system scalability to 64 physical process...

A distributed Java Virtual Machine (DJVM) spanning multiple cluster nodes can provide a true parallel execution environment for multi-threaded Java applications. Most existing DJVMs suffer from the slow Java execution in interpretive mode and thus may not be efficient enough for solving computation-intensive problems. We present JESSICA2, a new DJVM running in JIT compilation mode that can exec...

ForkLight is an imperative, task-parallel programming language for massively parallel shared memory machines. It is based on ANSI C, follows the SPMD model of parallel program execution, provides a sequentially consistent shared memory, and supports dynamically nested parallelism. While no assumptions are made on uniformity of memory access time or instruction– level synchronicity of the underl...