PPT-Managing complexity in a Software plus Services World

Amanda Jackson Fronde Systems Group Ltd Session Code ARC206 Presentation Outline hidden slide Title Managing Complexity in a Software plus Services World Technical Level All levels Intended Audience Developers Enterprise Architects. The member receives Most diagnostic preventive care at NO cha rge Cosmetic treatment The following member payments apply when a participating General Dentist performs services Par ticipating Specialists are available at fees discounted off of the How to celebrate it, leverage it, and NOT avoid it!. Are YOU sufficiently complex?. Simple = Best. FROM OCCAM’S . RAZOR. COMPLEXITY. Are YOU sufficiently complex?. Simple = Best. Simple but no. Simpler. Shantanu. . Dutt. ECE Dept.. UIC. Time Complexity. An . algorithm’s . time complexity is a function T(n) of problem size n that represents how much time the algorithm will take to complete its task.. Information Systems Development. SHAPE Hong Kong 2010/11. Lecture . 18 . : Fred Brooks’ – No Silver Bullet : Essence and Accidents of Software Engineering. No Silver Bullet. “There is no single development, in either technology or management technique, which by itself promises even one order-of magnitude improvement within a decade in productivity, in reliability, in simplicity.”. and . Hierarchy. Concept of Complexity. “whole is more than the sum of its parts”. Holism. new properties not found in subsystems. “mechanistic explanations of emergence rejected”. Weaker view of emergence. April 26, 2013. Mark Braverman. Princeton University. Based on joint work with Ankit . Garg. , Denis . Pankratov. , and . Omri. Weinstein. Overview: information complexity. Information complexity . :: . (as told by Michael Lynch). Genome size and complexity varies across the tree of life. Lynch 2007. Some Big Questions. What is the relationship between genomic and organismal size/complexity?. Are genome size changes adaptive, or passively acquired?. Why don’t languages evolve toward efficiency?. “As they evolve, things become more efficient.”. Efficient operations, tools, methods, etc. should drive out those that are difficult and costly.. Lecture 15. : . Software construction. Objective. After completing this lecture the students will be able to. Explain the components of software construction. Use coding best practices in their projects . Lecture 1: . Intro; Turing machines; . Class P and NP . . . Indian Institute of Science. About the course. Computational complexity attempts . to classify computational . problems. Collaborators: G. . Chiarotti. 1,2. , G. . . Cimini. 1,2, . M. Cristelli. 1,2. , R. . Di . Clemente. 1,2. ,. A. Gabrielli. 1,2,3. ,E. Pugliese. 1,2. , F. Saracco. 1,2. , F. . Sylos. Labini. 1,4. , T. Squartini. How Understanding Complexity Promotes Simplicity. Why is writing software hard?. ^. great. http://www.infoq.com/presentations/Simple-Made-Easy. Our duty as software architects is to understand and manage complexity. Toniann. . Pitassi. University of Toronto. 2-Party Communication Complexity. [Yao]. 2-party communication: . each party has a dataset. . Goal . is to compute a function f(D. A. ,D. B. ). m. 1. m. 2. Simon Thum. Fraunhofer-Institut. . für. . Graphische. . Datenverarbeitung. . IGD. Fraunhoferstraße. 5. 64283 Darmstadt. Tel . +. 49 6151 155 – . 581. simon.thum@igd.fraunhofer.de . www.igd.fraunhofer.de.