[ { "id": "authors:qsngw-k3537", "collection": "authors", "collection_id": "qsngw-k3537", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190109-091547583", "type": "book_section", "title": "Compositional structures for streaming applications", "book_title": "Proceedings of the 20th International Conference on Distributed Computing and Networking (ICDCN '19)", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Bunn", "given_name": "Julian", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" } ], "abstract": "This paper describes an ongoing project to develop a Python software package, IoTPy, that helps beginning programmers build modular applications that process streams of data collected from sensors, social media and other sources, and to reason about the correctness of their applications in a compositional fashion. IoTPy helps build streaming applications in four ways: (1) enables the construction of non-terminating applications that continuously process endless streams of data by encapsulating terminating programs; (2) supports computation throughout a network of nodes from sensors at the edges of the network to the cloud and back to actuators at the edge; (3) allows users to separate concerns of the logic of an application from the parallel hardware on which the application runs, and (4) supports proofs and testing of the correct behavior of a composition from the specifications of its components.", "doi": "10.1145/3288599.3288642", "isbn": "978-1-4503-6094-4", "publisher": "Association for Computing Machinery (ACM)", "place_of_publication": "New York, NY", "publication_date": "2019-01", "pages": "352-361" }, { "id": "authors:hmerv-kge80", "collection": "authors", "collection_id": "hmerv-kge80", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180516-142716986", "type": "book_section", "title": "Parallel discrete event simulation: The making of a field", "book_title": "Proceedings of the 2017 Winter Simulation Conference", "author": [ { "family_name": "Fujimoto", "given_name": "Richard M.", "clpid": "Fujimoto-Richard-M" }, { "family_name": "Bagrodia", "given_name": "Rajive", "clpid": "Bagrodia-R" }, { "family_name": "Bryant", "given_name": "Randal E.", "clpid": "Bryant-R-E" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Jefferson", "given_name": "David", "clpid": "Jefferson-D" }, { "family_name": "Misra", "given_name": "Jayadev", "clpid": "Misra-J" }, { "family_name": "Nicol", "given_name": "David", "clpid": "Nicol-D" }, { "family_name": "Unger", "given_name": "Brian", "clpid": "Unger-B" } ], "contributor": [ { "family_name": "Chan", "given_name": "W. K. V.", "clpid": "Chan-W-K-V" }, { "family_name": "D'Ambrogio", "given_name": "A.", "clpid": "D'Ambrogio-A" }, { "family_name": "Zacharewicz", "given_name": "G.", "clpid": "Zacharewicz-G" }, { "family_name": "Mustafee", "given_name": "N.", "clpid": "Mustafee-N" }, { "family_name": "Wainer", "given_name": "G.", "clpid": "Wainer-G" }, { "family_name": "Page", "given_name": "E.", "clpid": "Page-E" } ], "abstract": "Originating in the 1970's, the parallel discrete event simulation (PDES) field grew from a group of researchers focused on determining how to execute a discrete event simulation program on a parallel computer while still obtaining the same results as a sequential execution. Over the decades that followed the field expanded, grew, and flourishes to this day. This paper describes the origins and development of the field in the words of many who were deeply involved. Unlike other published work focusing on technical issues, the emphasis here is on historical aspects that are not recorded elsewhere, providing a unique characterization of how the field was created and developed.", "doi": "10.1109/WSC.2017.8247793", "isbn": "978-1-5386-3428-8", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2017-12", "pages": "262-291" }, { "id": "authors:8vfdt-2hk40", "collection": "authors", "collection_id": "8vfdt-2hk40", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170110-151419016", "type": "book_section", "title": "Theory and implementation of a distributed event based platform", "book_title": "DEBS '16 Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper presents theory and an implementation of a Distributed Event Based System (DEBS) platform. The theory is based on a simple model that forms the basis of the implementation. Though this paper is about a DEBS platform, a description of the theory and model provides the motivation for the design.\n\nMany software libraries operate on \"data at rest', i.e. fixed data structures such as arrays and graphs. By contrast, DEBS systems operate on \"data in motion,\" i.e., data structures that change, in increments, over time. Many software libraries are designed for sequential execution or synchronous parallel execution. By contrast, DEBS systems have multiple agents executing asynchronously. The paper presents sufficient conditions that enable programs operating on data at rest to be reconfigured as networks of asynchronous agents operating on data structures that change incrementally as time progresses.\n\nThe paper provides a brief description of a DEBS platform, called StreamPy, implemented in Python. StreamPy enables the use of libraries designed to operate on data at rest --- particularly for data analytics, artificial intelligence, and scientific computation --- for data in motion. An event is either defined by a pre-specified pattern or an event is learned from data. Learning what is, and what is not, an event requires the use of machine learning algorithms. A goal of StreamPy is to incorporate machine learning into data streaming to obtain a DEBS platform that learns what is an event and then to continually improve this learning.", "doi": "10.1145/2933267.2940321", "isbn": "978-1-4503-4021-2", "publisher": "ACM", "place_of_publication": "New York, NY", "publication_date": "2016-06", "pages": "205-213" }, { "id": "authors:8jn7j-ff629", "collection": "authors", "collection_id": "8jn7j-ff629", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20151012-145047466", "type": "book_section", "title": "A model for residential adoption of photovoltaic systems", "book_title": "2015 IEEE Power & Energy Society General Meeting", "author": [ { "family_name": "Agarwal", "given_name": "Anish", "clpid": "Agarwal-A" }, { "family_name": "Cai", "given_name": "Desmond", "orcid": "0000-0001-9207-1890", "clpid": "Cai-Desmond-W-H" }, { "family_name": "Shah", "given_name": "Sunil", "clpid": "Shah-S" }, { "family_name": "Chandy", "given_name": "Mani", "clpid": "Chandy-K-M" }, { "family_name": "Sheric", "given_name": "Robert", "clpid": "Sheric-R" } ], "abstract": "Due to the growth in the number of residential photo voltaic (PV) adoptions in the past five years, there is a need in the electricity industry for a widely-accessible model that predicts the adoption of PV based on different business and policy decisions. We analyze historical adoption patterns and find that monetary savings is the most important factor in the adoption of PV, superseding all socioeconomic factors. On the basis of the findings from our data analysis, we created an application available on Google App Engine (GAE), that allows researchers, policymakers and regulators to study the complex relationship between PV adoption, grid sustainability and utility economics. This application allows users to experiment with a variety of scenarios including different tier structures, subsidies and customer demographics. We showcase the type of analyses that are possible with this application by using it to study the impact of different policies regarding tier structures, fixed charges and PV prices.", "doi": "10.1109/PESGM.2015.7286226", "isbn": "978-1-4673-8040-9", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2015-07", "pages": "1-5" }, { "id": "authors:zxwv3-g7g20", "collection": "authors", "collection_id": "zxwv3-g7g20", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150501-091249022", "type": "book_section", "title": "Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow", "book_title": "48th Annual Conference on Information Sciences and Systems (CISS)", "author": [ { "family_name": "Bose", "given_name": "Subhonmesh", "orcid": "0000-0002-3445-4479", "clpid": "Bose-Subhonmesh" }, { "family_name": "Gayme", "given_name": "Dennice F.", "clpid": "Gayme-D-F" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Low", "given_name": "Steven H.", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" } ], "abstract": "This paper presents a class of non-convex quadratically constrained quadratic programs that can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a technical condition. We demonstrate its use on optimal power flow problems over radial networks.", "doi": "10.1109/CISS.2014.6814135", "isbn": "978-1-4799-3001-2", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2014-03", "pages": "1-5" }, { "id": "authors:w8mpk-5mn30", "collection": "authors", "collection_id": "w8mpk-5mn30", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131220-110930033", "type": "book_section", "title": "Optimal placement of energy storage in the grid", "book_title": "51st IEEE Conference on Decision and Control", "author": [ { "family_name": "Bose", "given_name": "Subhonmesh", "orcid": "0000-0002-3445-4479", "clpid": "Bose-Subhonmesh" }, { "family_name": "Gayme", "given_name": "Dennice F.", "clpid": "Gayme-D-F" }, { "family_name": "Topcu", "given_name": "Ufuk", "clpid": "Topcu-U" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper studies the problem of optimally placing large-scale energy storage in power grids with both conventional and wind generation. The solution technique for this infinite horizon problem assumes cyclic demand and generation profiles using a semidefinite relaxation of AC optimal power flow. Changes in storage allocation in the network are studied as a function of total storage budget and transmission line-flow constraints. These questions are investigated using an IEEE benchmark system with various generation portfolios.", "doi": "10.1109/CDC.2012.6426113", "isbn": "978-1-4673-2065-8", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2012-12", "pages": "5605-5612" }, { "id": "authors:rk6zp-gad61", "collection": "authors", "collection_id": "rk6zp-gad61", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130731-091844876", "type": "book_section", "title": "Equivalence of Branch Flow and Bus Injection Models", "book_title": "2012 50th Annual Allerton Conference on Communication, Control, and Computing", "author": [ { "family_name": "Subhonmesh", "given_name": "Bose", "clpid": "Subhonmesh-B" }, { "family_name": "Low", "given_name": "Steven H.", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "A branch flow model has recently been proposed for the analysis and optimization of power flows. In this paper we show that the model is equivalent to the more popular bus injection model. Moreover, we prove the equivalence of various relaxations of these two models.", "doi": "10.1109/Allerton.2012.6483453", "isbn": "978-1-4673-4537-8", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2012-10", "pages": "1893-1899" }, { "id": "authors:6ffg6-fxq56", "collection": "authors", "collection_id": "6ffg6-fxq56", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120816-143912724", "type": "book_section", "title": "Towards a Discipline of Geospatial Distributed Event Based Systems", "book_title": "Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems", "author": [ { "family_name": "Liu", "given_name": "Annie", "clpid": "Liu-A" }, { "family_name": "Olson", "given_name": "Michael", "clpid": "Olson-M" }, { "family_name": "Bunn", "given_name": "Julian", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "A geospatial system is one in which the state space includes one, two or three-dimensional space and time. A geospatial event is one in which an event impacts points in space over time. Examples of geospatial events include floods, tsunamis, earthquakes, and emission of toxic plumes. This paper discusses aspects of the theory of geospatial distributed event based systems (GDEBS). The paper describes algorithms for rapid detection of geospatial events which can be used on Cloud computing architectures, in which many servers collaborate to detect events by analyzing data streams from large numbers of sensors. Sensor noise and timing errors may result in false detection or missed detection as well as incorrect identification of event attributes such as the location of the event source. The paper presents mathematical analyses and simulations dealing with rapid event detection for geospatial events of varying speeds in the presence of substantial sensor noise and timing error. The paper also describes some of the algorithmic and machine-learning techniques for improving event detection in the Cloud with large numbers of noisy sensors. Experience with GDEBS using a seismic network is described.", "doi": "10.1145/2335484.2335495", "isbn": "978-1-4503-1315-5", "publisher": "ACM", "place_of_publication": "New York", "publication_date": "2012", "pages": "95-106" }, { "id": "authors:f5y6p-2dw90", "collection": "authors", "collection_id": "f5y6p-2dw90", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-100855433", "type": "book_section", "title": "Optimal contract for wind power in day-ahead electricity markets", "book_title": "2011 50th IEEE Conference on Decision and Control and European Control Conference", "author": [ { "family_name": "Cai", "given_name": "Desmond W. H.", "orcid": "0000-0001-9207-1890", "clpid": "Cai-Desmond-W-H" }, { "family_name": "Adlakha", "given_name": "Sachin", "clpid": "Adlakha-S" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "The growth of wind energy production poses several challenges in its integration in current electric power systems. In this work, we study how a wind power producer can bid optimally in existing electricity markets. We derive optimal contract size and expected profit for a wind producer under arbitrary penalty function and generation costs. A key feature of our analysis is to allow for the wind producer to strategically withhold production once the day ahead contract is signed. Such strategic behavior is detrimental to the smooth functioning of electricity markets. We show that under simple conditions on the offered price and marginal imbalance penalty, a risk neutral profit maximizing wind power producer will produce as much as wind power is available (up to its contract size).", "doi": "10.1109/CDC.2011.6161253", "isbn": "978-1-61284-800-6", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2011-12", "pages": "1521-1527" }, { "id": "authors:56qs2-jnm02", "collection": "authors", "collection_id": "56qs2-jnm02", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-112707612", "type": "book_section", "title": "Inverter VAR control for distribution systems with renewables", "book_title": "2011 IEEE International Conference on Smart Grid Communications", "author": [ { "family_name": "Farivar", "given_name": "Masoud", "clpid": "Farivar-M" }, { "family_name": "Clarke", "given_name": "Christopher R.", "clpid": "Clarke-C-R" }, { "family_name": "Low", "given_name": "Steven H.", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "Motivated by the need to cope with rapid and random fluctuations of renewable generation, we presents a model that augments the traditional Volt/VAR control through switched controllers on a slow timescale with inverter control on a fast timescale. The optimization problem is generally nonconvex and therefore hard to solve. We propose a simple convex relaxation and prove that it is exact provided over-satisfaction of load is allowed. Hence Volt/VAR control over radial networks is efficiently solvable. Simulations of a real-world distribution circuit illustrates that the proposed inverter control achieves significant improvement over the IEEE 1547 standard in terms of power quality and power savings.", "doi": "10.1109/SmartGridComm.2011.6102366", "isbn": "978-1-4577-1704-8", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2011-10", "pages": "457-462" }, { "id": "authors:y43yg-pnk53", "collection": "authors", "collection_id": "y43yg-pnk53", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-125833627", "type": "book_section", "title": "Optimal design of hybrid energy system with PV/wind turbine/storage: A case study", "book_title": "2011 IEEE International Conference on Smart Grid Communications", "author": [ { "family_name": "Huang", "given_name": "Rui", "clpid": "Huang-Rui" }, { "family_name": "Low", "given_name": "Steven H.", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" }, { "family_name": "Topcu", "given_name": "Ufuk", "clpid": "Topcu-U" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Clarke", "given_name": "Christopher R.", "clpid": "Clarke-C-R" } ], "abstract": "Hybrid energy systems with renewable generation are built in many remote areas where the renewable resources are abundant and the environment is clean. We present a case study of the Catalina Island in California for which a system with photovoltaic (PV) arrays, wind turbines, and battery storage is designed based on empirical weather and load data. To determine the system size, we formulate an optimization problem that minimizes the total construction and operation cost subject to maximum tolerable risk. Simulations using the Hybrid Optimization Model for Electric Renewable (HOMER) is used to determine the feasible set of the optimization problem.", "doi": "10.1109/SmartGridComm.2011.6102376", "isbn": "978-1-4577-1704-8", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2011-10", "pages": "511-516" }, { "id": "authors:0kg75-e8b44", "collection": "authors", "collection_id": "0kg75-e8b44", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170215-173725326", "type": "book_section", "title": "GRIP - Grids with intelligent periphery: Control architectures for Grid2050^\u03c0", "book_title": "2011 IEEE International Conference on Smart Grid Communications (SmartGridComm)", "author": [ { "family_name": "Bakken", "given_name": "D.", "clpid": "Bakken-D" }, { "family_name": "Bose", "given_name": "A.", "clpid": "Bose-A" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Khargonekar", "given_name": "P. P.", "clpid": "Khargonekar-P-P" }, { "family_name": "Kuh", "given_name": "A.", "clpid": "Kuh-A" }, { "family_name": "Low", "given_name": "S.", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" }, { "family_name": "von Meier", "given_name": "A.", "orcid": "0000-0003-4675-752X", "clpid": "von-Meier-A" }, { "family_name": "Poolla", "given_name": "K.", "clpid": "Poolla-K" }, { "family_name": "Varaiya", "given_name": "P. P.", "clpid": "Varaiya-P-P" }, { "family_name": "Wu", "given_name": "F.", "clpid": "Wu-F" } ], "abstract": "A distributed control and coordination architecture for integrating inherently variable and uncertain generation is presented. The key idea is to distribute the intelligence into the periphery of the grid. This will allow coordination of generation, storage, and adjustable demand on the distribution side of the system and thus reduce the need to build new transmission facilities to accommodate large amounts of renewable generation.", "doi": "10.1109/SmartGridComm.2011.6102397", "isbn": "978-1-4577-1702-4", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2011-10", "pages": "7-12" }, { "id": "authors:6xz0p-emq71", "collection": "authors", "collection_id": "6xz0p-emq71", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-095656194", "type": "book_section", "title": "Optimal power flow over tree networks", "book_title": "2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)", "author": [ { "family_name": "Bose", "given_name": "Subhonmesh", "orcid": "0000-0002-3445-4479", "clpid": "Bose-Subhonmesh" }, { "family_name": "Gayme", "given_name": "Dennice F.", "clpid": "Gayme-D-F" }, { "family_name": "Low", "given_name": "Steven", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "The optimal power flow (OPF) problem is critical to power system operation but it is generally non-convex and therefore hard to solve. Recently, a sufficient condition has been found under which OPF has zero duality gap, which means that its solution can be computed efficiently by solving the convex dual problem. In this paper we simplify this sufficient condition through a reformulation of the problem and prove that the condition is always satisfied for a tree network provided we allow over-satisfaction of load. The proof, cast as a complex semi-definite program, makes use of the fact that if the underlying graph of an n \u00d7 n Hermitian positive semi-definite matrix is a tree, then the matrix has rank at least n-1.", "doi": "10.1109/Allerton.2011.6120323", "isbn": "978-1-4577-1817-5", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2011-09", "pages": "1342-1348" }, { "id": "authors:7p76n-qdh14", "collection": "authors", "collection_id": "7p76n-qdh14", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120521-104906176", "type": "book_section", "title": "Rapid detection of rare geospatial events: earthquake warning applications", "book_title": "Proceedings of the 5th ACM international conference on Distributed event-based system", "author": [ { "family_name": "Olson", "given_name": "Michael", "clpid": "Olson-M" }, { "family_name": "Liu", "given_name": "Annie", "clpid": "Liu-A" }, { "family_name": "Faulkner", "given_name": "Matthew", "clpid": "Faulkner-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "The paper presents theory, algorithms, measurements of experiments, and simulations for detecting rare geospatial events by analyzing streams of data from large numbers of heterogeneous sensors. The class of applications are rare events - such as events that occur at most once a month - and that have very high costs for tardy detection and for false positives. The theory is applied to an application that warns about the onset of shaking from earthquakes based on real-time data gathered from different types of sensors with varying sensitivities located at different points in a region. We present algorithms for detecting events in Cloud computing servers by exploiting the scalability of Cloud computers while working within the limits of state synchronization across different servers in the Cloud. Ordinary citizens manage sensors in the form of mobile phones and tablets as well as special-purpose stationary sensors; thus the geospatial distribution of sensors depends on population densities. The distribution of the locations of events may, however, be different from population distributions. We analyze the impact of population distributions (and hence sensor distributions as well) on the efficacy of event detection. Data from sensor measurements and from simulations of earthquakes validate the theory.", "doi": "10.1145/2002259.2002276", "isbn": "978-1-4503-0423-8", "publisher": "Association for Computing Machinery (ACM)", "place_of_publication": "New York, NY", "publication_date": "2011-07", "pages": "89-100" }, { "id": "authors:ayj97-ytc90", "collection": "authors", "collection_id": "ayj97-ytc90", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120522-090842007", "type": "book_section", "title": "Tutorial: Event processing grand challenges", "book_title": "Proceedings of the 5th ACM international conference on Distributed event-based system", "author": [ { "family_name": "Bizarro", "given_name": "Pedro", "clpid": "Bizarro-P" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Stojanovic", "given_name": "Nenad", "clpid": "Stojanovic-N" } ], "abstract": "This tutorial discusses grand challenges for the event processing community.", "doi": "10.1145/2002259.2002308", "isbn": "978-1-4503-0423-8", "publisher": "Association for Computing Machinery (ACM)", "place_of_publication": "New York, NY", "publication_date": "2011-07", "pages": "361-362" }, { "id": "authors:9b6za-ap442", "collection": "authors", "collection_id": "9b6za-ap442", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170208-175923694", "type": "book_section", "title": "Sensor networks for the detection and tracking of radiation and other threats in cities", "book_title": "Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks", "author": [ { "family_name": "Liu", "given_name": "Annie H.", "clpid": "Liu-Annie-H" }, { "family_name": "Bunn", "given_name": "Julian J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper presents results from experiments, mathematical analysis, and simulations of a network of static and mobile sensors for detecting threats on city streets and in open areas such as parks. The paper focuses on the detection of nuclear radiation threats and shows how the analysis can be extended to other classes of threat. The paper evaluates algorithms that integrate methods of parametric and Bayesian statistics. A pure Bayesian approach is difficult because obtaining prior distributions on the large number of parameters is challenging. The results of analyses and simulations are compared against measurements made on a reduced scale testbed. A survey of background radiation in the city of Sacramento is used to quantify the efficacy of police patrols to detect threats. The paper also presents algorithms that optimize network parameters such as sensor placement.", "isbn": "978-1-61284-854-9", "publisher": "ACM", "place_of_publication": "New York, NY", "publication_date": "2011-04" }, { "id": "authors:xgd0d-3cm08", "collection": "authors", "collection_id": "xgd0d-3cm08", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170306-172704069", "type": "book_section", "title": "The next big one: Detecting earthquakes and other rare events from community-based sensors", "book_title": "Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks", "author": [ { "family_name": "Faulkner", "given_name": "Matthew", "clpid": "Faulkner-M" }, { "family_name": "Olson", "given_name": "Michael", "clpid": "Olson-M" }, { "family_name": "Chandy", "given_name": "Rishi", "clpid": "Chandy-R" }, { "family_name": "Krause", "given_name": "Jonathan", "clpid": "Krause-J" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Krause", "given_name": "Andreas", "orcid": "0000-0001-7260-9673", "clpid": "Krause-A" } ], "abstract": "Can cell phones be used to detect earthquakes? The Community Seismic Network (CSN) is building a dense sensor network from inexpensive and community owned sensors, such as cell phones and USB accelerometers. Detecting rare events such as earthquakes is a difficult sensing problem, and is compounded by the wide variations among sensors in a heterogeneous community network. We demonstrate an end-to-end system using Android cell phones and a cloud fusion center that allows participants to create \"mock earthquakes\". Upon detecting such an event, the cloud fusion center issues real-time alerts to the phones. A map-based interface to the fusion center is projected nearby, displaying the information reported by the phones.", "isbn": "978-1-61284-854-9", "publisher": "ACM", "place_of_publication": "New York, NY", "publication_date": "2011-04", "pages": "13-24" }, { "id": "authors:vvz1g-sn848", "collection": "authors", "collection_id": "vvz1g-sn848", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170306-172057582", "type": "book_section", "title": "Demo abstract, the next big one: Detecting earthquakes and other rare events from community-based sensors", "book_title": "Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks", "author": [ { "family_name": "Faulkner", "given_name": "Matthew", "clpid": "Faulkner-M" }, { "family_name": "Olson", "given_name": "Michael", "clpid": "Olson-M" }, { "family_name": "Chandy", "given_name": "Rishi", "clpid": "Chandy-R" }, { "family_name": "Krause", "given_name": "Jonathan", "clpid": "Krause-J" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Krause", "given_name": "Andreas", "orcid": "0000-0001-7260-9673", "clpid": "Krause-A" } ], "abstract": "Can cell phones be used to detect earthquakes? The Community Seismic Network (CSN) is building a dense sensor network from inexpensive and community owned sensors, such as cell phones and USB accelerometers. Detecting rare events such as earthquakes is a difficult sensing problem, and is compounded by the wide variations among sensors in a heterogeneous community network. We demonstrate an end-to-end system using Android cell phones and a cloud fusion center that allows participants to create \"mock earthquakes\". Upon detecting such an event, the cloud fusion center issues real-time alerts to the phones. A map-based interface to the fusion center is projected nearby, displaying the information reported by the phones.", "isbn": "978-1-61284-854-9", "publisher": "ACM", "place_of_publication": "New York, NY", "publication_date": "2011-04", "pages": "121-122" }, { "id": "authors:cd7d5-pat18", "collection": "authors", "collection_id": "cd7d5-pat18", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-102952651", "type": "book_section", "title": "A simple optimal power flow model with energy storage", "book_title": "49th IEEE Conference on Decision and Control (CDC)", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Low", "given_name": "Steven H.", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" }, { "family_name": "Topcu", "given_name": "Ufuk", "clpid": "Topcu-U" }, { "family_name": "Xu", "given_name": "Huan", "clpid": "Xu-Huan" } ], "abstract": "The integration of renewable energy generation, such as wind power, into the electric grid is difficult because of the source intermittency and the large distance between generation sites and users. This difficulty can be overcome through a transmission network with large-scale storage that not only transports power, but also mitigates against fluctuations in generation and supply. We formulate an optimal power flow problem with storage as a finite-horizon optimal control problem. We prove, for the special case with a single generator and a single load, that the optimal generation schedule will cross the time-varying demand profile at most once, from above. This means that the optimal policy will generate more than demand initially in order to charge up the battery, and then generate less than the demand and use the battery to supplement generation in final stages. This is a consequence of the fact that the marginal storage cost-to-go decreases in time.", "doi": "10.1109/CDC.2010.5718193", "isbn": "978-1-4244-7745-6", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2010-12", "pages": "1051-1057" }, { "id": "authors:hr890-8f768", "collection": "authors", "collection_id": "hr890-8f768", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170314-151537459", "type": "book_section", "title": "Load-shedding probabilities with hybrid renewable power generation and energy storage", "book_title": "48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)", "author": [ { "family_name": "Xu", "given_name": "Huan", "clpid": "Xu-Huan" }, { "family_name": "Topcu", "given_name": "Ufuk", "clpid": "Topcu-U" }, { "family_name": "Low", "given_name": "Steven H.", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" }, { "family_name": "Clarke", "given_name": "Christopher R.", "clpid": "Clarke-C-R" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "The integration of renewable energy resources, such as solar and wind power, into the electric grid presents challengs partly due to the intermittency in the power output. These difficulties can be alleviated by effectively utilizing energy storage. We consider, as a case study, the integration of renewable resources into the electric power generation portfolio of an island off the coast of Southern California, Santa Catalina Island, and investigate the feasibility of replacing diesel generation entirely with solar photovoltaics (PV) and wind turbines, supplemented with energy storage. We use a simple storage model alongside a combination of renewables and varying load-shedding characterizations to determine the appropriate area of PV cells, number of wind turbines, and energy storage capacity needed to stay below a certain threshold probability for load-shedding over a pre-specified period of time and long-term expected fraction of time at load-shedding.", "doi": "10.1109/ALLERTON.2010.5706912", "isbn": "978-1-4244-8216-0", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2010-09", "pages": "233-239" }, { "id": "authors:52hy4-ywr80", "collection": "authors", "collection_id": "52hy4-ywr80", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200225-075817665", "type": "book_section", "title": "Convergence Verification: From Shared Memory to Partially Synchronous Systems", "book_title": "Formal Modeling and Analysis of Timed Systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Mitra", "given_name": "Sayan", "clpid": "Mitra-S" }, { "family_name": "Pilotto", "given_name": "Concetta", "clpid": "Pilotto-C" } ], "contributor": [ { "family_name": "Cassez", "given_name": "Franck", "clpid": "Cassez-F" }, { "family_name": "Jard", "given_name": "Claude", "clpid": "Jard-C" } ], "abstract": "Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies a subclass of such systems for which convergence properties can be verified based on the proof of convergence for the corresponding discrete-time shared state system. The proof technique extends to the class of systems in which an agent's state evolves continuously over time. The proof technique has been formalized in the PVS interface for timed I/O automata and applied to verify convergence of a mobile agent pattern formation algorithm.", "doi": "10.1007/978-3-540-85778-5_16", "isbn": "978-3-540-85777-8", "publisher": "Springer", "place_of_publication": "Berlin", "publication_date": "2008-08-29", "pages": "218-232" }, { "id": "authors:55x36-xh187", "collection": "authors", "collection_id": "55x36-xh187", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180809-133557629", "type": "book_section", "title": "A Formalized Theory for Verifying Stability and Convergence of Automata in PVS", "book_title": "Theorem Proving in Higher Order Logics", "author": [ { "family_name": "Mitra", "given_name": "Sayan", "clpid": "Mitra-S" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "contributor": [ { "family_name": "Mohamed", "given_name": "Otmane Ait", "clpid": "Mohamed-O-A" }, { "family_name": "Mu\u00f1oz", "given_name": "C\u00e9sar", "clpid": "Mu\u00f1oz-C" }, { "family_name": "Tahar", "given_name": "Sofi\u00e8ne", "clpid": "Tahar-S" } ], "abstract": "Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for verifying stability or convergence of automata is currently not available. In this paper, we formalize one such theory proposed by Tsitsiklis [27]. We build on the existing PVS metatheory for untimed, timed, and hybrid input/output automata, and incorporate the concepts about fairness, stability, Lyapunov-like functions, and convergence. The resulting theory provides two sets of sufficient conditions, which when instantiated and verified for particular automata, guarantee convergence and stability, respectively.", "doi": "10.1007/978-3-540-71067-7_20", "isbn": "9783540710653", "publisher": "Springer", "place_of_publication": "Berlin", "publication_date": "2008-08", "pages": "230-245" }, { "id": "authors:gb5pp-sp793", "collection": "authors", "collection_id": "gb5pp-sp793", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170410-170440324", "type": "book_section", "title": "Networked sensing systems for detecting people carrying radioactive material", "book_title": "5th International Conference on Networked Sensing Systems", "author": [ { "family_name": "Chandy", "given_name": "Mani", "clpid": "Chandy-K-M" }, { "family_name": "Pilotto", "given_name": "Concetta", "clpid": "Pilotto-C" }, { "family_name": "McLean", "given_name": "Ryan", "clpid": "McLean-R" } ], "abstract": "he goal of the research described in this paper is to help prevent scenarios such as the following: a terrorist detonates a device that distributes radioactive material such as Cesium-137 or Cobalt-60 in an open space used for public sports events or demonstrations. This paper studies the efficacy of networks of static sensors on street lamps or similar infrastructures. This paper describes individual sensors, evaluates the benefits of networks of stationary sensors, and briefly discusses the potential value of integrated networks of wireless-equipped mobile security personnel with stationary radiation sensors and cameras. The paper presents mathematical analysis coupled with simulation results.", "doi": "10.1109/INSS.2008.4610916", "isbn": "978-4-907764-31-9", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2008-06", "pages": "148-155" }, { "id": "authors:vmda7-2ht64", "collection": "authors", "collection_id": "vmda7-2ht64", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-161531182", "type": "book_section", "title": "Towards a theory of events", "book_title": "Proceedings of the 2007 inaugural international conference on Distributed event-based systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" }, { "family_name": "Capponi", "given_name": "Agostino", "clpid": "Capponi-A" } ], "abstract": "Event-driven systems are used in a wide range of applications such as responding to missile attacks, interdicting potential terrorists, exploiting arbitrage opportunities and responding to congestion in supply chains. The designs of event-driven systems vary widely because the costs and benefits to users of different applications are markedly different. This talk proposes a framework for unifying designs of different types of applications by representing the design problem as a constrained optimization and by defining interaction between components in distributed event-based systems in terms of a concept called \"shared models.\" This talk is intended to suggest that there are concepts that unify analyses of a range of event-driven systems in nature, human social organizations and information technology systems.", "doi": "10.1145/1266894.1266929", "isbn": "978-1-59593-665-3", "publisher": "Association for Computing Machinery", "place_of_publication": "New York, NY", "publication_date": "2007-06", "pages": "180-187" }, { "id": "authors:vfnyc-frt67", "collection": "authors", "collection_id": "vfnyc-frt67", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170424-152222673", "type": "book_section", "title": "Self-Similar Algorithms for Dynamic Distributed Systems", "book_title": "27th International Conference on Distributed Computing Systems : Toronto, Canada 25-27 June 2007", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" }, { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" } ], "abstract": "This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may cease functioning temporarily or permanently. Communication and computing may be interrupted by an adversary or by environmental factors such as noise and power loss. The set of processes may be partitioned into subsets that cannot communicate with each other; algorithms in which all such subsets behave in a similar fashion, regardless of size and identities of processes, are called self-similar algorithms. Algorithms adapt to changing conditions, speeding up or slowing down depending on the resources available. The paper presents necessary and sufficient conditions for the application of a self-similar strategy. Self-similar algorithms are developed for several problems by applying the methodology.", "doi": "10.1109/ICDCS.2007.137", "isbn": "9780769528373", "publisher": "IEEE", "place_of_publication": "Pisctaway, NJ", "publication_date": "2007-06", "pages": "67" }, { "id": "authors:3mz82-rw618", "collection": "authors", "collection_id": "3mz82-rw618", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160819-102210819", "type": "book_section", "title": "Event processing using database technology", "book_title": "SIGMOD '07 Proceedings of the 2007 ACM SIGMOD international conference on Management of data", "author": [ { "family_name": "Chandy", "given_name": "Mani", "clpid": "Chandy-K-M" }, { "family_name": "Gawlick", "given_name": "Dieter", "clpid": "Gawlick-D" } ], "abstract": "This tutorial deals with applications that help systems and \nindividuals respond to critical conditions in their environments. The identification of critical conditions requires correlating vast amounts of data within and outside an enterprise. Conditions that signal opportunities or threats are defined by complex patterns of data over time, space and other attributes. Systems and individuals have models (expectations) of behaviors of their \nenvironments, and applications notify them when reality \u2013 as determined by measurements and estimates \u2013 deviate from their expectations. Components of event systems are also sent information to validate their current models and when specific responses are required. Valuable information is that which supports or contradicts current expectations or that which requires an action on the part of the receiver. A major problem today is information overload; this problem\n can be solved by identifying what information is critical, complementing existing pull technology with sophisticated push technology, and filtering out non-critical data.", "doi": "10.1145/1247480.1247645", "isbn": "978-1-59593-686-8", "publisher": "ACM", "place_of_publication": "New York, NY", "publication_date": "2007-06", "pages": "1169-1170" }, { "id": "authors:gde8r-bj654", "collection": "authors", "collection_id": "gde8r-bj654", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20110216-140704666", "type": "book_section", "title": "Control-based Scheduling in a Distributed Stream Processing System", "book_title": "SCW 2006: IEEE Services Computing Workshops", "author": [ { "family_name": "Khorlin", "given_name": "Andrey-A", "clpid": "Khorlin-" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "Stream processing systems receive continuous streams\nof messages with raw information and produce streams\nof messages with processed information. The utility of a\nstream-processing system depends, in part, on the accuracy\nand timeliness of the output. Streams in complex event processing\nsystems are processed on distributed systems; several\nsteps are taken on different processors to process each\nincoming message, and messages may be enqueued between\nsteps. This paper deals with the problems of distributed dynamic\ncontrol of streams to optimize the total utility provided\nby the system. A challenge of distributed control is\nthat timeliness of output depends only on the total end-toend\ntime and is otherwise independent of the delays at each\nseparate processor whereas the controller for each processor\ntakes action to control only the steps on that processor\nand cannot directly control the entire network.\nThis paper identifies key problems in distributed control\nand analyzes two scheduling algorithms that help in an initial\nanalysis of a difficult problem.", "doi": "10.1109/SCW.2006.8", "isbn": "0-7695-2681-0", "publisher": "IEEE", "place_of_publication": "Los Alamitos, CA", "publication_date": "2006-09", "pages": "55-64" }, { "id": "authors:26vwm-pte26", "collection": "authors", "collection_id": "26vwm-pte26", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20110222-093942206", "type": "book_section", "title": "Snapshot Processing in Streaming Environments", "book_title": "2006 7th IEEE/ACM International Conference on Grid Computing", "author": [ { "family_name": "Zimmerman", "given_name": "Daniel M.", "clpid": "Zimmerman-D-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "Computational issues related to streaming data, and in particular the monitoring and rapid correlation of multiple sources of streaming data, are becoming increasingly important in contexts ranging from business processes to crisis detection. For example, a government system to detect bioterror attacks must correlate multiple streams of possibly low-confidence data from sensors and local and national public health information networks with cues from indicators such as news and government sources indicating geographical locations, tactics and timing of possible attacks. The results of this correlation trigger appropriate responses, such as flagging information for more in-depth analysis or sending alerts to public health officials. Monitoring and correlation applications of this type are ideal for deployment on distributed computing grids, because they have high transaction throughput, require low latency, and can be partitioned into sets of small communicating computations with regular communication patterns. An important consideration in these applications is the need to ensure that, at any given time, computations are carried out on an accurate - or at least close to accurate - picture of the environment being monitored. One way of doing this, which we call snapshot processing, is to treat collections of events that occur at approximately the same time as representing a global snapshot - a valid state - of the environment. Computation on the resulting series of snapshots is much like computation on a real-time video of the entire environment. We briefly describe our model for these stream processing computations and introduce the concept of snapshot processing", "doi": "10.1109/ICGRID.2006.311038", "isbn": "978-1-4244-0343-1", "publisher": "IEEE", "place_of_publication": "Piscataway, N.J.", "publication_date": "2006", "pages": "319-320" }, { "id": "authors:nm77f-ksn10", "collection": "authors", "collection_id": "nm77f-ksn10", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20110214-130828975", "type": "book_section", "title": "Enterprise Computing Systems as Information Factories", "book_title": "10th IEEE International Enterprise Distributed Object Computing Conference proceedings", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Tian", "given_name": "Lu", "clpid": "Tian-L" }, { "family_name": "Zimmerman", "given_name": "Daniel M.", "clpid": "Zimmerman-D-M" } ], "abstract": "The analysis, and eventual approval or rejection, of new\nenterprise information technology (IT) initiatives often proceeds\non the basis of informal estimates of return on investment.\nInvestment in new IT initiatives includes the costs of\nhardware, software licenses, application development tailored\nto the enterprise, and maintenance. Returns are typically\nestimated informally in terms of cost savings or revenue\nincreases. This paper makes the case for evaluating\ncertain IT investments in the same way as investments\nin factories and other resources have been evaluated for\ndecades. Just as industrial factories create value by transforming\nraw materials into finished products, some IT investments,\nwhich we call \"information factories\", create\nvalue by transforming raw information (events) into structured\ndata (and possibly actions based on that data). The\nreturn on investment is estimated by the difference between\nthe economic value of the structured data and concomitant\nactions (the \"finished product\") and that of the data available\nwithin the enterprise, from its partners and customers,\nand from the Internet (the \"raw materials\"). This paper\nintroduces the concept of the information factory, and explores\ndesign considerations for maximizing the economic\nefficiency of information factories.", "doi": "10.1109/EDOC.2006.24", "isbn": "0-7695-2558-X", "publisher": "IEEE", "place_of_publication": "Los Alamitos, CA", "publication_date": "2006", "pages": "427-432" }, { "id": "authors:rqbfd-9yx21", "collection": "authors", "collection_id": "rqbfd-9yx21", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20110728-110708162", "type": "book_section", "title": "Resource Allocation in Streaming Environments", "book_title": "2006 7th IEEE/ACM International Conference on Grid Computing", "author": [ { "family_name": "Tian", "given_name": "Lu", "clpid": "Tian-L" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper considers resource allocation algorithms\nfor processing streams of events on computational grids. For\nexample, financial trading applications are executed on large computational grids that receive streams of data such as stock ticker prices, commodity prices, foreign-exchange rates and total risk exposure. The economic value of a computation depends on the time taken to execute it; an arbitrage opportunity can disappear in seconds. Given limited resources, it is not possible to process all streams without delay. The more resource available\nto a computation, the less time it takes to process the input, and thus the more value it generates. Therefore, the scheduling policy should be designed to optimize the net economic value of computations executed on the grid. In this paper, we propose two scheduling/resource allocation algorithms for processing streams on computational grids to optimize economic value. Both algorithms are based on market mechanisms; one uses a centralized market and the other decentralized markets. We prove bounds on performance and present measurements to show that the performances of the resource allocation systems are near-optimal and outperform load-balancing heuristics.", "doi": "10.1109/ICGRID.2006.311025", "isbn": "978-1-4244-0343-1", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2006", "pages": "270-277" }, { "id": "authors:reb6c-fhg74", "collection": "authors", "collection_id": "reb6c-fhg74", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161026-164718354", "type": "book_section", "title": "Micro-Option: A Method for Optimal Selection and Atomic Reservation of Distributed Resources in a Free Market Environment", "book_title": "EC '00 Proceedings of the 2nd ACM conference on Electronic commerce", "author": [ { "family_name": "Ginis", "given_name": "Roman", "clpid": "Ginis-R" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "contributor": [ { "family_name": "Jhingran", "given_name": "Anant", "clpid": "Ghingran-A" }, { "family_name": "Mason", "given_name": "Jeff MacKie", "clpid": "Mason-J-M" }, { "family_name": "Tygar", "given_name": "Doug", "clpid": "Tygar-D" } ], "abstract": "Many business processes can be described as partial orderings of tasks. We propose a model where each task is performed by one resource leased in a free market and all the resources for the process must be reserved atomically. The main problem we introduce and solve here is as follows:\nGiven:\n\n1. A process composed of tasks to be executed in a specified\npartial order\n\n2. A set of resource types (people, information, machines)\nrequired to execute each task\n\n3. An objective function as a metric for choosing one resource over another \n\nfind and select the best resources (specific people, vehicles, computers, etc.) for each task, and commit all the resources for the entire process as an atomic operation, i.e., commit all resources or\nno resources.\n\nThis problem is an abstraction of what we believe will become a typical optimization and agreement problem between consumers and suppliers in electronic commerce for services. We give a solution to the problem in two parts: an algorithm for selecting optimal resources for a business process, and a method (Micro-Option) for achieving an atomic reservation agreement between multiple distributed resources and consumers in a free market environment.\n\nManaging atomic agreements between multiple parties is the\nkey problem for the lease-based free markets for services that we expect would form in the near future. Our Micro-Option method solves this problem for many business processes.", "doi": "10.1145/352871.352894", "isbn": "1-58113-272-7", "publisher": "ACM", "place_of_publication": "New York, NY", "publication_date": "2000-10", "pages": "207-214" }, { "id": "authors:3ywj8-3ex48", "collection": "authors", "collection_id": "3ywj8-3ex48", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191008-135116482", "type": "book_section", "title": "Theorems about Composition", "book_title": "Mathematics of Program Construction", "author": [ { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "contributor": [ { "family_name": "Backhouse", "given_name": "Roland", "clpid": "Backhouse-R" }, { "family_name": "Oliveira", "given_name": "Jos\u00e9 Nuno", "clpid": "Oliveira-J-N" } ], "abstract": "Compositional designs require component specifications that can be composed: Designers have to be able to deduce system properties from components specifications. On the other hand, components specifications should be abstract enough to allow component reuse and to hide substantial parts of correctness proofs in components verifications. Part of the problem is that too abstract specifications do not contain enough information to be composed. Therefore, the right balance between abstraction and composability must be found. This paper explores the systematic construction of abstract specifications that can be composed through specific forms of composition called existential and universal.", "doi": "10.1007/10722010_12", "isbn": "978-3-540-67727-7", "publisher": "Springer", "place_of_publication": "Berlin, Heidelberg", "publication_date": "2000", "pages": "167-186" }, { "id": "authors:zahek-anq18", "collection": "authors", "collection_id": "zahek-anq18", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200715-074133363", "type": "book_section", "title": "Towards a Compositional Approach to the Design and Verification of Distributed Systems", "book_title": "FM'99 \u2014 Formal Methods", "author": [ { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "contributor": [ { "family_name": "Wing", "given_name": "Jeannette M.", "clpid": "Wing-J-M" }, { "family_name": "Woodcock", "given_name": "Jim", "clpid": "Woodcock-J" }, { "family_name": "Davies", "given_name": "Jim", "clpid": "Davies-J" } ], "abstract": "We are investigating a component-based approach for formal design of distributed systems. In this paper, we introduce the framework we use for specification, composition and communication and we apply it to an example that highlights the different aspects of a compositional design, including top-down and bottom-up phases, proofs of composition, refinement proofs, proofs of program texts, and component reuse.", "doi": "10.1007/3-540-48119-2_32", "isbn": "978-3-540-66587-8", "publisher": "Springer", "place_of_publication": "Berlin", "publication_date": "1999-09-17", "pages": "570-589" }, { "id": "authors:gw96q-8rh47", "collection": "authors", "collection_id": "gw96q-8rh47", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200713-150514979", "type": "book_section", "title": "Examples of program composition illustrating the use of universal properties", "book_title": "Parallel and Distributed Processing", "author": [ { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "contributor": [ { "family_name": "Rolim", "given_name": "Jos\u00e9", "clpid": "Rolim-J" }, { "family_name": "Mueller", "given_name": "Frank", "clpid": "Mueller-F" }, { "family_name": "Zomaya", "given_name": "Albert Y.", "clpid": "Zomaya-A-Y" }, { "family_name": "Ercal", "given_name": "Fikret", "clpid": "Ercal-F" }, { "family_name": "Olariu", "given_name": "Stephan", "clpid": "Olariu-S" }, { "family_name": "Ravindran", "given_name": "Binoy", "clpid": "Ravindran-B" }, { "family_name": "Gustafsson", "given_name": "Jan", "clpid": "Gustafsson-J" }, { "family_name": "Takada", "given_name": "Hiroaki", "clpid": "Takada-Hiroaki" }, { "family_name": "Olsson", "given_name": "Ron", "clpid": "Olsson-R" }, { "family_name": "Kale", "given_name": "Laxmikant V.", "clpid": "Kale-L-V" }, { "family_name": "Beckman", "given_name": "Pete", "clpid": "Beckman-P" }, { "family_name": "Haines", "given_name": "Matthew", "clpid": "Haines-M" }, { "family_name": "ElGindy", "given_name": "Hossam", "clpid": "ElGindy-H" }, { "family_name": "Caromel", "given_name": "Denis", "clpid": "Caromel-D" }, { "family_name": "Chaumette", "given_name": "Serge", "clpid": "Chaumette-S" }, { "family_name": "Fox", "given_name": "Geoffrey", "clpid": "Fox-G" }, { "family_name": "Pan", "given_name": "Yi", "clpid": "Pan-Yi" }, { "family_name": "Li", "given_name": "Keqin", "clpid": "Li-Keqin" }, { "family_name": "Yang", "given_name": "Tao", "clpid": "Yang-Tao" }, { "family_name": "Chiola", "given_name": "G.", "clpid": "Chiola-G" }, { "family_name": "Conte", "given_name": "G.", "clpid": "Conte-G" }, { "family_name": "Mancini", "given_name": "L. V.", "clpid": "Mancini-L-V" }, { "family_name": "M\u00e9ry", "given_name": "Domenique", "clpid": "M\u00e9ry-D" }, { "family_name": "Sanders", "given_name": "Beverly", "clpid": "Sanders-B" }, { "family_name": "Bhatt", "given_name": "Devesh", "clpid": "Bhatt-D" }, { "family_name": "Prasanna", "given_name": "Viktor", "clpid": "Prasanna-V" } ], "abstract": "This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared variables. However, some universal properties do not appear directly in components specifications and they must be constructed to prove the composed system. Coming up with such universal properties often requires creativity. The paper shows through two examples how this construction can be achieved. The principle used is first presented with a toy example and then applied to a more substantial problem.", "doi": "10.1007/bfb0098004", "isbn": "978-3-540-65831-3", "publisher": "Springer", "place_of_publication": "Berlin", "publication_date": "1999", "pages": "1215-1227" }, { "id": "authors:kbh2y-qgm74", "collection": "authors", "collection_id": "kbh2y-qgm74", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201118-085206383", "type": "book_section", "title": "A Cottage industry of software publishing: Implications for theories of composition", "book_title": "Parallel and Distributed Processing", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Sivilotti", "given_name": "Paolo A. G.", "clpid": "Sivilotti-P-A-G" }, { "family_name": "Kiniry", "given_name": "Joseph R.", "orcid": "0000-0002-3589-2454", "clpid": "Kiniry-J-R" } ], "contributor": [ { "family_name": "Rolim", "given_name": "Jos\u00e9", "clpid": "Rolim-K" } ], "abstract": "This note explores the use of UNITY-based theories to facilitate a cottage industry of software publishing. The requirements for such an industry are discussed, the appropriateness of UNITY specification and compositional theories for these requirements are analyzed, and further research opportunities in this area are identified. This work is based on joint work with Beverly Sanders, and the ideas discussed here have been explored jointly with Paul Sivilotti and Joseph Kiniry.", "doi": "10.1007/3-540-64359-1_751", "isbn": "9783540643593", "publisher": "Springer", "place_of_publication": "Berlin, Heidelberg", "publication_date": "1998", "pages": "890-899" }, { "id": "authors:0e4b6-23093", "collection": "authors", "collection_id": "0e4b6-23093", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170707-135456200", "type": "book_section", "title": "Program Composition Notation", "book_title": "A Comparative Study of Parallel Programming Languages: the Salishan Problems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Taylor", "given_name": "Stephen", "clpid": "Taylor-S" } ], "contributor": [ { "family_name": "Feo", "given_name": "J. T.", "clpid": "Feo-J-T" } ], "abstract": "Program Composition Notation (PCN) is a notation for composing programs. The programs that are composed may be expressed in base languages, such as Fortran, Lisp, or Strand or in PCN itself. The PCN research effort has a narrow focus. The chapter explains the program composition operators. The traditional method of constructing programs is by sequential composition. The chapter presents the evaluation the thesis that other forms of program composition are helpful, and that programmers should be able to define their own composition operators for program composition. A goal of an effort is to identify proof rules for the composition operators, and to evaluate their efficacy in reasoning about programs. A unifying framework has been proposed for developing numeric, symbolic, and reactive programs. The focus is to develop programs by stepwise refinement, starting with programs with simpler proofs and refining them if they are not adequately efficient. PCN is an outgrowth of UNITY and Strand. It has the basic data types: boolean, integer, single and double precision floating point number, character, and string. The initial value of a variable of a basic data type is arbitrary. The chapter also explores that a PCN has a data type called synch, for synchronization. The initial value of a synch variable is a special symbol, \u03c6 that indicates that the variable is undefined. Programmers have the obligation of proving that a synch variable is assigned at most one value. Given such a proof, a synch variable is both undefined (\u03c6), or it is defined and its definition remains unchanged. A synch variable can be assigned a value of any type.", "doi": "10.1016/B978-0-444-88135-9.50012-7", "isbn": "978-0-444-88135-9", "publisher": "Elsevier", "place_of_publication": "Amsterdam", "publication_date": "1992", "pages": "263-295" }, { "id": "authors:jd9ca-b9338", "collection": "authors", "collection_id": "jd9ca-b9338", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160428-161906926", "type": "book_section", "title": "UC: a language for the connection machine", "book_title": "Proceedings of Supercomputing '90", "author": [ { "family_name": "Bagrodia", "given_name": "R.", "clpid": "Bagrodia-R" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Kwan", "given_name": "E.", "clpid": "Kwan-E" } ], "abstract": "n designing parallel languages, the concern for defining a simple virtual machine must be balanced against the need to efficiently map a program on a specific architecture. UC addresses this problem by separating the programming task from efficiency considerations. UC programs are designed using a small set of constructs that include reduction, parallel assignment, and fixed-point computation. The language also provides a map section that may optionally be used by a programmer to specify data mappings for the program. The authors describe the UC constructs and their implementation on the Connection Machine. They also present measurements of the compiler for simple benchmarks.", "doi": "10.1109/SUPERC.1990.130064", "isbn": "0-8186-2056-0", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "1990-11", "pages": "525-534" }, { "id": "authors:xebwc-4yq65", "collection": "authors", "collection_id": "xebwc-4yq65", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160819-105930876", "type": "book_section", "title": "The Composition of Concurrent Programs", "book_title": "Supercomputing '89 Proceedings of the 1989 ACM/IEEE conference on Supercomputing", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Taylor", "given_name": "Stephen", "clpid": "Taylor-S" } ], "abstract": "This paper describes a notation for concurrent programs\ncalled PCN for Program Composition Notation. The\nnotation is being implemented at Caltech on multicomputers\n(a network of computers that communicate by\nsending and receiving messages). A fragment of this\nnotation has been implemented on a data-parallel computer\n- the Connection Machine - by Rajive Bagrodia\nat UCLA. PCN is an outgrowth of research on UNITY\n(1) and Strand (2). The central ideas underlying PCN\naxe discussed next.", "doi": "10.1145/76263.76325", "isbn": "0-89791-341-8", "publisher": "ACM", "place_of_publication": "New York, NY", "publication_date": "1989-11", "pages": "557-561" }, { "id": "authors:y0kwp-9vt86", "collection": "authors", "collection_id": "y0kwp-9vt86", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-143721404", "type": "book_section", "title": "How processes learn", "book_title": "Proceedings of the fourth annual ACM symposium on Principles of distributed computing", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Misra", "given_name": "Jayadev", "clpid": "Misra-J" } ], "abstract": "Processes in distributed systems communicate with one another exclusively by sending and receiving messages. A process has access to its state but not to the states of other processes. Many distributed algorithms require that a process determine facts about the overall system computation. In anthropomorphic terms, processes \"learn\" about states of other process in the evolution of system computation. This paper is concerned with how processes learn. We give a precise characterization of the minimum information flow necessary for a process to determine specific facts about the system.", "doi": "10.1145/323596.323615", "isbn": "0-89791-168-7", "publisher": "Association for Computing Machinery", "place_of_publication": "New York, NY", "publication_date": "1985-08", "pages": "204-214" }, { "id": "authors:tg1jk-8zm16", "collection": "authors", "collection_id": "tg1jk-8zm16", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-150422670", "type": "book_section", "title": "Performance models of token ring local area networks", "book_title": "Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems", "author": [ { "family_name": "Berry", "given_name": "Robert", "clpid": "Berry-R" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper presents a simple heuristic analytic algorithm for predicting the \"response times\" of messages in asymmetric token ring local area networks. A description of the token ring and the model is presented in section 2 the algorithm is described in section 3 and the empirical results in section 4. The analytic results were compared against a detailed simulation model and the results are extremely close over a wide range of models. Local area networks (or LANS) offer a very attractive solution to the problem of connecting a large number of devices distributed over a small geographic area. They are an inexpensive readily expandable and highly flexible communications media. They are the backbone of the automated office - a significant component of the office of the future. This importance of LANS in the future of applied computer science has resulted in a tremendous burst of interest in the study of their behaviour. There are already many different LAN architectures proposed and studied in the literature [Tropper 81] [Tannenbaum 81] [Babic 78] [Metcalfe 76] [Clark 78] One LAN architecture is significant for several reasons. This architecture is the token ring [Carsten 77]. It has attracted interest because of its simplicity fairness and efficiency. The interest it has generated has resulted in the proposal of several different versions. This paper concentrates on one of these versions - the single token token ring protocol as described in [Bux 81]. This particular version is attractive because of its overall simplicity and reliability. This paper presents an algorithm for predicting response times in a token ring with the single token protocol.", "doi": "10.1145/800040.801414", "isbn": "0-89791-112-1", "publisher": "Association for Computing Machinery", "place_of_publication": "New York, NY", "publication_date": "1983-08", "pages": "266-274" }, { "id": "authors:mvf69-55c40", "collection": "authors", "collection_id": "mvf69-55c40", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-143826562", "type": "book_section", "title": "Proving safety and liveness of communicating processes with examples", "book_title": "Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing", "author": [ { "family_name": "Misra", "given_name": "J.", "clpid": "Misra-J" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Smith", "given_name": "Todd", "clpid": "Smith-Todd" } ], "abstract": "A method is proposed for reasoning about safety and liveness properties of message passing networks. The method is hierarchical and is based upon combining the specifications of component processes to obtain the specification of a network. The inference rules for safety properties use induction on the number of messages transmitted; liveness proofs use techniques similar to termination proofs in sequential programs. We illustrate the method with two examples: concatenations of buffers to construct larger buffers and a special case of Stenning protocol for message communication over noisy channels.", "doi": "10.1145/800220.806698", "isbn": "0-89791-081-8", "publisher": "Association for Computing Machinery", "place_of_publication": "New York, NY", "publication_date": "1982-08", "pages": "201-208" }, { "id": "authors:mxnrw-ba619", "collection": "authors", "collection_id": "mxnrw-ba619", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-135906881", "type": "book_section", "title": "A distributed algorithm for detecting resource deadlocks in distributed systems", "book_title": "Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Misra", "given_name": "J.", "clpid": "Misra-J" } ], "abstract": "This paper presents a distributed algorithm to detect deadlocks in distributed data bases. Features of this paper are (1) a formal model of the problem is presented, (2) the correctness of the algorithm is proved, i.e. we show that all true deadlocks will be detected and deadlocks will not be reported falsely, (3) no assumptions are made other than that messages are received correctly and in order and (4) the algorithm is simple.", "doi": "10.1145/800220.806693", "isbn": "0-89791-081-8", "publisher": "Association for Computing Machinery", "place_of_publication": "New York, NY", "publication_date": "1982-08", "pages": "157-164" }, { "id": "authors:97r57-9eb15", "collection": "authors", "collection_id": "97r57-9eb15", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-145728422", "type": "book_section", "title": "The use of performance models in systematic design", "book_title": "Proceedings of the 1982 national computer conference", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Misra", "given_name": "J.", "clpid": "Misra-J" }, { "family_name": "Berry", "given_name": "R.", "clpid": "Berry-R-F" }, { "family_name": "Neuse", "given_name": "D.", "clpid": "Neuse-D" } ], "abstract": "The paper describes a top-down methodology for evaluating the performance of computer/communication systems and describes tools that help in implementing the methodology. It also deals with performance analysis during the design of new hardware and/or software systems. The goal of the methodology is to detect and correct performance problems early in the design cycle.", "doi": "10.1145/1500774.1500804", "isbn": "0-88283-035-X", "publisher": "Association for Computing Machinery", "place_of_publication": "New York, NY", "publication_date": "1982-06", "pages": "251-256" }, { "id": "authors:mtr6p-d1c80", "collection": "authors", "collection_id": "mtr6p-d1c80", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-100604653", "type": "book_section", "title": "A modeling approach and design tool for pipelined central processors", "author": [ { "family_name": "Lang", "given_name": "D. E.", "clpid": "Lang-D-E" }, { "family_name": "Agerwala", "given_name": "T. K.", "clpid": "Agerwala-T-K" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" } ], "abstract": "As CPUs have become larger and more complex, it has become increasingly more difficult during hardware design and implementation to predict how well a CPU will perform. Furthermore, buyers of such machines have a similar problem in evaluating CPU performance among a diverse selection of computers, since MIP rates quoted by manufacturers may be misleading. This paper describes a methodology based on simulation models for predicting the performance of central processors with instruction execution that occurs in distinct and separable phases. The basic components of the model have been designed to allow a functional representation of the instruction execution path. This provides a natural mapping of the instruction set onto the architecture in a manner familiar to the designer. The model has been verified for existing computers using actual trace data from these machines. Novel aspects of the model and its use in CPU design are discussed.", "doi": "10.1145/800090.802901", "publisher": "Association for Computing Machinery", "publication_date": "1979-04" }, { "id": "authors:2y3gd-yxp04", "collection": "authors", "collection_id": "2y3gd-yxp04", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-154850666", "type": "book_section", "title": "Bayesian models of design based on intuition", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" } ], "abstract": "Most computer system designers use a great deal of intuition in the design process. Intuition is often used to handle uncertainty in design parameters. Since uncertainty seems to be intrinsic to most design problems it follows that designers will continue to rely on intuition or \"sound engineering judgement\". This paper attempts to use Bayesian Decision Theory to explore the possibility of setting up a structure and theory for making design decisions in the computer system design environment while explicitly taking the intuitive nature of many design decisions into account. We shall focus attention on a particular problem in distributed data base design in which the designer must use his intuition to estimate the load on the system which he is designing. Similar Bayesian approaches could be used in other design problems.", "publisher": "IEEE Computer Society Press", "publication_date": "1976-10" }, { "id": "authors:0hzmj-a3c82", "collection": "authors", "collection_id": "0hzmj-a3c82", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190110-112538692", "type": "book_section", "title": "File allocation in distributed systems", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Hewes", "given_name": "J. E.", "clpid": "Hewes-J-E" } ], "abstract": "The problem of allocating files in a computer network is a complex combinatorial problem due to the number of integer design parameters involved. These parameters include system cost, number of copies of each file to be stored, and sites at which the copies should be stored. The tradeoffs between these parameters are discussed. The design problem is formulated as an integer programming problem. A branch and bound algorithm is proposed to solve the problem. A linear programming formulation which ignores integer restrictions (and allows a fraction of a file to reside at a site) is shown to yield integer solutions in most cases. In other words integer restrictions are satisfied automatically. A near-optimal heuristic is presented, along with computational results. An efficient method to solve the file allocation problem for medium-scale networks is proposed.", "doi": "10.1145/800200.806177", "publisher": "Association for Computing Machinery (ACM)", "publication_date": "1976-03" }, { "id": "authors:ggj28-33w46", "collection": "authors", "collection_id": "ggj28-33w46", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-135122887", "type": "book_section", "title": "A framework for hardware-software tradeoffs in the design of fault-tolerant computers", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Ramamoorthy", "given_name": "C. V.", "clpid": "Ramamoorthy-C-V" }, { "family_name": "Cowan", "given_name": "A.", "clpid": "Cowan-A" } ], "abstract": "The theory of fault-tolerant computer design has developed rapidly. Several techniques using hardware or software have been suggested. A student is often faced with the problem of developing a common perspective for a variety of methods. In this paper we attempt to develop a simple framework within which different methods can be compared. We use a set of very elementary indices to construct the framework. The indices are quite crude and our framework is somewhat ad hoc. Though a unified theory would be extremely useful we have not attempted to develop one here. Our discussion is a first pass at identifying some goals of reliable design and an attempt at quantifying some parameters. We discuss only a very small set of the techniques that have been proposed for fault-tolerant computers. Methods for constructing relevant indices for these techniques are presented. We feel that these indices are relevant for most reliability techniques.", "doi": "10.1145/1479992.1480000", "publisher": "Association for Computing Machinery", "publication_date": "1972-12" }, { "id": "authors:bs6tj-8hw73", "collection": "authors", "collection_id": "bs6tj-8hw73", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-150905455", "type": "book_section", "title": "Design automation and queueing networks: An interactive system for the evaluation of computer queueing models", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Keller", "given_name": "T. W.", "clpid": "Keller-T-W" }, { "family_name": "Browne", "given_name": "J. C.", "clpid": "Browne-J-C" } ], "abstract": "Design automation techniques have been successfully used in wiring board layouts, circuit design analysis, and other areas. Simulation techniques have been used by system analysts to evaluate complex computer systems. In the early stages of a computer system design a designer will find an interactive package, which gives him real-time solutions for queueing models of complex computer systems, extremely useful. In the first few passes at a design, detailed simulation studies are too expensive and too slow. A conversational package which evaluates arbitrary configurations and gives approximate results is preferable to a slow, expensive, though accurate simulation. This paper is concerned with the real-time analysis of complex queueing network models which have been extensively used in computer systems analysis. In this paper we present the theory, algorithms and some programs for a system which departs radically from previous attempts at computer design aids for queueing network analysis in two ways: firstly the design automation system proposed here will give both algebraic and numerical answers to queries put forward by the analyst. For instance, the analyst may want to find out an algebraic expression for the throughput of a network as a function of several parameters. Or the analyst may want the output in the form of a graph of throughput as a function of a parameter. The system discussed in this paper will satisfy both types of requests. Secondly, the system allows the analyst to evaluate arbitrary networks constructed from a set of specified \"building blocks.\" The \"building blocks\" are quite general\u2014they include queues with devices (servers), branches, joins, and so on. The analyst is allowed to use as many building blocks as he pleases, and he can interconnect these building blocks in any pattern he chooses. Thus the system is moderately flexible and allows the analyst greater freedom in choosing the models best suited for his system.", "doi": "10.1145/800153.804968", "publisher": "Association for Computing Machinery", "publication_date": "1972-06" } ]