The problem of multiprogram scheduling on a single processor is studied from the viewpoint...

In this paper a survey on existing algorithms for the capacitated minimum spanning tree problem (CMST) is given. The algorithms are classified providing some insights into their fundamental principles. Reporting the literature, comparisons of the solution quality are given. As one result of the exploration it is observed that heuristic procedures for the CMST in general consider arcs when generating or transforming a solution. Contrary to this we develop an improvement procedure which is based on partitioning nodes into subsets thus focusing more on the combinatorial nature of the CMST. Given a feasible solution the attained node assignment is altered by a local search process based on shifts and node exchanges. To overcome local optimality simulated annealing and tabu search are investigated. Computations on some benchmark test problems are reported and improvements over the well-known Esau-Williams solution are presented. Some new best solutions are obtained.

Increases in processor speeds and the availability of audio and video devices for personal computers have encouraged the development of interactive multimedia applications for teleconferencing and digital audio/video presentation among others. These applications have stringent timing constraints, and traditional operating systems are not well suited to satisfying such constraints. On the other hand, hard real-time systems that can meet these constraints are typically static and inflexible. This dissertation

Real-time systems (RTS) respond to their environment within specified time constraints. RTS are inherently concurrent and typically manage shared data resources, so they require synchronization to ensure both logical and timing correctness. Much research in managing shared data has been carried out in the context of database systems. It is therefore appropriate to ask, "What principles and techniques can RTS borrow from database concurrency control?" Concurrency control techniques can seldom be transferred from database to the real-time domain without change; the performance considerations are too different. We discuss common features and differences between the two domains, paying special attention to the assumptions and goals of different classes of real-time systems. We then survey an array of correctness criteria and concurrency control techniques with regard to their applicability in soft, firm, and hard-deadline RTS. Real-time scheduling techniques and their interaction with conc...

Given an undirected graph G = (V, E) with non-negative costs on its edges, a root node r V with demand v D wishing to route w(v) units of flow (weight) to r, and a positive number k, the Capacitated Minimum Steiner Tree (CMStT) problem asks for a minimum Steiner tree, rooted at r, spanning the vertices in D in which the sum of the vertex weights in every subtree hanging o# r is at most k. When D = V , this problem is known as the Capacitated Minimum Spanning Tree (CMST) problem. Both CMStT and CMST problems are NP-hard. In this paper, we present approximation algorithms for these problems and several of their variants in network design. Our main results are the following.

We describe the intricate relationship between business processes and the underlying technology in an attempt to demonstrate that business organizations have always been technology driven. That is, the business processes have been tted to the available hardware and software. The technology determines the way business is conducted. With the advent of the Internet age, business processes will change radically, not because they are purposely reengineered, but because the Internet oers both to companies and customers radically dierent means of fullling their requirements. Thus, new business processes will emerge more or less autonomously, as people discover the opportunities oered to them by the new technology. The technical possibilities of today determine business consciousness. The current state of information and communication technology enables a migration from the information age to the age of immediate answers. After the underlying technology enables the possibilities, the business has the opportunity to align to it. 1

this paper arbitrarily show D L. Algorithms using Dt and D2 are not listed because there is no net advantage

This document defines a methodology for the prediction and evaluation of the performance of software from design specifications

Abstract not found

Domain-Specific Modeling (DSM) is an innovative software development methodology that raises the specification of software to graphical models at a high-level of abstraction using domain concepts available in a language that is defined by a metamodel. Using DSM, models become first-class entities in the construction of software systems, and therefore model evolution becomes as important as code evolution in traditional software development. Model transformation is a core technology of DSM that converts a source model to a target model, which plays a significant role in supporting model evolution activities. A common approach toward model transformation is to write transformation rules in a specialized model transformation language. Although such languages provide powerful capabilities to automate model transformations, their usage may present challenges to those who are unfamiliar with a specific model transformation language or a particular metamodel definition. In addition, in the collaborative modeling situations when model evolution knowledge needs to be exchanged and reused, most model transformation