Hyperreconfigurable architectures can adapt their reconfiguration abilities during run time and have been proposed to increase the speed of dynamic reconfiguration. They use two types of dynamic reconfiguration steps. In hyperreconfiguration steps they change their ability for reconfiguration and in ordinary reconfiguration steps they reconfigure the actual contexts for a computation within the limits that have been set by the last hyperreconfiguration step. We study the concept of partial hyperreconfiguration for multi tasks environments. We propose several models for partially hyperreconfigurable architectures and study corresponding reconfiguration problems to find optimal (hyper)reconfigurations. While under a general cost model the problem to find optimal (hyper)reconfigurations is known to be NP-complete even for a single task. We identify an interesting special case that can be solved by a polynomial time algorithm even for multiple tasks. We illustrate the introduced concepts with a partially hyperreconfigurable example architecture and describe the results of simulated runs with a small test application.

Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing flexibility of modern dynamically reconfigurable systems improves their adaptability but also makes fast reconfiguration difficult because of the large amount of necessary reconfiguration information. However, even when a computation uses this flexibility it will not use it all the time. Therefore, we propose to make the potential for reconfigurationitself reconfigurable. This allows for speeding up reconfiguration operations during phases where only parts of the total flexibility are required. Such architectures are called hyperreconfigurable and use two types of reconfiguration operations: hyperreconfigurations for changing the reconfiguration potential and ordinary reconfigurations for actually configuring a new context for a computation.

Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing flexibility of modern dynamically reconfigurable systems improves their adaptability but also makes fast reconfiguration difficult because of the large amount of necessary reconfiguration information. However, even when a computation uses this flexibility it is not use it all the time. Therefore, we propose to make the potential for reconfiguration itself reconfigurable. This allows for speeding up reconfiguration operations during phases where only parts of the total flexibility are required. Such architectures are called hyperreconfigurable and uses two types of reconfiguration operations: hyperreconfigurations for changing the reconfiguration potential and ordinary reconfigurations for actually configuring a new context for a computation.

Hyperreconfigurable architectures adapt their reconfiguration abilities during run time in order to achieve fast dynamic reconfiguration. Models for such architectures have been proposed that change their ability for reconfiguration during hyperreconfiguration steps and in ordinary reconfiguration steps reconfigure the actual contexts for a computation within the limits that have been set by the last hyperreconfiguration step. In this paper we study algorithmic aspects of how to optimally decide what hyperreconfiguration steps should be done during a computation in order to minimize the total time necessary for hyperreconfiguration and ordinary reconfiguration. It is shown that the general problem is NP-hard but fast polynomial time algorithms are given to solve this problem on different types of hyperreconfigurable architectures. These include newly introduced architectures that use a cache to store hypercontexts. We define an example hyperreconfigurable architecture and illustrate the introduced concepts for three application problems.

Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increasing flexibility of modern dynamically reconfigurable systems improves their adaptability to computational needs but also makes fast reconfiguration difficult because of the large amount of reconfiguration information which has to be transferred. However, even when a computation uses this flexibility it will not use it all the time. Therefore, we propose to make the potential for reconfiguration itself reconfigurable. Such architectures are called hyperreconfigurable. Different models of hyperreconfigurable architectures are proposed in this paper. We also study a fundamental problem that emerges on such architectures, namely, to determine for a given computation when and how the potential for reconfiguration should be changed during run time so that the reconfiguration overhead is minimal. It is shown that the general problem is NP-hard but fast polynomial time algorithms are given to solve this problem for special types of hyperreconfigurable architectures. We define two example hyperreconfigurable architectures and illustrate the introduced concepts for corresponding application problems.

We investigate the relation between the theory of the itera- tions in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These logics are obtained from the restriction of set quantification in monadic second order logic to cer- tain subsets like, e.g., finite sets, chains, and finite unions of chains. We show that these theories of the Shelah-Stupp iteration can be reduced to corresponding theories of the base structure. This fails for Muchnik's iteration.

Im Rahmen des E-Government integrieren IT-Dienstleister der öffentlichen Verwaltung beste- hende Anwendungen von Bund, Ländern und Kommunen in komplexen Infrastrukturen. Durch domänenspezifische Modellierungssprachen lässt sich die Komplexität der Integrationsvorha- ben reduzieren. Am Beispiel der E-Government-Domäne Meldewesen wird in diesem Beitrag der Ansatz Model-Driven Integration Engineering (MDIE) vorgestellt. Er beschreibt u. a. die Entwicklung kompakter, intuitiver Modellierungssprachen für Integrationsvorhaben in einer fachlichen Domäne und fokussiert dabei die direkte Weiterverwendung der modellierten Sach- verhalte über Modelloperationen.

Die Unterstützung mobiler Arbeiter mit mobilen IT-Lösungen kann erhebliche Verbesserungen in den mobilen Geschäftsprozessen eines Unternehmens erzeugen. Die wesentliche Eigenschaft eines solchen mobilen Systems ist die Fähigkeit, sich mittels Mobilfunk mit einem zentralen Server zu verbinden, um z.B. auf Kundendaten zuzugreifen. Die Häufigkeit und der Ort der Nutzung, die benötigte Datenaktualität, Anforderungen an die Benutzeroberfläche und vieles mehr sind zentrale Aspekte, die bei der Entwicklung passender Systemarchitekturen berücksichtigt werden müssen. Dieser Beitrag stellt vier typische Architekturen für mobile Systeme vor und beschreibt einige ihrer wichtigsten Eigenschaften. Darüber hinaus werden häufige Anforderungen aus mobilen Geschäftsprozessen vorgestellt und die aus ihnen resultierenden Implikationen für die genannten Architekturen diskutiert.

Neue mobile Anwendungen und Endgeräte spielen in immer mehr Unternehmen eine immer größere Rolle. Die Frage, die sich viele Unternehmen allerdings noch zu selten stellen, ist, welche mobilen Anwendungen tatsächlich sinnvoll sind.

This case study describes the method of process landscaping by example of a project in which the business processes of a company from the residential trade and industry were analyzed regarding their mobile potential. This analysis was conducted with the aim to organize these processes more efficiently in order to realize cost savings. Therefore a verification was required, whether the use of mobility supporting technology is suitable to obtain this goal and which professional requirements such a solution needs to fulfil. For that purpose, it is shown how the initial situation was analyzed, which alternative solutions on the basis of mobility supporting technology were developed and how these alternatives were economically evaluated. Furthermore, it is shown how first restrictions for the software and system design were made on the basis of one alternative. The method of Mobile Process Landscaping refers to the stage of requirements engineering in the software process.