TY - GEN AU - Low, Cheng AU - Aldemir, Mustafa AU - Aziz, Norheliena AU - Dumitrescu, Roman AU - Anacker, Harald ID - 22935 T2 - Journal of Production Engineering Research & Development (PERE) 7 TI - Strategy Planning of Collaborative Humanoid Soccer Robots based on Principle Solution ER - TY - JOUR AU - Joel, W. J. ID - 21748 IS - 5 JF - IEEE Computer Graphics and Applications TI - The Need to Start Research Education Early VL - 33 ER - TY - JOUR AU - Kerren, A. ID - 21752 IS - 2 JF - IEEE Computer Graphics and Applications TI - Information Visualization Courses for Students with a Computer Science Background VL - 33 ER - TY - JOUR AU - Schell, J. AU - Klug, C. ID - 21807 IS - 3 JF - IEEE Computer Graphics and Applications TI - Building Virtual Worlds Carrying on the Legacy of Randy Pausch's "Head Fake" VL - 33 ER - TY - JOUR AU - Noé, Frank AU - Nüske, Feliks ID - 21935 JF - Multiscale Modeling & Simulation SN - 1540-3459 TI - A Variational Approach to Modeling Slow Processes in Stochastic Dynamical Systems ER - TY - JOUR AU - Dannewitz, Christian AU - Kutscher, Dirk AU - Ohlman, B AU - Farrell, Stephen AU - Ahlgren, Bengt AU - Karl, Holger ID - 770 IS - 7 JF - Computer Communications TI - Network of Information (NetInf) - An information-centric networking architecture ER - TY - JOUR AU - Dräxler, Martin AU - Biermann, Thorsten AU - Karl, Holger ID - 771 IS - 3 JF - International Journal of Wireless Information Networks TI - Improving Cooperative Transmission Feasibility by Network Reconfiguration in Limited Backhaul Networks ER - TY - CONF AU - Hohenberger, Till AU - Herlich, Matthias AU - Karl, Holger ID - 772 T2 - IEEE International Conference on Advanced Networks and Telecommunications Systems, ANTS 2013, Kattankulathur, India, December 15-18, 2013 TI - Trade-off between latency and coverage in cooperative radio access networks ER - TY - CONF AU - M. Facca, Federico AU - Salvadori, Elio AU - Karl, Holger AU - R. Lopez, Diego AU - Arranda Gutierrez, Pedro AU - Kostic, Dejan AU - Riggio, Roberto ID - 773 T2 - Second European Workshop on Software Defined Networks, EWSDN 2013, Berlin, Germany, October 10-11, 2013 TI - NetIDE: First Steps towards an Integrated Development Environment for Portable Network Apps ER - TY - CONF AU - Cicconetti, Claudio AU - Morelli, Arianna AU - Dräxler, Martin AU - Karl, Holger AU - Mancuso, Vincenzo AU - Sciancalepore, Vincenzo AU - Gupta, Rohit AU - de la Oliva, Antonio AU - Isabel Sanchez, M. AU - Serrano, Pablo AU - Roullet, Laurent ID - 774 T2 - 2013 Future Network & Mobile Summit, Lisboa, Portugal, July 3-5, 2013 TI - The playground of Wireless Dense networks of the future ER - TY - CONF AU - Keller, Matthias AU - Peuster, Manuel AU - Robbert, Christoph AU - Karl, Holger ID - 775 T2 - 17th International Conference on Intelligence in Next Generation Networks, {ICIN} 2013, Venice, Italy, October 15-16, 2013 TI - A topology-aware adaptive deployment framework for elastic applications ER - TY - CONF AU - Herlich, Matthias AU - Karl, Holger ID - 776 T2 - ISWCS 2013, The Tenth International Symposium on Wireless Communication Systems, Ilmenau, Germany, August 27-30, 2013 TI - Energy-Efficient Assignment of User Equipment to Cooperative Base Stations ER - TY - GEN ED - Fazal-Baqaie, Masud ID - 7762 TI - Vorgehensmodelle 2013: Vorgehensmodelle - Anspruch und Wirklichkeit - Proceedings der 20. Tagung der Fachgruppe Vorgehensmodelle im Fachgebiet Wirtschaftsinformatik (WI-VM) der Gesellschaft für Informatik e.V., Lörrach (Germany) VL - P-224 ER - TY - CONF AU - Dräxler, Martin AU - Karl, Holger ID - 777 T2 - 2013 9th International Wireless Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013 TI - Cross-layer scheduling for multi-quality video streaming in cellular wireless networks ER - TY - GEN AU - Dräxler, Martin AU - Blobel, Johannes AU - Dreimann, Philipp AU - Valentin, Stefan AU - Karl, Holger ID - 781 T2 - CoRR TI - Anticipatory Buffer Control and Quality Selection for Wireless Video Streaming ER - TY - CONF AB - The paradigm of service-oriented architectures has emerged as an architectural style for designing enterprise applications. Requirements engineering for such applications comprises the specification of business goal models representing stakeholder objectives and the operationalization to business process models that specify the required composition of services. Inconsistencies between business goals and derived business processes can lead to service compositions that are not in line with the actual stakeholder objectives. For preserving consistency it is required to consider logical and temporal dependencies among goals (e.g. the order in which they need to be achieved) in the derivation of business processes. In previous work, we provided a technique for the elicitation and specification of dependencies between business goals. Extending this approach, we aim at validating the consistency between business goal models and business process models regarding these dependencies. In this paper, we present a pattern-based approach for the automated generation of verifiable business process quality constraints from business goal models. We describe how these constraints can be used to check the consistency between business goals and business processes and demonstrate the applicability of our approach in a case study by using the implemented tool support. AU - Nagel, Benjamin AU - Gerth, Christian AU - Post, Jennifer AU - Engels, Gregor ID - 8057 T2 - Proceedings of the 17th IEEE International EDOC Conference (EDOC'13) TI - Ensuring Consistency Among Business Goals and Business Process Models ER - TY - CONF AU - Schumacher, Claudia AU - Engels, Gregor AU - Güldali, Baris AU - Niehammer, Markus AU - Hamburg, Matthias ED - Kowalewski, Stefan ED - Rumpe, Bernhard ID - 8058 T2 - Proceedings of the conference on Software Enginneering, Fachtagung des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany) TI - Modellbasierte Bewertung von Testprozessen nach TPI NEXT® mit Geschäftsprozess-Mustern VL - P-213 ER - TY - CONF AU - Engels, Gregor ID - 8059 T2 - Software Engineering 2013 TI - On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma für Softwaresysteme der Zukunft VL - P-213 ER - TY - CONF AU - Huma, Zille AU - Gerth, Christian AU - Engels, Gregor AU - Juwig, Oliver ID - 8060 T2 - Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC'13) TI - Automated Service Composition for On-the-Fly SOAs VL - 8274 ER - TY - CONF AU - Luckey, Markus AU - Engels, Gregor ID - 8061 T2 - Proceeding of the 8th international symposium on Software engineering for adaptive and self-managing systems TI - High-­Quality Specification of Self-­Adaptive Software Systems ER - TY - CONF AU - Brüseke, Frank AU - Becker, Steffen AU - Engels, Gregor ID - 8062 T2 - Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic) TI - Decision Support via Automated Metric Comparison for the Palladio-based Performance Blame Analysis ER - TY - CONF AU - Becker, Matthias AU - Luckey, Markus AU - Becker, Steffen ID - 8063 T2 - Ninth International ACM Sigsoft Conference on the Quality of Software Architectures TI - Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time ER - TY - GEN AU - Küster, Jochen AU - Kovács, Dániel AU - Bauer, Eduard AU - Gerth, Christian ID - 8222 TI - Integrating Coverage Analysis into Test-driven Development of Model Transformations ER - TY - GEN AU - Huma, Zille AU - Gerth, Christian AU - Engels, Gregor ID - 8223 TI - Automated Service Discovery and Composition for On-the-Fly SOAs ER - TY - CONF AU - Yigitbas, Enes AU - Gerth, Christian AU - Sauer, Stefan ID - 5752 T2 - Informatik 2013, 43. Jahrestagung der Gesellschaft für Informatik e.V. (GI), Informatik angepasst an Mensch, Organisation und Umwelt, 16.-20. September 2013, Koblenz, Deutschland TI - Konzeption modellbasierter Benutzungsschnittstellen für verteilte Selbstbedienungssysteme ER - TY - CHAP AU - Klompmaker, Florian AU - Paelke, Volker AU - Fischer, Holger Gerhard ID - 6276 SN - 0302-9743 T2 - Distributed, Ambient, and Pervasive Interactions TI - A Taxonomy-Based Approach towards NUI Interaction Design VL - 8028 ER - TY - CHAP AU - Fischer, Holger Gerhard AU - Strenge, Benjamin AU - Nebe, Karsten ID - 6279 SN - 0302-9743 T2 - Design, User Experience, and Usability. Design Philosophy, Methods, and Tools TI - Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design VL - 8012 ER - TY - CONF AU - Fischer, Holger Gerhard AU - Geis, Thomas AU - Molich, Rolf AU - Kluge, Oliver AU - Heimgärtner, Rüdiger AU - Hunkirchen, Peter ID - 6284 T2 - Jahresband Usability Professionals TI - Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified Professional for Usability and User Experience (CPUX) der German UPA ER - TY - CONF AB - Runtime monitoring aims at ensuring program safety by monitoring the program's behaviour during execution and taking appropriate action before a program violates some property.Runtime monitoring is in particular important when an exhaustive formal verification fails. While the approach allows for a safe execution of programs, it may impose a significant runtime overhead.In this paper, we propose a novel technique combining verification and monitoring which incurs no overhead during runtime at all. The technique proceeds by using the inconclusive result of a verification run as the basis for transforming the program into one where all potential points of failure are replaced by HALT statements. The new program is safe by construction, behaviourally equivalent to the original program (except for unsafe behaviour),and has the same performance characteristics. AU - Wonisch, Daniel AU - Schremmer, Alexander AU - Wehrheim, Heike ID - 469 T2 - Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM) TI - Zero Overhead Runtime Monitoring ER - TY - CONF AB - In OpenFlow [1], multiple switches share the same control plane which is centralized atwhat is called the OpenFlow controller. A switch only consists of a forwarding plane. Rules for forwarding individual packets (called ow entries in OpenFlow) are pushed from the controller to the switches. In a network with a high arrival rate of new ows, such as in a data center, the control trac between the switch and controller can become very high. As a consequence, routing of new ows will be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard ow entries can be used to create default routes in the network. However, since switches do not keep track of ows covered by a wildcard ow entry, the controller no longer has knowledge about individual ows. To nd out about these individual ows we propose an extension to the current OpenFlow standard to enable packet sampling of wildcard ow entries. AU - Wette, Philip AU - Karl, Holger ID - 470 T2 - Proceedings of the ACM SIGCOMM '13 TI - Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow ER - TY - GEN AU - Tezer, Alina ID - 471 TI - Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen ER - TY - JOUR AB - An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint paths between a source and a sink, each path carrying a unit of ow, and an h-route ow is a non-negative linear combination of elementary h-routeows. An h-route cut is a set of edges whose removal decreases the maximum h-route ow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h and at most O(log4 k f) where f is the size of the maximum h-routeow and k is the number of commodities. The main step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously, polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient of our algorithm is a novel rounding technique that we call multilevel ball-growing. Though the proof of the duality relies on this algorithm, it is not a straightforward corollary of it as in the case of classical multicommodity ows and cuts. Similar results are shown also for the sparsest multiroute cut problem. AU - Kolman, Petr AU - Scheideler, Christian ID - 476 IS - 2 JF - Theory of Computing Systems TI - Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing ER - TY - CONF AB - We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model. AU - Abshoff, Sebastian AU - Benter, Markus AU - Cord-Landwehr, Andreas AU - Malatyali, Manuel AU - Meyer auf der Heide, Friedhelm ID - 477 T2 - Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers TI - Token Dissemination in Geometric Dynamic Networks ER - TY - THES AB - Software systems are playing an increasing role in our everyday life, and as the amount of software applications grows, so does their complexity and the relevance of their computations. Software components can be found in many systems that are charged with safety-critical tasks, such as control systems for aviation or power plants. Hence, software verification techniques that are capable of proving the absence of critical errors are becoming more and more important in the field software engineering. A well-established approach to software verification is model checking. Applying this technique involves an exhaustive exploration of a state space model corresponding to the system under consideration. The major challenge in model checking is the so-called state explosion problem: The state space of a software system grows exponentially with its size. Thus, the straightforward modelling of real-life systems practically impossible. A common approach to this problem is the application of abstraction techniques, which reduce the original state space by mapping it on a significantly smaller abstract one. Abstraction inherently involves a loss of information, and thus, the resulting abstract model may be too imprecise for a definite result in verification. Therefore, abstraction is typically combined with abstraction refinement: An initially very coarse abstract model is iteratively refined, i.e. enriched with new details about the original system, until a level of abstraction is reached that is precise enough for a definite outcome. Abstraction refinement-based model checking is fully automatable and it is considered as one of the most promising approaches to the state explosion problem in verification. However, it is still faced with a number of challenges. There exist several types of abstraction techniques and not every type is equally well-suited for all kinds of systems and verification tasks. Moreover, the selection of adequate refinement steps is nontrivial and typically the most crucial part of the overall approach: Unfavourable refinement decisions can compromise the state space-reducing effect of abstraction, and as a consequence, can easily lead to the failure of verification. It is, however, hard to predict which refinement steps will eventually be expedient for verification – and which not. AU - Timm, Nils ID - 478 TI - Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems ER - TY - CONF AB - Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud. AU - Graffi, Kalman AU - Bremer, Lars ID - 481 T2 - Proceedings of the International Conference on Communications (ICC'13) TI - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case ER - TY - CONF AB - One of the main ideas of Service-Oriented Computing (SOC) is the delivery of flexibly composable services provided on world-wide markets. For a successful service discovery,service requests have to be matched with the available service offers. However, in a situation in which no service that completely matches the request can be discovered, the customer may tolerate slight discrepancies between request and offer. Some existing fuzzy matching approaches are able to detectsuch service variants, but they do not allow to explicitly specify which parts of a request are not mandatory. In this paper, we improve an existing service matching approach based onVisual Contracts leveraging our preliminary work of design pattern detection. Thereby, we support explicit specifications of service variants and realize gradual matching results that can be ranked in order to discover the service offer that matches a customer’s request best. AU - Platenius, Marie Christin AU - von Detten, Markus AU - Gerth, Christian AU - Schäfer, Wilhelm AU - Engels, Gregor ID - 484 T2 - IEEE 20th International Conference on Web Services (ICWS 2013) TI - Service Matching under Consideration of Explicitly Specified Service Variants ER - TY - CONF AB - Software composition has been studied as a subject of state based planning for decades. Existing composition approaches that are efficient enough to be used in practice are limited to sequential arrangements of software components. This restriction dramatically reduces the number of composition problems that can be solved. However, there are many composition problems that could be solved by existing approaches if they had a possibility to combine components in very simple non-sequential ways. To this end, we present an approach that arranges not only basic components but also composite components. Composite components enhance the structure of the composition by conditional control flows. Through algorithms that are written by experts, composite components are automatically generated before the composition process starts. Therefore, our approach is not a substitute for existing composition algorithms but complements them with a preprocessing step. We verified the validity of our approach through implementation of the presented algorithms. AU - Mohr, Felix AU - Kleine Büning, Hans ID - 485 T2 - Proceedings of the 15th International Conference on Information Integration and Web-based Applications & Services (iiWAS) TI - Semi-Automated Software Composition Through Generated Components ER - TY - GEN AU - Otte, Oliver ID - 486 TI - Seitenkanalresistenz paarungsbasierter Kryptographie ER - TY - GEN AU - Bobolz, Jan ID - 487 TI - Security Proofs for Pairing-Based Cryptography in the Generic Group Model ER - TY - CONF AB - Unattended systems are key ingredients of various critical infrastruc-tures like networks of self service terminals or automated teller machines.For cost and efficiency reasons they should mostly run autonomously.Unattended systems are attractive and lucrative targets for various kindsof attacks, including attacks on the integrity of their components and thecommunication between components. In this paper, we propose a gen-eral cryptographic framework to protect unattended systems. We alsodemonstrate that instantiating the framework with techniques from iden-tity based cryptography is particularly well-suited to efficiently secureunattended systems. AU - Blömer, Johannes AU - Günther, Peter AU - Krummel, Volker ID - 488 T2 - Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS) TI - Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study ER - TY - GEN AU - Wallaschek, Felix ID - 490 TI - Routing in heterogenen OpenFlow Netzwerken ER - TY - GEN AU - Robbert, Christoph ID - 492 TI - Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case ER - TY - THES AB - The maintenance of component-based software systems requires up-to-date models of their concrete architecture, i.e. the architecture that is realised in the source code. These models help in systematically planning, analysing and executing typical reengineering activities. Often no or only outdated architectural models of such systems exist. Therefore, various reverse engineering methods have been developed which try to recover a system's components, subsystems and connectors. However, these reverse engineering methods are severely impacted by design deciencies in the system's code base, especially violations of the component encapsulation. As long as design deciencies are not considered in the reverse engineering process, they reduce the quality of the recovered component structures. Despite this impact of design deciencies, no existing architecture reconstruction approach explicitly integrates a systematic deciency detection and removal into the recovery process. Therefore, I have developed Archimetrix. Archimetrix is a tool-supported architecture reconstruction process. It enhances a clustering-based architecture recovery approach with an extensible, pattern-based deciency detection. After the detection of deciencies, Archimetrix supports the software architect in removing the de ciencies and provides the means to preview the architectural consequences of such a removal. I also provide a process to identify and formalise additional deciencies. I validated the approach on three case studies which show that Archimetrix is able to identify relevant deciencies and that the removal of these deciencies leads to an increased quality of the recovered architectures, i.e. they are closer to the corresponding conceptual architectures. AU - von Detten, Markus ID - 494 TI - Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies ER - TY - CONF AB - Automated service composition has been studied as a subject of state based planning for a decade. A great deal of service composition tasks can only be solved if concrete output values of the services are considered in the composition process. However, the fact that those values are not known before runtime leads to nondeterministic planning problems, which have proven to be notoriously difficult in practical automated service composition applications. Even though this problem is frequently recognized, it has still received remarkably few attention and remains unsolved.This paper shows how nondeterminism in automated service composition can be reduced. We introduce context rules as a means to derive semantic knowledge from output values of services. These rules enable us to replace nondeterministic composition operations by less nondeterministic or even completely deterministic ones. We show the validity of our solutions not only theoretically but also have evaluated them practically through implementation. AU - Mohr, Felix AU - Lettmann, Theodor AU - Kleine Büning, Hans ID - 495 T2 - Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA) TI - Reducing Nondeterminism in Automated Service Composition ER - TY - CONF AB - Within reactive topology control, a node determines its adjacent edges of a network subgraph without prior knowledge of its neighborhood. The goal is to construct a local view on a topology which provides certain desired properties such as planarity. During algorithm execution, a node, in general, is not allowed to determine all its neighbors of the network graph. There are well-known reactive algorithms for computing planar subgraphs. However, the subgraphs obtained do not have constant Euclidean spanning ratio. This means that routing along these subgraphs may result in potentially long detours. So far, it has been unknown if planar spanners can be constructed reactively. In this work, we show that at least under the unit disk network model, this is indeed possible, by proposing an algorithm for reactive construction of the partial Delaunay triangulation, which recently turned out to be a spanner. Furthermore, we show that our algorithm is message-optimal as a node will only exchange messages with nodes that are also neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous proof of correctness. AU - Benter, Markus AU - Neumann, Florentin AU - Frey, Hannes ID - 496 T2 - Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) TI - Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks ER - TY - CONF AB - Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space. AU - Wonisch, Daniel AU - Schremmer, Alexander AU - Wehrheim, Heike ID - 498 T2 - Proceedings of the 25th International Conference on Computer Aided Verification (CAV) TI - Programs from Proofs – A PCC Alternative ER - TY - CONF AB - We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's competitiveness.Our results generalize and improve upon work by \citet{Chan:2010}, which considers a single speed-scalable processor.Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm.In our scheduling problem, jobs arrive over time and are preemptable.They have different workloads, values, and deadlines.The scheduler may decide not to finish a job but instead to suffer a loss equaling the job's value.However, to process a job's workload until its deadline the scheduler must invest a certain amount of energy.The cost of a schedule is the sum of lost values and invested energy.In order to finish a job the scheduler has to determine which processors to use and set their speeds accordingly.A processor's energy consumption is power $\Power{s}$ integrated over time, where $\Power{s}=s^{\alpha}$ is the power consumption when running at speed $s$.Since we consider the online variant of the problem, the scheduler has no knowledge about future jobs.This problem was introduced by~\citet{Chan:2010} for the case of a single processor.They presented an online algorithm which is $\alpha^{\alpha}+2e\alpha$-competitive.We provide an online algorithm for the case of multiple processors with an improved competitive ratio of $\alpha^{\alpha}$. AU - Kling, Peter AU - Pietrzyk, Peter ID - 499 T2 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) TI - Profitable Scheduling on Multiple Speed-Scalable Processors ER - TY - JOUR AU - de Lemos, Rogrio AU - Giese, Holger AU - A. Müller, Hausi AU - Shaw, Mary AU - Andersson, Jesper AU - Litoiu, Marin AU - Schmerl, Bradley AU - Tamura, Gabriel AU - M. Villegas, Norha AU - Vogel, Thomas AU - Weyns, Danny AU - Baresi, Luciano AU - Becker, Basil AU - Bencomo, Nelly AU - Brun, Yuriy AU - Cukic, Bojan AU - Desmarais, Ron AU - Dustdar, Schahram AU - Engels, Gregor AU - Geihs, Kurt AU - M. Göschka, Karl AU - Gorla, Alessandra AU - Grassi, Vincenzo AU - Inverardi, Paola AU - Karsai, Gabor AU - Kramer, Jeff AU - Lopes, Antonia AU - Magee, Jeff AU - Malek, Sam AU - Mankovskii, Serge AU - Mirandola, Raffaela AU - Mylopoulos, John AU - Nierstrasz, Oscar AU - Pezzè, Mauro AU - Prehofer, Christian AU - Schäfer, Wilhelm AU - Schlichting, Rick AU - B. Smith, Dennis AU - Pedro Sousa, Joao AU - Tahvildari, Ladan AU - Wong, Kenny AU - Wuttke, Jochen ID - 7271 JF - Software Engineering for Self-Adaptive Systems II TI - Software Engineering for Self-Adaptive Systems: A Second Research Roadmap ER - TY - JOUR AU - Bouillon, Elke AU - Güldali, Baris AU - Herrmann, Andrea AU - Keuler, Thorsten AU - Moldt, Daniel AU - Riebisch, Matthias ID - 7272 IS - 1 JF - Softwaretechnik-Trends TI - Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von Scrum VL - 33 ER - TY - JOUR AU - Grieger, Marvin AU - Güldali, Baris AU - Sauer, Stefan AU - Mlynarski, Michael ID - 7273 JF - OBJEKTspektrum (Online Themenspecials) TI - Testen bei Migrationsprojekten ER -