[ { "id": "authors:9gy4y-y4921", "collection": "authors", "collection_id": "9gy4y-y4921", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220518-205134775", "type": "conference_item", "title": "Variations in Ground Motion Amplification in the Los Angeles Basin due to the 2019 M7.1 Ridgecrest Earthquake: Implications for the Long-Period Response of Infrastructure", "author": [ { "family_name": "Kohler", "given_name": "Monica D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Filippitzis", "given_name": "Filippos", "orcid": "0000-0001-8377-4914", "clpid": "Filippitzis-Filippos" }, { "family_name": "Graves", "given_name": "Robert", "orcid": "0000-0001-9758-453X", "clpid": "Graves-Robert-W" }, { "family_name": "Massari", "given_name": "Anthony", "orcid": "0000-0002-6561-4674", "clpid": "Massari-Anthony" }, { "family_name": "Heaton", "given_name": "Thomas H.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Bunn", "given_name": "Julian J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Guy", "given_name": "Richard", "orcid": "0000-0002-8651-5608", "clpid": "Guy-Richard-G" }, { "family_name": "Chandy", "given_name": "K. Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" } ], "abstract": "Coherent patterns and large variations in ground shaking amplification were observed in the Los Angeles basin during the 2019 M7.1 Ridgecrest earthquake. In particular, 3 s to 6 s responses showed variations due to shallow basin geological structure that have implications for the response to large earthquakes of mid-rises, high-rises, long-span bridges, and fuel storage tanks, even if epicentral distances are several hundred kilometers. The Ridgecrest strong-motion data were recorded by seismic stations from the spatially dense Community Seismic Network, the Southern California Seismic Network, and the California Strong Motion Instrumentation Program. The mainshock observations are compared at the same locations with ground motion simulations to examine the regions that experienced the largest shaking, and to investigate the geological sources of large-amplitude shaking. The simulations were computed for the two most commonly-used regional community seismic velocity models, CVM-S4.26.M01 ('CVM-S') and CVM-H 15.1.0 ('CVM-H'). Both observations and simulations are used in dynamic analysis with a finite-element model of an existing high-rise with ~6-second fundamental horizontal periods, located in downtown Los Angeles. The geographical variation in maximum story drift, story-level shear force, and story-level moment values suggest that the excitation of a hypothetical high-rise located in an area characterized by the largest 6-s PSA values could be significantly larger than in a downtown Los Angeles location. Ground motion simulations using the CVM-H velocity model more closely predict the long-period site amplifications in greater Los Angeles, particularly in the south-central San Fernando Valley, than simulations using CVM-S.", "publication_date": "2022-05-19" }, { "id": "authors:3g2ne-1f408", "collection": "authors", "collection_id": "3g2ne-1f408", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20211209-231200000", "type": "article", "title": "Ground motions in urban Los Angeles from the 2019 Ridgecrest earthquake sequence", "author": [ { "family_name": "Filippitzis", "given_name": "Filippos", "orcid": "0000-0001-8377-4914", "clpid": "Filippitzis-Filippos" }, { "family_name": "Kohler", "given_name": "Monica D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Heaton", "given_name": "Thomas H.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Graves", "given_name": "Robert W.", "orcid": "0000-0001-9758-453X", "clpid": "Graves-Robert-W" }, { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Guy", "given_name": "Richard G.", "orcid": "0000-0002-8651-5608", "clpid": "Guy-Richard-G" }, { "family_name": "Bunn", "given_name": "Julian J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J-J" }, { "family_name": "Chandy", "given_name": "K. Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" } ], "abstract": "We study ground-motion response in urban Los Angeles during the two largest events (M7.1 and M6.4) of the 2019 Ridgecrest earthquake sequence using recordings from multiple regional seismic networks as well as a subset of 350 stations from the much denser Community Seismic Network. In the first part of our study, we examine the observed response spectral (pseudo) accelerations for a selection of periods of engineering significance (1, 3, 6, and 8\u2009s). Significant ground-motion amplification is present and reproducible between the two events. For the longer periods, coherent spectral acceleration patterns are visible throughout the Los Angeles Basin, while for the shorter periods, the motions are less spatially coherent. However, coherence is still observable at smaller length scales due to the high spatial density of the measurements. Examining possible correlations of the computed response spectral accelerations with basement depth and Vs30, we find the correlations to be stronger for the longer periods. In the second part of the study, we test the performance of two state-of-the-art methods for estimating ground motions for the largest event of the Ridgecrest earthquake sequence, namely three-dimensional (3D) finite-difference simulations and ground motion prediction equations. For the simulations, we are interested in the performance of the two Southern California Earthquake Center 3D community velocity models (CVM-S and CVM-H). For the ground motion prediction equations, we consider four of the 2014 Next Generation Attenuation-West2 Project equations. For some cases, the methods match the observations reasonably well; however, neither approach is able to reproduce the specific locations of the maximum response spectral accelerations or match the details of the observed amplification patterns.", "doi": "10.1177/87552930211003916", "issn": "8755-2930", "publisher": "Earthquake Engineering Research Institute", "publication": "Earthquake Spectra", "publication_date": "2021-11-01", "series_number": "4", "volume": "37", "issue": "4", "pages": "2493-2522" }, { "id": "authors:m4qpg-a5r57", "collection": "authors", "collection_id": "m4qpg-a5r57", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210107-103141484", "type": "article", "title": "2019 Ridgecrest Earthquake Reveals Areas of Los Angeles That Amplify Shaking of High-Rises", "author": [ { "family_name": "Kohler", "given_name": "Monica D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Filippitzis", "given_name": "Filippos", "orcid": "0000-0001-8377-4914", "clpid": "Filippitzis-Filippos" }, { "family_name": "Heaton", "given_name": "Thomas", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Guy", "given_name": "Richard", "orcid": "0000-0002-8651-5608", "clpid": "Guy-Richard-G" }, { "family_name": "Bunn", "given_name": "Julian", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-Julian" }, { "family_name": "Chandy", "given_name": "K. Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" } ], "abstract": "The populace of Los Angeles, California, was startled by shaking from the M 7.1 earthquake that struck the city of Ridgecrest located 200 km to the north on 6 July 2019. Although the earthquake did not cause damage in Los Angeles, the experience in high\u2010rise buildings was frightening in contrast to the shaking felt in short buildings. Observations from 560 ground\u2010level accelerometers reveal large variations in shaking in the Los Angeles basin that occurred for more than 2 min. The observations come from the spatially dense Community Seismic Network (CSN), combined with the sparser Southern California Seismic Network and California Strong Motion Instrumentation Program networks. Site amplification factors for periods of 1, 3, 6, and 8 s are computed as the ratio of each station's response spectral values combined for the two horizontal directions, relative to the average of three bedrock sites. Spatially coherent behavior in site amplification emerges for periods \u22653\u2009\u2009s\u2060, and the maximum calculated site amplifications are the largest, by factors of 7, 10, and 8, respectively, for 3, 6, and 8 s periods. The dense CSN observations show that the long\u2010period amplification is clearly, but only partially, correlated with the depth to basement. Sites with the largest amplifications for the long periods (\u2060\u22653\u2009\u2009s\u2060) are not close to the deepest portion of the basin. At 6 and 8 s periods, the maximum amplifications occur in the western part of the Los Angeles basin and in the south\u2010central San Fernando Valley sedimentary basin. The observations suggest that the excitation of a hypothetical high\u2010rise located in an area characterized by the largest site amplifications could be four times larger than in a downtown Los Angeles location.", "doi": "10.1785/0220200170", "issn": "0895-0695", "publisher": "Seismological Society of America", "publication": "Seismological Research Letters", "publication_date": "2020-11", "series_number": "6", "volume": "91", "issue": "6", "pages": "3370-3380" }, { "id": "authors:r8k57-m8t03", "collection": "authors", "collection_id": "r8k57-m8t03", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191115-160214215", "type": "article", "title": "CSN-LAUSD Network: A Dense Accelerometer Network in Los Angeles Schools", "author": [ { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Kohler", "given_name": "Monica D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Guy", "given_name": "Richard", "orcid": "0000-0002-8651-5608", "clpid": "Guy-Richard" }, { "family_name": "Bunn", "given_name": "Julian J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Heaton", "given_name": "Thomas H.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Chandy", "given_name": "Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" } ], "abstract": "The Community Seismic Network\u2010Los Angeles Unified School District is a network of 300 low\u2010cost microelectromechanical systems accelerometers located in schools in the Los Angeles, California, region. They are capable of accurately recording strong motion up to \u00b12g and are sufficiently spatially dense that they provide unaliased measurements of strong motions up to 1 Hz following a major earthquake. They are used to provide state\u2010of\u2010health monitoring for the schools and surrounding communities to guide the emergency response. As a research tool, they can be used to provide estimates of the site response at the schools and, therefore, provide a much denser set of site responses for ground\u2010motion prediction than is currently available.", "doi": "10.1785/0220190200", "issn": "0895-0695", "publisher": "Seismological Society of America", "publication": "Seismological Research Letters", "publication_date": "2020-03-01", "series_number": "2A", "volume": "91", "issue": "2A", "pages": "622-630" }, { "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:eyaa6-hf002", "collection": "authors", "collection_id": "eyaa6-hf002", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180713-133233514", "type": "conference_item", "title": "Community seismic network and localized earthquake situational awareness", "author": [ { "family_name": "Kohler", "given_name": "M. D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Guy", "given_name": "R.", "clpid": "Guy-R" }, { "family_name": "Bunn", "given_name": "J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Massari", "given_name": "A.", "orcid": "0000-0002-6561-4674", "clpid": "Massari-A" }, { "family_name": "Clayton", "given_name": "R.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Heaton", "given_name": "T.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Chandy", "given_name": "K. M.", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" }, { "family_name": "Ebrahimian", "given_name": "H.", "clpid": "Ebrahimian-H" }, { "family_name": "Dorn", "given_name": "C.", "orcid": "0000-0001-6516-2586", "clpid": "Dorn-C" } ], "abstract": "Community-hosted seismic networks are a solution to the need for large numbers of sensors to operate over a seismically active region in order to accurately measure the size and location of an earthquake, assess resulting damage, and provide alerts. The Community Seismic Network is one such strong-motion network, currently comprising hundreds of elements located in California. It consists of low-cost, three-component, MEMS accelerometers capable of recording accelerations up to twice the level of gravity. The primary product of the network is to produce measurements of shaking of the ground and multiple locations of every upper floor in buildings, in the seconds during and following a major earthquake. Each sensor uses a small, dedicated ARM processor computer running Linux, and analyzes time series data in real time at hundreds of samples per second. The network reports on shaking parameters that indicate intensity of the structural response levels such as maximum floor acceleration and velocity, displacement of a floor in a building, as well as data products that depend on the response time histories. To do this, Cloud computing has been expanded through the use of statically defined subsets of sensors called cloudlets. These are smaller subsets of similar sensors that carry out customized calculations for those locations. The measurements are reported as rapidly as possible following an earthquake so that they may be incorporated into structural diagnosis and prognosis applications that can be used by first responders to prioritize their initial disaster management efforts. The cloudlet displays are customized for specific buildings and they show in real time: instantaneous displacement, inter-story drift, and resonant frequency and mode shapes using system identification software tools. The real-time display products are useful for decision-making about whether the potential for damage exists, what level of damage may have occurred and where, and whether total business disruption is necessary. City-wide dense monitoring makes it possible for emergency response managers to prioritize the target locations requiring first response on a block-by-block scale based on reports of shaking intensity.", "publication_date": "2018-06" }, { "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:kmdpr-3pb02", "collection": "authors", "collection_id": "kmdpr-3pb02", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170127-163202195", "type": "conference_item", "title": "Dense Building Instrumentation Application for City-Wide Structural Health Monitoring", "author": [ { "family_name": "Massari", "given_name": "A.", "orcid": "0000-0002-6561-4674", "clpid": "Massari-A" }, { "family_name": "Kohler", "given_name": "M.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Clayton", "given_name": "R.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Guy", "given_name": "R.", "clpid": "Guy-R" }, { "family_name": "Heaton", "given_name": "T.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Bunn", "given_name": "J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Demetri", "given_name": "D.", "clpid": "Demetri-D" } ], "abstract": "The Community Seismic Network (CSN) has partnered with the NASA Jet Propulsion Laboratory (JPL) to initiate a campus-wide structural monitoring program of all buildings on the premises. The JPL campus serves as a proxy for a densely instrumented urban city with localized vibration measurements collected throughout the free-field and built environment. Instrumenting the entire campus provides dense measurements in a horizontal geospatial sense for soil response; in addition five buildings have been instrumented on every floor of the structure. Each building has a unique structural system as well as varied amounts of structural information via structural drawings, making several levels of assessment and evaluation possible. Computational studies with focus on damage detection applied to the campus structural network are demonstrated for a collection of buildings. For campus-wide real-time and post-event evaluation, ground and building response products using CSN data are illustrating the usefulness of higher spatial resolution compared to what was previously typical with sparser instrumentation.", "publication_date": "2017-01-28" }, { "id": "authors:ch58y-08r59", "collection": "authors", "collection_id": "ch58y-08r59", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160705-133353269", "type": "article", "title": "Downtown Los Angeles 52-Story High-Rise and Free-Field Response to an Oil Refinery Explosion", "author": [ { "family_name": "Kohler", "given_name": "Monica D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Massari", "given_name": "Anthony", "orcid": "0000-0002-6561-4674", "clpid": "Massari-A" }, { "family_name": "Heaton", "given_name": "Thomas H.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Kanamori", "given_name": "Hiroo", "orcid": "0000-0001-8219-9428", "clpid": "Kanamori-H" }, { "family_name": "Hauksson", "given_name": "Egill", "orcid": "0000-0002-6834-5051", "clpid": "Hauksson-E" }, { "family_name": "Guy", "given_name": "Richard", "orcid": "0000-0002-8651-5608", "clpid": "Guy-R" }, { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Bunn", "given_name": "Julian J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Chandy", "given_name": "K. M.", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" } ], "abstract": "The ExxonMobil Corp. oil refinery in Torrance, California experienced an explosion on February 18, 2015 causing ground shaking equivalent to a magnitude 2.0 earthquake. The impulse response for the source was computed from Southern California Seismic Network data for a single force system with a value of 2\u00d710^5 kN vertically downward. The refinery explosion produced an air pressure wave that was recorded 22.8 km away in a 52-story high-rise building in downtown Los Angeles by a dense accelerometer array that is a component of the Community Seismic Network. The array recorded anomalous waveforms on each floor displaying coherent arrivals that are consistent with the building's elastic response to a pressure wave caused by the refinery explosion. Using a finite-element model of the building, the force on the building on a floor-by-floor scale was found to range up to 1.42 kN, corresponding to a pressure perturbation of 7.7 Pa.", "doi": "10.1193/062315EQS101M", "issn": "8755-2930", "publisher": "Earthquake Engineering Research Institute", "publication": "Earthquake Spectra", "publication_date": "2016-08-01", "series_number": "3", "volume": "32", "issue": "3", "pages": "1793-1820" }, { "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:5h1p1-dnz43", "collection": "authors", "collection_id": "5h1p1-dnz43", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-100823060", "type": "article", "title": "Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow", "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 proves that nonconvex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. We demonstrate this theory on optimal power-flow problems over tree networks.", "doi": "10.1109/TCNS.2015.2401172", "issn": "2325-5870", "publisher": "IEEE", "publication": "IEEE Transactions on Control of Network Systems", "publication_date": "2015-09", "series_number": "3", "volume": "2", "issue": "3", "pages": "278-287" }, { "id": "authors:c96wg-85x76", "collection": "authors", "collection_id": "c96wg-85x76", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20151012-154950185", "type": "article", "title": "Community Seismic Network: A Dense Array to Sense Earthquake Strong Motion", "author": [ { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Heaton", "given_name": "Thomas H.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Kohler", "given_name": "Monica D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Chandy", "given_name": "Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" }, { "family_name": "Guy", "given_name": "Richard", "orcid": "0000-0002-8651-5608", "clpid": "Guy-Richard" }, { "family_name": "Bunn", "given_name": "Julian J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" } ], "abstract": "The Community Seismic Network (CSN) is currently a 500\u2010element strong\u2010motion network located in the Los Angeles area of California (see Fig. 1). The sensors in the network are low\u2010cost microelectromechanical (MEM) accelerometers that are capable of recording on scale up to accelerations of \u00b12g. The primary product of the network is a set of measurements of ground shaking in the seconds following a major earthquake. An example of this is shown in Figure 2. The shaking information will be contributed to U.S. Geological Survey products such as ShakeMap (Wald et al., 1999) and ShakeCast (Wald et al., 2006), with the goal of providing first responders a proxy for damage that can guide efforts immediately following the event. The basic premise is the strong ground\u2010motion shaking varies on a subkilometer scale, which will require a dense network to meaningfully measure the shaking. Evidence for this comes from earthquakes recorded by dense oil company surveys in the Los Angeles area (Clayton et al., 2011).", "doi": "10.1785/0220150094", "issn": "0895-0695", "publisher": "Seismological Society of America", "publication": "Seismological Research Letters", "publication_date": "2015-09", "series_number": "5", "volume": "86", "issue": "5", "pages": "1354-1363" }, { "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:06xvj-bp732", "collection": "authors", "collection_id": "06xvj-bp732", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140819-131736568", "type": "article", "title": "Community Sense and Response Systems: Your Phone as Quake Detector", "author": [ { "family_name": "Faulkner", "given_name": "Matthew", "clpid": "Faulkner-Matthew-Nicholas" }, { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Heaton", "given_name": "Thomas H.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Chandy", "given_name": "K. Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" }, { "family_name": "Kohler", "given_name": "Monica D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Bunn", "given_name": "Julian J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Guy", "given_name": "Richard", "orcid": "0000-0002-8651-5608", "clpid": "Guy-R" }, { "family_name": "Liu", "given_name": "Annie", "clpid": "Liu-Annie-H" }, { "family_name": "Olson", "given_name": "Michael", "clpid": "Olson-M" }, { "family_name": "Cheng", "given_name": "Ming-Hei", "clpid": "Cheng-Ming-Hei" }, { "family_name": "Krause", "given_name": "Andreas", "orcid": "0000-0001-7260-9673", "clpid": "Krause-A" } ], "abstract": "The proliferation of smartphones and other powerful sensor-equipped consumer devices enables a new class of Web application: community sense and response (CSR) systems, distinguished from standard Web applications by their use of community-owned commercial sensor hardware. Just as social networks connect and share human-generated content, CSR systems gather, share, and act on sensory data from users' Internet-enabled devices. Here, we discuss the Caltech Community Seismic Network (CSN) as a prototypical CSR system harnessing accelerometers in smartphones and consumer electronics, including the systems and algorithmic challenges of designing, building, and evaluating a scalable network for real-time awareness of dangerous earthquakes.", "doi": "10.1145/2622633", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "2014-07", "series_number": "7", "volume": "57", "issue": "7", "pages": "66-75" }, { "id": "authors:cnzr3-x6138", "collection": "authors", "collection_id": "cnzr3-x6138", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140811-131704662", "type": "article", "title": "The Caltech CSN project collects sensor data from thousands of personal devices for realtime response to dangerous earthquakes", "author": [ { "family_name": "Faulkner", "given_name": "Matthew Nicholas", "clpid": "Faulkner-Matthew-Nicholas" }, { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Heaton", "given_name": "Thomas H.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Chandy", "given_name": "K. Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" }, { "family_name": "Kohler", "given_name": "Monica D.", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Bunn", "given_name": "Julian J.", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Guy", "given_name": "Richard", "orcid": "0000-0002-8651-5608", "clpid": "Guy-R" }, { "family_name": "Liu", "given_name": "Annie", "clpid": "Liu-Annie-H" }, { "family_name": "Olson", "given_name": "Michael", "clpid": "Olson-M" }, { "family_name": "Cheng", "given_name": "MingHei", "clpid": "Cheng-Ming-Hei" }, { "family_name": "Krause", "given_name": "Andreas", "orcid": "0000-0001-7260-9673", "clpid": "Krause-A" } ], "abstract": "The proliferation of smartphones and other powerful sensor-equipped consumer devices enables a new class of Web application: community sense and response (CSR) systems, distinguished from standard Web applications by their use of community-owned commercial sensor hardware. Just as social networks connect and share human-generated content, CSR systems gather, share, and act on sensory data from users' Internet-enabled devices. Here, we discuss the Caltech Community Seismic Network (CSN) as a prototypical CSR system harnessing accelerometers in smartphones and consumer electronics, including the systems and algorithmic challenges of designing, building, and evaluating a scalable network for real-time awareness of dangerous earthquakes.", "doi": "10.1145/2622633", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "2014-07", "series_number": "7", "volume": "57", "issue": "7", "pages": "66-75" }, { "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:r68eb-k0712", "collection": "authors", "collection_id": "r68eb-k0712", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131213-111904382", "type": "article", "title": "Impact of residential PV adoption on Retail Electricity Rates", "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": "Low", "given_name": "Steven H.", "orcid": "0000-0001-6476-3048", "clpid": "Low-S-H" }, { "family_name": "De Martini", "given_name": "Paul", "clpid": "De-Martini-P" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "The price of electricity supplied from home rooftop photo voltaic (PV) solar cells has fallen below the retail price of grid electricity in some areas. A number of residential households have an economic incentive to install rooftop PV systems and reduce their purchases of electricity from the grid. A significant portion of the costs incurred by utility companies are fixed costs which must be recovered even as consumption falls. Electricity rates must increase in order for utility companies to recover fixed costs from shrinking sales bases. Increasing rates will, in turn, result in even more economic incentives for customers to adopt rooftop PV. In this paper, we model this feedback between PV adoption and electricity rates and study its impact on future PV penetration and net-metering costs. We find that the most important parameter that determines whether this feedback has an effect is the fraction of customers who adopt PV in any year based solely on the money saved by doing so in that year, independent of the uncertainties of future years. These uncertainties include possible changes in rate structures such as the introduction of connection charges, the possibility of PV prices dropping significantly in the future, possible changes in tax incentives, and confidence in the reliability and maintainability of PV.", "doi": "10.1016/j.enpol.2013.07.009", "issn": "0301-4215", "publisher": "Elsevier", "publication": "Energy Policy", "publication_date": "2013-11", "volume": "62", "pages": "830-843" }, { "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:9e78n-7cc47", "collection": "authors", "collection_id": "9e78n-7cc47", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131010-162127988", "type": "monograph", "title": "Grid 2020: Towards a Policy of Renewable and Distributed Energy Resources", "author": [ { "family_name": "De Martini", "given_name": "Paul", "clpid": "De-Martini-P" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Fromer", "given_name": "N. A.", "clpid": "Fromer-N-A" } ], "abstract": "Caltech's Resnick Sustainability Institute fosters transformational\nadvances in energy science and technology through research, education\nand communication. Through its activities, the Institute strives to identify\nand address the most important outstanding challenges and issues in the\ngeneration, storage, transmission, conversion and conservation of energy.\nTo this end, the Institute provides leadership in brokering discussions on\nenergy and sustainability issues among panels of international experts in\ngovernment, academia, and industry. As part of its outreach, the Institute\nissues summary reports documenting these compelling events.\nThe Resnick Institute is solely responsible for the content of this report. The\nviews expressed herein do not necessarily reflect the views of participants\nin these discussions. This report has been independently prepared by the\nResnick Institute to support our efforts to communicate critical energy\nissues to a broad range of stakeholders.\nWe would like to thank the experts who contributed time and information\nfor their willingness to engage in the candid discussions and debate that\ninformed this report.", "publisher": "Caltech Library", "publication_date": "2012" }, { "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:ybd4q-73m56", "collection": "authors", "collection_id": "ybd4q-73m56", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20110929-135751977", "type": "article", "title": "Verification of distributed systems with local\u2013global predicates", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Go", "given_name": "Brian", "clpid": "Go-B" }, { "family_name": "Mitra", "given_name": "Sayan", "clpid": "Mitra-S" }, { "family_name": "Pilotto", "given_name": "Concetta", "clpid": "Pilotto-C" }, { "family_name": "White", "given_name": "Jerome", "clpid": "White-J" } ], "abstract": "This paper describes a methodology for developing and verifying a class of distributed systems inwhich\nthe state space may be discrete or continuous. Our focus is on systems where changes are local in that a small\nnumber of components change state while the remainder of the system is unchanged. A proof methodology is\ndeveloped that ensures global properties, such as invariants and convergence, by guaranteeing local properties\nwithin subsystems. This methodology is used to prove the correctness of concrete examples. We present a PVS\nlibrary of theorems and proofs that can be used to reduce the work required to develop and verify programs in\nthis class. A transformation of these libraries to Java is also outlined.", "doi": "10.1007/s00165-010-0150-7", "issn": "0934-5043", "publisher": "Springer", "publication": "Formal Aspects of Computing", "publication_date": "2011-09", "series_number": "5", "volume": "23", "issue": "5", "pages": "649-679" }, { "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: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: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:rnqrr-5y876", "collection": "authors", "collection_id": "rnqrr-5y876", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120213-121753118", "type": "article", "title": "Community Seismic Network", "author": [ { "family_name": "Clayton", "given_name": "Robert W.", "orcid": "0000-0003-3323-3508", "clpid": "Clayton-R-W" }, { "family_name": "Heaton", "given_name": "Thomas H.", "orcid": "0000-0003-3363-2197", "clpid": "Heaton-T-H" }, { "family_name": "Chandy", "given_name": "Mani", "orcid": "0000-0001-9190-1290", "clpid": "Chandy-K-M" }, { "family_name": "Krause", "given_name": "R. Andreas", "orcid": "0000-0001-7260-9673", "clpid": "Krause-R-Andreas" }, { "family_name": "Kohler", "given_name": "Monica", "orcid": "0000-0002-4703-190X", "clpid": "Kohler-M-D" }, { "family_name": "Bunn", "given_name": "Julian", "orcid": "0000-0002-3798-298X", "clpid": "Bunn-J" }, { "family_name": "Guy", "given_name": "Richard", "clpid": "Guy-R" }, { "family_name": "Olson", "given_name": "Michael", "clpid": "Olson-Michael-James" }, { "family_name": "Faulkner", "given_name": "Matthew", "clpid": "Faulkner-Matthew-Nicholas" }, { "family_name": "Cheng", "given_name": "MingHei", "clpid": "Cheng-Ming-Hei" }, { "family_name": "Strand", "given_name": "Leif", "clpid": "Strand-L" }, { "family_name": "Chandy", "given_name": "Rishi", "clpid": "Chandy-R" }, { "family_name": "Obenshain", "given_name": "Daniel", "clpid": "Obenshain-D" }, { "family_name": "Liu", "given_name": "Annie", "clpid": "Liu-Annie-Hsin-Wen" }, { "family_name": "Aivazis", "given_name": "Michael", "clpid": "Aivazis-M" } ], "abstract": "The article describes the design of the Community Seismic Network, which is a dense open seismic network based on low cost sensors. The inputs are from sensors hosted by volunteers from the community by direct connection to their personal computers, or through sensors built into mobile devices. The server is cloud-based for robustness and to dynamically handle the load of impulsive earthquake events. The main product of the network is a map of peak acceleration, delivered within seconds of the ground shaking. The lateral variations in the level of shaking will be valuable to first responders, and the waveform information from a dense network will allow detailed mapping of the rupture process. Sensors in buildings may be useful for monitoring the state-of-health of the structure after major shaking.", "doi": "10.4401/ag-5269", "issn": "1593-5213", "publisher": "Istituto Nazionale di Geofisica e Vulcanologia", "publication": "Annals of Geophysics", "publication_date": "2011", "series_number": "6", "volume": "54", "issue": "6", "pages": "738-747" }, { "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:d3knq-mcm54", "collection": "authors", "collection_id": "d3knq-mcm54", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20110407-094212599", "type": "article", "title": "The Impact of Sense and Respond Systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "Sense and respond (S&R) systems based on information technology amplify one of the most fundamental characteristics of life \u2014 the ability to detect and respond to events. Living things thrive when they respond effectively to what's going on in their environments. A zebra that doesn't run away from a hungry lion dies and one that runs away unnecessarily wears out. Organizations sense and respond collectively: lions in a pride signal each other when they hunt; societies deal with crises by harnessing capabilities of governments, charities, and\nindividuals. When our ancestors hunted millennia ago, they saw as far as the eye could see and threw spears as far as their muscles let them. Today, S&R systems let us detect events far out in space and respond anywhere on the globe.\nBy 2020, S&R systems will become an integral part of the activities of people and organizations around the world whether they're rich or poor, in farming or medicine, at work or at play.", "doi": "10.1109/MIC.20", "issn": "1089-7801", "publisher": "IEEE", "publication": "IEEE Internet Computing", "publication_date": "2010-01", "series_number": "1", "volume": "14", "issue": "1", "pages": "14-16" }, { "id": "authors:7zhvp-6as34", "collection": "authors", "collection_id": "7zhvp-6as34", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170309-150535053", "type": "article", "title": "The Impact of Sense and Response Systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "Sense and respond (S&R) systems based on information technology amplify one of the most fundamental characteristics of life \u2014 the ability to detect and respond to events. Living things thrive when they respond effectively to what's going on in their environments. \nA zebra that doesn't run away from a hungry \nlion dies and one that runs away unnecessarily \nwears out. Organizations sense and respond collectively: lions in a pride signal each other when they hunt; societies deal with crises by harnessing capabilities of governments, charities, and individuals. When our ancestors hunted millennia ago, they saw as far as the eye could see and threw spears as far as their muscles let them. \nToday, S&R systems let us detect events far out \nin space and respond anywhere on the globe. \nBy 2020, S&R systems will become an integral \npart of the activities of people and organizations around the world whether they're rich or \npoor, in farming or medicine, at work or at play.", "doi": "10.1109/MIC.2010.12", "issn": "1089-7801", "publisher": "IEEE", "publication": "IEEE Internet Computing", "publication_date": "2010-01", "series_number": "1", "volume": "14", "issue": "1", "pages": "14-16" }, { "id": "authors:nfnff-jr960", "collection": "authors", "collection_id": "nfnff-jr960", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20100202-112121782", "type": "article", "title": "Internet Predictions", "author": [ { "family_name": "Estrin", "given_name": "Deborah", "clpid": "Estrin-D" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Young", "given_name": "R. Michael", "clpid": "Young-R-M" }, { "family_name": "Smarr", "given_name": "Larry", "clpid": "Smarr-L" }, { "family_name": "Odlyzko", "given_name": "Andrew", "clpid": "Odlyzko-A" }, { "family_name": "Clark", "given_name": "David", "clpid": "Clark-D" }, { "family_name": "Reding", "given_name": "Viviane", "clpid": "Reding-V" }, { "family_name": "Ishida", "given_name": "Toru", "clpid": "Ishida-T" }, { "family_name": "Sharma", "given_name": "Sharad", "clpid": "Sharma-Sharad" }, { "family_name": "Cerf", "given_name": "Vinton G.", "clpid": "Cerf-V-G" }, { "family_name": "H\u00f6lzle", "given_name": "Urs", "clpid": "H\u00f6lzle-U" }, { "family_name": "Barroso", "given_name": "Luiz Andr\u00e9", "clpid": "Barroso-L-A" }, { "family_name": "Mulligan", "given_name": "Geoff", "clpid": "Mulligan-G" }, { "family_name": "Hooke", "given_name": "Adrian", "clpid": "Hooke-A" }, { "family_name": "Elliott", "given_name": "Chip", "clpid": "Elliott-C" } ], "abstract": "More than a dozen leading experts give their opinions on where the Internet is headed and where it will be in the next decade in terms of technology, policy, and applications. They cover topics ranging from the Internet of Things to climate change to the digital storage of the future. A summary of the articles is available in the Web extras section.", "doi": "10.1109/MIC.2010.12", "issn": "1089-7801", "publisher": "IEEE", "publication": "IEEE Internet Computing", "publication_date": "2010-01", "series_number": "1", "volume": "14", "issue": "1", "pages": "12-42" }, { "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: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: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: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:ebzp5-b3856", "collection": "authors", "collection_id": "ebzp5-b3856", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:2006.002", "type": "monograph", "title": "Predicate Signaling in Distributed Sensor Networks", "author": [ { "family_name": "Capponi", "given_name": "Agostino", "clpid": "Capponi-A" }, { "family_name": "Chandy", "given_name": "Mani", "clpid": "Chandy-K-M" }, { "family_name": "Fatkullin", "given_name": "Ibrahim", "clpid": "Fatkullin-I" } ], "abstract": "Nodes in a sensor network can generate messages periodically, or when anomalies are detected, or when queried by other nodes. In this paper we propose a strategy called predicate signaling that generalizes these schemes by generating messages when specified predicates - that can deal with both time and anomalies - hold. We show how power consumption, message generation rates and estimation errors can be controlled by choosing predicates appropriately. We compare predicate signaling with other schemes. We derive formulas based on stochastic differential equations to estimate performance measures in predicate signaling. We analyze measurement data, and we compare simulations based on measured data with results predicted by our theory.", "doi": "10.7907/Z9Z899D5", "publisher": "California Institute of Technology", "publication_date": "2006-01-13" }, { "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: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:389ex-cjb75", "collection": "authors", "collection_id": "389ex-cjb75", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:2005.004", "type": "monograph", "title": "Stream Processing Algorithms that model behavior changes", "author": [ { "family_name": "Capponi", "given_name": "Agostino", "clpid": "Capponi-A" }, { "family_name": "Chandy", "given_name": "Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper presents algorithms that fuse information in\nmultiple event streams to update models that represent system behavior. System behaviors vary over time; for example, an information network varies from heavily loaded to lightly loaded conditions; patterns of incidence of disease change at the onset of pandemics; file access patterns change from proper usage to improper use that may signify insider threat. The models that represent behavior must be updated frequently to adapt to changes rapidly; in the limit, models must be updated continuously with each new event. Algorithms that adapt to change in behavior must\n depend on the appropriate length of history: Algorithms that give too much weight to the distant past will not adapt to changes in behavior rapidly; algorithms that don't consider enough past information may conclude incorrectly, from noisy data, that behavior has changed while the actual behavior remains unchanged.\n Efficient algorithms are incremental -- the computational time required to incorporate each new event should be small and ideally independent of the length of the history.", "doi": "10.7907/Z99K487T", "publisher": "California Institute of Technology", "publication_date": "2005-02-13" }, { "id": "authors:01nck-ntz85", "collection": "authors", "collection_id": "01nck-ntz85", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190829-131532981", "type": "article", "title": "Specification transformers: a predicate transformer approach to composition", "author": [ { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and the composition operator, and (ii) deducing desirable properties of components from the system specification and properties of the composition operator. The paper studies compositional systems in general without making assumptions that components are computer programs. The results obtained from such abstract representations are general but also weaker than results that can be obtained from more restrictive assumptions such as assuming that systems are parallel compositions of concurrent programs. Explorations of general theories of composition can help identify fundamental issues common to many problem domains. The theory presented here is based on predicate transformers.", "doi": "10.1007/s00236-003-0130-y", "issn": "0001-5903", "publisher": "Springer-Verlag", "publication": "Acta Informatica", "publication_date": "2004-02", "series_number": "4", "volume": "40", "issue": "4", "pages": "265-301" }, { "id": "authors:rrc2c-r7j16", "collection": "authors", "collection_id": "rrc2c-r7j16", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191112-111040108", "type": "article", "title": "An Experiment in Program Composition and Proof", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" } ], "abstract": "This paper explores a compositional approach to program specification, development and proof. We apply a theory of composition to a problem in distributed computing with the goal of understanding the strengths and weaknesses of this compositional approach. First, we describe the theory briefly. Then we give a specification of a desired system. Next, we propose a design of the desired system as a composition of components and prove its correctness. Finally, we show how the proof can be reused for a slightly different compositional structure by using the concept of observation.", "doi": "10.1023/a:1012952311559", "issn": "0925-9856", "publisher": "Springer", "publication": "Formal Methods in System Design", "publication_date": "2002-01", "series_number": "1", "volume": "20", "issue": "1", "pages": "7-21" }, { "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:dwgkc-29h22", "collection": "authors", "collection_id": "dwgkc-29h22", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:2000.cs-tr-00-02", "type": "monograph", "title": "Theorems about Composition", "author": [ { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "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.7907/Z9BK19C6", "publisher": "California Institute of Technology", "publication_date": "2000-01-05" }, { "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:92gk0-hta06", "collection": "authors", "collection_id": "92gk0-hta06", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1999.cs-tr-99-02", "type": "monograph", "title": "Towards a Compositional Approach to the Design and Verification of Distributed Systems", "author": [ { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "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.7907/Z93R0QW2", "publisher": "California Institute of Technology", "publication_date": "1999-01-01" }, { "id": "authors:pk6na-bj384", "collection": "authors", "collection_id": "pk6na-bj384", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1999.cs-tr-99-01", "type": "monograph", "title": "Examples of Program Composition Illustrating the Use of Universal Properties", "author": [ { "family_name": "Charpentier", "given_name": "Michel", "clpid": "Charpentier-M" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper uses a theory of composition based on existential and universal properties. Universal properties axe 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.7907/Z9ZC80WC", "publisher": "California Institute of Technology", "publication_date": "1999-01-01" }, { "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:bvsmx-njk68", "collection": "authors", "collection_id": "bvsmx-njk68", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170409-080717471", "type": "article", "title": "Using announce-listen with global events to develop distributed control systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" }, { "family_name": "Schooler", "given_name": "Eve", "clpid": "Schooler-E-M" } ], "abstract": "We specify an abstract model for dynamic distributed control systems in which the component objects make local decisions based on system\u2010wide constraints and approximate global state. We focus on the issue of distributed resource management, exploring a solution that is both compositional and scalable because it builds global events into the Java infrastructure by exploiting its multicast facilities.", "doi": "10.1002/(SICI)1096-9128(199809/11)10:11/13%3C1021::AID-CPE411%3E3.0.CO;2-K", "issn": "1532-0626", "publisher": "Wiley", "publication": "Concurrency and Computation: Practice and Experience", "publication_date": "1998-09", "series_number": "11-13", "volume": "10", "issue": "11-13", "pages": "1021-1027" }, { "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:hz17w-cpk10", "collection": "authors", "collection_id": "hz17w-cpk10", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140701-112530382", "type": "article", "title": "Webs of Archived Distributed Computations for Asynchronous Collaboration", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Kiniry", "given_name": "Joseph", "orcid": "0000-0002-3589-2454", "clpid": "Kiniry-J-R" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" }, { "family_name": "Zimmerman", "given_name": "Daniel", "clpid": "Zimmerman-D-M" } ], "abstract": "We identify the mechanisms needed to construct archivable webs of distributed asynchronous collaborations and experiments. The distinguishing feature of our approach is that the component tools, software, data, and even participants are distributed over a worldwide network. We perform a requirements analysis of an infrastructure that supports such applications, and present the Caltech Infospheres Infrastructure as a prototype that satisfies the requirements identified. In describing this prototype, we highlight the useful mechanisms provided, present an algorithm for using the Infospheres Infrastructure to perform asynchronous global snapshots for archiving, and suggest future areas of exploration.", "doi": "10.1023/A:1007903821879", "issn": "0920-8542", "publisher": "Springer Verlag", "publication": "Journal of Supercomputing", "publication_date": "1997-10-01", "series_number": "2", "volume": "11", "issue": "2", "pages": "101-118" }, { "id": "authors:314q7-4rp75", "collection": "authors", "collection_id": "314q7-4rp75", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:CHAcj97", "type": "article", "title": "Systematic composition of distributed objects: Processes and sessions", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" } ], "abstract": "We consider a system with the infrastructure for the creation and interconnection of large numbers of distributed persistent objects. This system is exemplified by the Internet: potentially, every appliance and document on the Internet has both persistent state and the ability to interact with large numbers of other appliances and documents on the Internet. This paper elucidates the characteristics of such a system, and proposes the compositional requirements of its corresponding infrastructure. We explore the problems of specifying, composing, reasoning about and implementing applications in such a system. A specific concern of our research is developing the infrastructure to support structuring distributed applications by using sequential, choice and parallel composition, in the anarchic environment where application compositions may be unforeseeable and interactions may be unknown prior to actually occurring. The structuring concepts discussed are relevant to a wide range of distributed applications; our implementation is illustrated with collaborative Java processes interacting over the Internet, but the methodology provided can be applied independent of specific platforms.", "doi": "10.1093/comjnl/40.8.465", "issn": "0010-4620", "publisher": "Computer Journal", "publication": "Computer Journal", "publication_date": "1997-08-01", "series_number": "8", "volume": "40", "issue": "8", "pages": "465-478" }, { "id": "authors:73y21-h0483", "collection": "authors", "collection_id": "73y21-h0483", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1997.cs-tr-97-07", "type": "monograph", "title": "A Framework for Structured Distributed Object Computing", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Kiniry", "given_name": "Joseph", "orcid": "0000-0002-3589-2454", "clpid": "Kiniry-J-R" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" }, { "family_name": "Zimmerman", "given_name": "Daniel", "clpid": "Zimmerman-D-M" }, { "family_name": "Tanaka", "given_name": "Wesley", "clpid": "Tanaka-W" }, { "family_name": "Weisman", "given_name": "Luke", "clpid": "Weisman-L" } ], "abstract": "This paper presents a four-faceted framework for distributed applications that use worldwide networks connecting large numbers of people, software tools, monitoring instruments, and control devices. We describe a class of applications, identify requirements for a framework that supports these applications, and propose a design fulfilling those requirements. We discuss some initial experiences using the framework, and compare our design with other approaches.", "doi": "10.7907/Z9JQ0Z2W", "publisher": "California Institute of Technology", "publication_date": "1997-01-01" }, { "id": "authors:wa67z-4r992", "collection": "authors", "collection_id": "wa67z-4r992", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1997.cs-tr-97-19", "type": "monograph", "title": "A General Resource Reservation Framework for Scientific Computing", "author": [ { "family_name": "Ramamoorthi", "given_name": "Ravi", "clpid": "Ramamoorthi-Ravi" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" }, { "family_name": "Dimitrov", "given_name": "Boris", "clpid": "Dimitrov-B" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "We describe three contributions for distributed resource allocation in scientific applications. First, we present an abstract model in which different resources are represented as tokens of different colors; processes acquire resources by acquiring these tokens. Second, we present distributed scheduling algorithms that allow multiple resource managers to determine custom policies to control allocation of the tokens representing their particular resources. These algorithms allow multiple resource managers, each with its own resource management policy, to collaborate in providing resources for the whole system. Third, we present an implementation of a distributed resource scheduling algorithm framework using our abstract model. This implementation uses Infospheres, which are Internet communication packages written in Java, and shows the benefits of distributing the task of resource allocation to multiple resource managers.", "doi": "10.7907/Z9DZ06BJ", "publisher": "California Institute of Technology", "publication_date": "1997-01-01" }, { "id": "authors:dqpbx-g4b39", "collection": "authors", "collection_id": "dqpbx-g4b39", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1997.cs-tr-97-10", "type": "monograph", "title": "Webs of Archived Distributed Computations for Asynchronous Collaboration", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" }, { "family_name": "Kiniry", "given_name": "Joseph", "orcid": "0000-0002-3589-2454", "clpid": "Kiniry-J-R" }, { "family_name": "Zimmerman", "given_name": "Daniel", "clpid": "Zimmerman-D-M" } ], "abstract": "We identify the mechanisms needed to construct archivable webs of distributed asynchronous collaborations and experiments. The distinguishing feature of our approach is that the component tools, software, data, and even participants are distributed over a worldwide network. We perform a requirements analysis of an infrastructure that supports such applications, and present the Caltech Infospheres Infrastructure as a prototype that satisfies the requirements identified. In describing this prototype, we highlight the useful mechanisms provided, present an algorithm for using the lnfospheres Infrastructure to perform asynchronous global snapshots for archiving, and suggest future areas of exploration.", "doi": "10.7907/Z9R78C75", "publisher": "California Institute of Technology", "publication_date": "1997-01-01" }, { "id": "authors:7ycpz-wz703", "collection": "authors", "collection_id": "7ycpz-wz703", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1997.cs-tr-96-28", "type": "monograph", "title": "Parallel Program Archetypes", "author": [ { "family_name": "Massingill", "given_name": "Berna L.", "clpid": "Massingill-B-L" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "A parallel program archetype is an abstraction that captures the common features of a class of problems with similar computational structure and combines them with a parallelization strategy to produce a pattern of dataflow and communication. Such abstractions are useful in application development, both as a conceptual framework and as a basis for tools and techniques. This paper describes an approach to parallel application development based on archetypes and presents two example archetypes with applications.", "doi": "10.7907/Z9WW7FP7", "publisher": "California Institute of Technology", "publication_date": "1997-01-01" }, { "id": "authors:x0j0a-7hf56", "collection": "authors", "collection_id": "x0j0a-7hf56", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140701-135237680", "type": "article", "title": "Systematic Composition of Objects in Distributed Internet Applications: Processes and Sessions", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" } ], "abstract": "We consider a system with the infrastructure for the\ncreation and interconnection of large numbers of distributed\npersistent objects. This system is exemplified by the Internet: potentially, every appliance and document on the Internet has both persistent state and the ability to interact with large numbers of other appliances and documents on the Internet. This paper elucidates the characteristics of such a system, and proposes the compositional requirements of its corresponding infrastructure. We explore the problems of specifying,\ncomposing, reasoning about, and implementing applications in such a system. A specific concern of our research is developing the infrastructure to support structuring distributed applications by using sequential, choice, and parallel composition, in the anarchic environment where application compositions may be unforeseeable, and interactions may be unknown prior to actually occurring. The structuring concepts discussed are relevant to a wide range of distributed applications; our implementation is illustrated with collaborative Java processes interacting over the Internet, but the methodology provided can be applied independent of specific platforms.", "doi": "10.1109/HICSS.1997.667288", "issn": "1060-3425", "publisher": "IEEE", "publication": "Proceedings of the Annual Hawaii International Conference on System Sciences", "publication_date": "1997-01", "volume": "1", "pages": "395-404" }, { "id": "authors:rp6tp-vvv84", "collection": "authors", "collection_id": "rp6tp-vvv84", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1996.cs-tr-96-11", "type": "monograph", "title": "Reliable Synchronization Primitives for Java", "author": [ { "family_name": "Sivilotti", "given_name": "Paolo A. G.", "clpid": "Sivilotti-P-A-G" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "Java is an architecture-independent, object-oriented language designed to facilitate code-sharing across the Internet in general, via the Web in particular. Java is multithreaded, providing thread creation and synchronization constructs based on generalized monitors. Although these primitives are appropriate for many windowing applications, they are not necessarily well-suited for the larger class of multithreaded programs that occur as part of distributed systems. We demonstrate how the Java primitives, in conjunction with the object-oriented aspects of the language, can be used to implement a collection of other traditional synchronization paradigms. These paradigms are formally specified, their implementations are rigorously verified, and their use is illustrated with several examples.", "doi": "10.7907/Z9P55KHS", "publisher": "California Institute of Technology", "publication_date": "1996-06-01" }, { "id": "authors:xbc5j-67149", "collection": "authors", "collection_id": "xbc5j-67149", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1996.cs-tr-96-08", "type": "monograph", "title": "A World-Wide Distributed System Using Java and the Internet", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Dimitrov", "given_name": "Boris", "clpid": "Dimitrov-B" }, { "family_name": "Le", "given_name": "Huy", "clpid": "Le-Huy" }, { "family_name": "Mandelson", "given_name": "Jakob", "clpid": "Mandelson-J" }, { "family_name": "Richardson", "given_name": "Matthew", "clpid": "Richardson-M" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" }, { "family_name": "Sivilotti", "given_name": "Paolo A. G.", "clpid": "Sivilotti-P-A-G" }, { "family_name": "Tanaka", "given_name": "Wesley", "clpid": "Tanaka-Wesley" }, { "family_name": "Weisman", "given_name": "Luke", "clpid": "Weisman-L" } ], "abstract": "This paper describes the design of a distributed system built using Java that supports peer-to-peer communication among processes spread across a network. We identify the requirements of a software layer that supports distributed computing, and we propose a design that meets those requirements. Our primary concern is the identification, specification, and implementation of software components that can be composed in different ways to develop correct distributed applications. Though our implementation uses Java, the fundamental ideas apply to any object-oriented language that supports messaging and threads.", "doi": "10.7907/Z98W3BBD", "publisher": "California Institute of Technology", "publication_date": "1996-03-08" }, { "id": "authors:82d3c-2h141", "collection": "authors", "collection_id": "82d3c-2h141", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1996.cs-tr-96-15", "type": "monograph", "title": "Systematic Composition of Objects in Distributed Internet Applications: Processes and Sessions", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Rifkin", "given_name": "Adam", "clpid": "Rifkin-A" } ], "abstract": "We consider a system with the infrastructure for the creation and interconnection of large numbers of distributed persistent objects. This system is exemplified by the Internet: potentially, every appliance and document on the Internet has both persistent state and the ability to interact with large numbers of other appliances and documents on the Internet. This paper elucidates the characteristics of such a system, and proposes the compositional requirements of its corresponding infrastructure. We explore the problems of specifying, composing, reasoning about, and implementing applications in such a system. A specific concern of our research is developing the infrastructure to support structuring distributed applications by using sequential, choice, and parallel composition, in the anarchic environment where application compositions may be unforeseeable, and interactions may be unknown prior to actually occurring. The structuring concepts discussed are relevant to a wide range of distributed applications; our implementation is illustrated with collaborative Java processes interacting over the Internet, but the methodology provided can be applied independent of specific platforms.", "doi": "10.7907/Z9JD4TTH", "publisher": "California Institute of Technology", "publication_date": "1996-01-01" }, { "id": "authors:0m5jf-b2637", "collection": "authors", "collection_id": "0m5jf-b2637", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1996.cs-tr-96-19", "type": "monograph", "title": "Designing Directories in Distributed Systems: A Systematic Framework", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Schooler", "given_name": "Eve M.", "clpid": "Schooler-E-M" } ], "abstract": "This paper proposes a framework for the systematic design of directory-based distributed applications. We evaluate a space of directory designs using our framework. We present a case study consisting of design, implementation and analysis of directories for a multicast application. Our framework is based on a model that extends the formal concept of process knowledge in distributed systems. This concept is used informally in phrases such as \"process p knows when it is in state s that process q is active.\" We show that this definition of knowledge is too strong for many distributed applications, including directory design. We propose a weaker concept: estimation. We define the meaning of phrases of the form: \"process p in state s estimates with probability 0.9 that process q is active.\" We specify directory design as an optimization problem with the objective function of maximizing estimation probabilities, and with constraints on the amount of bandwidth, computation and storage used. We show how this specification helps in a systematic analysis of alternative directory designs.", "doi": "10.7907/Z9736NXN", "publisher": "California Institute of Technology", "publication_date": "1996-01-01" }, { "id": "authors:f3veh-n1b18", "collection": "authors", "collection_id": "f3veh-n1b18", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-15", "type": "monograph", "title": "Mach-Based Channel Library", "author": [ { "family_name": "Manohar", "given_name": "Rajit", "clpid": "Manohar-R" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "[No Abstract]", "doi": "10.7907/Z9SJ1HMH", "publisher": "California Institute of Technology", "publication_date": "1994-07-07" }, { "id": "authors:d9tp5-vn745", "collection": "authors", "collection_id": "d9tp5-vn745", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-08", "type": "monograph", "title": "Integrating Task and Data Parallelism with the Collective Communication Archetype", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Manohar", "given_name": "Rajit", "clpid": "Manohar-R" }, { "family_name": "Massingill", "given_name": "Berna L.", "clpid": "Massingill-B-L" }, { "family_name": "Meiron", "given_name": "Daniel I.", "orcid": "0000-0003-0397-3775", "clpid": "Meiron-D-I" } ], "abstract": "A parallel program archetype aids in the development of reliable, efficient parallel applications with common computation/communication structures by providing stepwise refinement methods and code libraries specific to the structure. The methods and libraries help in transforming a sequential program into a parallel program via a sequence of refinement steps that help maintain correctness while refining the program to obtain the appropriate level of granularity for a target machine. The specific archetype discussed here deals with the integration of task and data parallelism by using collective (or group) communication. This archetype has been used to develop several applications.", "doi": "10.7907/Z9222RSP", "publisher": "California Institute of Technology", "publication_date": "1994" }, { "id": "authors:2t9n7-40g52", "collection": "authors", "collection_id": "2t9n7-40g52", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-31", "type": "monograph", "title": "A Deterministic Notation for Cooperating Processes", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Foster", "given_name": "Ian", "clpid": "Foster-I" } ], "abstract": "This paper proposes extensions of sequential programming languages for parallel programming that have the following features: 1. Dynamic Structures The process structure is dynamic: Processes and variables can be created and deleted. 2.Paradigm Integration The programming notation allows shared memory and message passing. 3.Determinism Demonstrating that a program is deterministic -- all executions with the same input produce the same output -- is straightforward. A program can be written so that the compiler can verify that the program is deterministic. Nondeterministic constructs can be introduced in a sequence of refinement steps to obtain greater efficiency if required. The ideas have been incorporated in an extension of Fortran, but the underlying sequential imperative language is not central to the ideas described here.", "doi": "10.7907/Z9B85664", "publisher": "California Institute of Technology", "publication_date": "1993-08-12" }, { "id": "authors:xvr20-d4h23", "collection": "authors", "collection_id": "xvr20-d4h23", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-24", "type": "monograph", "title": "Properties of Concurrent Programs", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "A program property is a predicate on programs. In this paper we explore program properties of the form U -> V where U and V are either predicates on states of a program or program properties, and -> satisfies three rules that are also used in reasoning about sequential programs and safety properties of parallel programs. We show how such properties can be used to reason about concurrent programs.", "doi": "10.7907/Z9ZS2TJP", "publisher": "California Institute of Technology", "publication_date": "1993-06-15" }, { "id": "authors:0ztwa-hva90", "collection": "authors", "collection_id": "0ztwa-hva90", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-29", "type": "monograph", "title": "Conjunctive Predicate Transformers for Reasoning about Concurrent Computation", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calculus for reasoning about sequential programs. We suggest predicate transformers for reasoning about progress properties and for deducing properties obtained by parallel composition. The paper presents theorems about the predicate transformers and suggests how they can be used in program design. Familiarity with the wp calculus is assumed.", "doi": "10.7907/0ztwa-hva90", "publisher": "California Institute of Technology", "publication_date": "1993-06-01" }, { "id": "authors:v8erj-rnd19", "collection": "authors", "collection_id": "v8erj-rnd19", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-92-02", "type": "monograph", "title": "The Compositional C++ Language Definition", "author": [ { "family_name": "Carlin", "given_name": "Peter", "clpid": "Carlin-P-A" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Kesselman", "given_name": "Carl", "clpid": "Kesselman-C" } ], "abstract": "This document gives a concise definition of the syntax and semantics of CC++. Knowledge of the C++ language definition and the C++ language reference manual is assumed.", "doi": "10.7907/Z9QF8QWK", "publisher": "California Institute of Technology", "publication_date": "1993-03-12" }, { "id": "authors:aqe68-3s329", "collection": "authors", "collection_id": "aqe68-3s329", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-92-01", "type": "monograph", "title": "CC++: A Declarative Concurrent Object Oriented Programming Notation", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Kesselman", "given_name": "Carl", "clpid": "Kesselman-C" } ], "abstract": "CC++ is Compositional C++, a parallel object-oriented notation that consists of C++ with six extensions. The goals of the CC++ project are to provide a theory, notation and tools for developing reliable scalable concurrent program libraries, and to provide a framework for unifying: 1.distributed reactive systems, batch-oriented numeric and symbolic applications, and user-interface systems, 2.declarative programs and object-oriented imperative programs, and 3.deterministic and nondeterministic programs. This paper is a brief description of the motivation for CC++, the extensions to C++, a few examples of CC++ programs with reasoning about their correctness, and an evaluation of CC++ in the context of other research on concurrent computation. A short description of C++ is provided.", "doi": "10.7907/Z96M34V8", "publisher": "California Institute of Technology", "publication_date": "1993-03-12" }, { "id": "authors:6av6m-6gs88", "collection": "authors", "collection_id": "6av6m-6gs88", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-02", "type": "monograph", "title": "Using Triples to Reason About Concurrent Programs", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rules for the Hoare triple, familiar to programmers from their experience with sequential programming, can be applied to develop proofs of concurrent programs as well. The basis for the adaptations of the Hoare triple is temporal logic.", "doi": "10.7907/Z94Q7S2R", "publisher": "California Institute of Technology", "publication_date": "1993" }, { "id": "authors:yxjc7-m1e56", "collection": "authors", "collection_id": "yxjc7-m1e56", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-18", "type": "monograph", "title": "The Derivation of Compositional Programs", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Kesselman", "given_name": "Carl", "clpid": "Kesselman-C" } ], "abstract": "This paper proposes a parallel programming notation and a method of reasoning about programs with the following characteristics: (1) Parallel Composition The notation provides different forms of interfaces between processes; the more restrictive the interface, the simpler the proofs of process composition. A flexible interface is that of cooperating processes with a shared address space; proofs of programs that use this interface are based on non-interference [OG76] and temporal logic [Pnu81,CM88, Lam9l]. We also propose more restrictive interfaces and specifications that allow us to use the following specificattion rule: the strongest specification of a parallel composition of processes is the conjunction of the strongest specifications of its components. This rule is helpful in deriving parallel programs. (2) Determinism A process that does not use certain primitives of the notation is guaranteed to be deterministic. Programmers who wish to prove that their programs are deterministic are relieved of this proof obligation if they restrict their programs to a certain subset of the primitives.", "doi": "10.7907/Z9GQ6VZZ", "publisher": "California Institute of Technology", "publication_date": "1992-01-01" }, { "id": "authors:g66qn-vsr53", "collection": "authors", "collection_id": "g66qn-vsr53", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-13", "type": "monograph", "title": "Compositional C++: Compositional Parallel Programming", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Kesselman", "given_name": "Carl", "clpid": "Kesselman-C" } ], "abstract": "A compositional parallel program is a program constructed by composing component programs in parallel, where the composed program inherits properties of its components. In this paper, we describe a small extension of C++ called Compositional C++ or CC++ which is an object-oriented notation that supports compositional parallel programming. CC++ integrates different paradigms of parallel programming: data-parallel, task-parallel and object-parallel paradigms; imperative and declarative programming; shared memory and messagebased programs. CC++ is designed to be transportable across a range of MIMD architectures.", "doi": "10.7907/Z94F1NX8", "publisher": "California Institute of Technology", "publication_date": "1992-01-01" }, { "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:y1mpw-tsq06", "collection": "authors", "collection_id": "y1mpw-tsq06", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160502-095026188", "type": "article", "title": "A Unifying Framework Distributed Simulation", "author": [ { "family_name": "Bagrodia", "given_name": "R.", "clpid": "Bagrodia-R" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Liao", "given_name": "Wen Toh", "clpid": "Liao-Wen-Toh" } ], "abstract": "A theory of distributed simulation applicable to both discrete-event and continuous simulation is presented. It derives many existing simulation algorithms from the theory and describes an Implementation of a new algorithm derived from the theory A high-level discrete-event simulation\nlanguage has been implemented, using the new algorithm, on parallel computers: performance results of the implementation are also presented.", "doi": "10.1145/130611.130614", "issn": "1049-3301", "publisher": "ACM", "publication": "ACM Transactions on Modeling and Computer Simulation (TOMACS)", "publication_date": "1991-10", "series_number": "4", "volume": "1", "issue": "4", "pages": "348-385" }, { "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:0779e-dms14", "collection": "authors", "collection_id": "0779e-dms14", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1990.cs-tr-90-10", "type": "monograph", "title": "A Primer for Program Composition Notation", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Taylor", "given_name": "Stephen", "clpid": "Taylor-S" } ], "abstract": "This primer describes a notation for program composition. Program composition is putting programs together to get larger ones. PCN (Program Composition Notation) is a programming language that allows programmers to compose programs so that composed programs execute efficiently on uniprocessors, distributed-memory multicomputers or shared-memory multiprocessors. (Revised December 12, 1990)", "doi": "10.7907/0779e-dms14", "publisher": "California Institute of Technology", "publication_date": "1990-01-01" }, { "id": "authors:wemek-2ns55", "collection": "authors", "collection_id": "wemek-2ns55", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1990.cs-tr-90-03", "type": "monograph", "title": "The Program Composition Project", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Taylor", "given_name": "Stephen", "clpid": "Taylor-S" }, { "family_name": "Kesselman", "given_name": "Carl", "clpid": "Kesselman-C" }, { "family_name": "Foster", "given_name": "Ian", "clpid": "Foster-I" } ], "abstract": "No abstract available.", "doi": "10.7907/wemek-2ns55", "publisher": "California Institute of Technology", "publication_date": "1990-01-01" }, { "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:jhr7a-4h585", "collection": "authors", "collection_id": "jhr7a-4h585", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1989.cs-tr-89-05", "type": "monograph", "title": "The Essence of Distributed Snapshots", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "No abstract available.", "doi": "10.7907/jhr7a-4h585", "publisher": "California Institute of Technology", "publication_date": "1989-01-01" }, { "id": "authors:hm444-6zc04", "collection": "authors", "collection_id": "hm444-6zc04", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1988.cs-tr-88-16", "type": "monograph", "title": "Programming Parallel Computers", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper is from a keynote address to the IEEE International Conference on Computer Languages, October 9, 1988. Keynote addresses are expected to be provocative (and perhaps even entertaining), but not necessarily scholarly. The reader should be warned that this talk was prepared with these expectations in mind.Parallel computers offer the potential of great speed at low cost. The promise of parallelism is limited by the ability to program parallel machines effectively. This paper explores the opportunities and the problems of parallel computing. Technological and economic trends are studied with a view towards determining where the field of parallel computing is going. An approach to parallel programming, called UNITY, is described. UNITY was developed by Jay Misra and myself, and is described in [Chandy]. Extensions to UNITY are discussed; these extensions were motivated by discussions with Chuck Seitz", "doi": "10.7907/hm444-6zc04", "publisher": "California Institute of Technology", "publication_date": "1988-01-01" }, { "id": "authors:k0wav-gz192", "collection": "authors", "collection_id": "k0wav-gz192", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1988.cs-tr-88-06", "type": "monograph", "title": "Theorems on Computations of Distributed Systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "This paper presents theorems that are helpful in developing algorithms for the detection of stable properties, recording global snapshots and tracing the execution of distributed systems. The theorems are based on a property of channels.", "doi": "10.7907/k0wav-gz192", "publisher": "California Institute of Technology", "publication_date": "1988-01-01" }, { "id": "authors:de5ac-j4z29", "collection": "authors", "collection_id": "de5ac-j4z29", "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1987.5251-tr-87", "type": "monograph", "title": "Conditional Knowledge as a Basis for Distributed Simulation", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Misra", "given_name": "Jay", "clpid": "Misra-J" } ], "abstract": "A goal of this paper is to explore different ways of implementing distributed simulations. Distributed simulation grew out of sequential simulation, and it is possible that the way we think about distributed simulation is unduly influenced by its sequential origins. To free ourselves from unnecessary restrictions on the way we design distributed simulations, in this paper we define the distributed simulation problem somewhat differently than in the literature. We propose the concepts of \"knowledge\" and \"conditional knowledge\", to help us obtain a general framework to reason about distributed simulations without too close a coupling with any specific implementation method. The framework appears helpful in designing new ways of distributed simulations. Empirical studies of distributed simulations report widely varying results: some studies report improvements in speed that are almost linearly proportional to the number of computers in the system, while other studies report that distributed simulation is even slower than sequential simulation. The framework proposed in this paper seems to help in explaining the wide differences observed in empirical studies. Using our framework, we attempt to suggest properties that efficient \"general-purpose\" distributed discrete-event simulations must have. The paper assumes little prior knowledge of the literature on simuIation or distributed systems. We hope that the paper will serve as a tutorial in addition to providing additional insight.", "doi": "10.7907/de5ac-j4z29", "publisher": "California Institute of Technology", "publication_date": "1987-01-01" }, { "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:4chat-vem22", "collection": "authors", "collection_id": "4chat-vem22", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130923-092736838", "type": "article", "title": "Distributed Snapshots: Determining Global States of a Distributed System", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Lamport", "given_name": "Leslie", "clpid": "Lamport-L" } ], "abstract": "This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to solve an important class of problems: stable property detection. A stable property is one that persists: once a stable property becomes true it remains true thereafter. Examples of stable properties are \"computation has terminated,\" \"the system is deadlocked\" and \"all tokens in a token ring have disappeared.\" The stable property detection problem is that of devising algorithms to detect a given stable property. Global state detection can also be used for checkpointing.", "doi": "10.1145/214451.214456", "issn": "0734-2071", "publisher": "Association for Computing Machinery", "publication": "ACM Transactions on Computer Systems", "publication_date": "1985-02", "series_number": "1", "volume": "3", "issue": "1", "pages": "63-75" }, { "id": "authors:edwde-vty84", "collection": "authors", "collection_id": "edwde-vty84", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:BRYacmtcs84", "type": "article", "title": "The MVA Priority Approximation", "author": [ { "family_name": "Bryant", "given_name": "Raymond M.", "clpid": "Bryant-R-M" }, { "family_name": "Krzesinski", "given_name": "Anthony E.", "clpid": "Krzesinski-A-E" }, { "family_name": "Lakshmi", "given_name": "M. Seetha", "clpid": "Lakshmi-M-S" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed-, open-, and mixed-type multiclass queuing networks containing Preemptive Resume (PR) and nonpreemptive Head-Of-Line (HOL) priority service centers. The approximation has essentially the same storage and computational requirements as MVA, thus allowing computationally efficient solutions of large priority queuing networks. The accuracy of the MVA approximation is systematically investigated and presented. It is shown that the approximation can compute the average performance measures of priority networks to within an accuracy of 5 percent for a large range of network parameter values. Accuracy of the method is shown to be superior to that of Sevcik's shadow approximation.", "issn": "0734-2071", "publisher": "Association for Computing Machinery", "publication": "ACM Transactions on Computer Systems", "publication_date": "1984-11", "series_number": "4", "volume": "2", "issue": "4", "pages": "335-359" }, { "id": "authors:yst31-ssw92", "collection": "authors", "collection_id": "yst31-ssw92", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-153432743", "type": "article", "title": "The drinking philosophers problem", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Misra", "given_name": "J.", "clpid": "Misra-J" } ], "abstract": "The problem of resolving conflicts between processes in distributed systems is of practical importance.\nA conflict between a set of processes must be resolved in favor of some (usually one) process and\nagainst the others: a favored process must have some property that distinguishes it from others. To\nguarantee fairness, the distinguishing property must be such that the process selected for favorable\ntreatment is not always the same. A distributed implementation of an acyclic precedence graph, in\nwhich the depth of a process (the longest chain of predecessors) is a distinguishing property, is\npresented. A simple conflict resolution rule coupled with the acyclic graph ensures fair resolution of\nall conflicts. To make the problem concrete, two paradigms are presented: the well-known distributed\ndining philosophers problem and a generalization of it, the distributed drinking philosophers problem.", "doi": "10.1145/1780.1804", "issn": "0164-0925", "publisher": "Association for Computing Machinery", "publication": "ACM Transactions on Programming Languages and Systems (TOPLAS)", "publication_date": "1984-10", "series_number": "4", "volume": "6", "issue": "4", "pages": "632-646" }, { "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:gsez6-b8b74", "collection": "authors", "collection_id": "gsez6-b8b74", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-154120345", "type": "article", "title": "Distributed deadlock detection", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Misra", "given_name": "Jayadev", "clpid": "Misra-J" }, { "family_name": "Haas", "given_name": "Laura M.", "clpid": "Haas-L-M" } ], "abstract": "Distributed deadlock models are presented for resource and communication deadlocks. Simple\ndistributed algorithms for detection of these deadlocks are given. We show that all true deadlocks are\ndetected and that no false deadlocks are reported. In our algorithms, no process maintains global\ninformation; all messages have an identical short length. The algorithms can be applied in distributed\ndatabase and other message communication systems.", "doi": "10.1145/357360.357365", "issn": "0734-2071", "publisher": "Association for Computing Machinery", "publication": "ACM Transactions on Computer Systems", "publication_date": "1983-05", "series_number": "2", "volume": "1", "issue": "2", "pages": "144-156" }, { "id": "authors:8q5hm-qnk74", "collection": "authors", "collection_id": "8q5hm-qnk74", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-145202534", "type": "article", "title": "A Characterization of Product-Form Queuing Networks", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Martin", "given_name": "A. J.", "clpid": "Martin-A-J" } ], "abstract": "Queuing network models have proved effective in the design and analysis of computing systems. The class of queuing network models having product-form solutions is amenable to efficient, general solution techniques. The purpose of this\npaper is to characterize such queuing systems. With this characterization it will be easy to determine whether the product-form algorithms can be used to analyze a system.", "doi": "10.1145/322374.322378", "issn": "0004-5411", "publisher": "Association for Computing Machinery", "publication": "Journal of the ACM", "publication_date": "1983-04", "series_number": "2", "volume": "30", "issue": "2", "pages": "286-299" }, { "id": "authors:2xtxh-6m967", "collection": "authors", "collection_id": "2xtxh-6m967", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-142130380", "type": "article", "title": "HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems", "author": [ { "family_name": "Neuse", "given_name": "Doug", "clpid": "Neuse-D" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "An approximate analytical method for estimating performance statistics of general closed queueing network models of computing systems is presented. These networks may include queues with priority scheduling disciplines and non-exponential servers and several classes of jobs. The method is based on the aggregation theorem (Norton's theorem) of Chandy, Herzog and Woo.", "doi": "10.1145/1035293.1035322", "issn": "0163-5999", "publisher": "Association for Computing Machinery (ACM)", "publication": "ACM SIGMETRICS Performance Evaluation Review", "publication_date": "1982-12", "series_number": "4", "volume": "11", "issue": "4", "pages": "195-212" }, { "id": "authors:ng6k6-kmm84", "collection": "authors", "collection_id": "ng6k6-kmm84", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-085547749", "type": "article", "title": "Distributed computation on graphs: shortest path algorithms", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Misra", "given_name": "J.", "clpid": "Misra-J" } ], "abstract": "We use the paradigm of diffusing computation, introduced by Dijkstra and Scholten, to solve a class of graph problems. We present a detailed solution to the problem of computing shortest paths from a single vertex to all other vertices, in the presence of negative cycles.", "doi": "10.1145/358690.358717", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "1982-11", "series_number": "11", "volume": "25", "issue": "11", "pages": "833-837" }, { "id": "authors:gtmpd-e9875", "collection": "authors", "collection_id": "gtmpd-e9875", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190110-150349106", "type": "article", "title": "A Distributed Graph Algorithm: Knot Detection", "author": [ { "family_name": "Misra", "given_name": "J.", "clpid": "Misra-J" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" } ], "abstract": "A knot in a directed graph is a useful concept in deadlock detection. A distributed algorithm for\nidentifying a knot in a graph by using a network of processes is presented. The algorithm is based on\nthe work of Dijkstra and Scholten.", "issn": "0164-0925", "publisher": "Association for Computing Machinery (ACM)", "publication": "ACM Transactions on Programming Languages and Systems (TOPLAS)", "publication_date": "1982-10", "series_number": "4", "volume": "4", "issue": "4", "pages": "678-686" }, { "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:ewa81-51v69", "collection": "authors", "collection_id": "ewa81-51v69", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-104059640", "type": "article", "title": "Linearizer: a heuristic algorithm for queueing network models of computing systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Neuse", "given_name": "Doug", "clpid": "Neuse-D" } ], "abstract": "A new algorithm is presented for the approximate analysis of closed, product-form queueing networks with single-server and delay (infinite-server) queues. This algorithm has the accuracy, speed, small memory requirements, and simplicity necessary for inclusion in a general network analysis package. The algorithm allows networks with large numbers of queues, job classes, and populations to be analyzed interactively even on microcomputers with very limited memory.", "doi": "10.1145/358396.358403", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "1982-02", "series_number": "2", "volume": "25", "issue": "2", "pages": "126-134" }, { "id": "authors:xcg4x-8cw89", "collection": "authors", "collection_id": "xcg4x-8cw89", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-133115677", "type": "article", "title": "Termination Detection of Diffusing Computations in Communicating Sequential Processes", "author": [ { "family_name": "Misra", "given_name": "Jayadev", "clpid": "Misra-J" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" } ], "abstract": "In this paper it is shown how the Dijkstra-Scholten scheme for termination detection in a diffusing computation can be adapted to detect termination or deadlock in a network of communicating sequential processes as defined by Hoare.", "doi": "10.1145/357153.357156", "issn": "0164-0925", "publisher": "Association for Computing Machinery", "publication": "ACM Transactions on Programming Languages and Systems (TOPLAS)", "publication_date": "1982-01", "series_number": "1", "volume": "4", "issue": "1", "pages": "37-43" }, { "id": "authors:cpq9r-h3329", "collection": "authors", "collection_id": "cpq9r-h3329", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-144627224", "type": "article", "title": "SCAT: A heuristic algorithm for queueing network models of computing systems", "author": [ { "family_name": "Neuse", "given_name": "D.", "clpid": "Neuse-D" }, { "family_name": "Chandy", "given_name": "K.", "clpid": "Chandy-K-M" } ], "abstract": "This paper presents a new algorithm for the approximate analysis of closed product-form queueing networks with fixed-rate, delay (infinite-server), and load-dependent queues. This algorithm has the accuracy, speed, small memory requirements, and simplicity necessary for inclusion in a general network analysis package. The algorithm allows networks with large numbers of queues, job classes, and populations to be analyzed interactively even on microcomputers with very limited memory.", "doi": "10.1145/1010629.805476", "issn": "0163-5999", "publisher": "Association for Computing Machinery", "publication": "ACM SIGMETRICS Performance Evaluation Review", "publication_date": "1981-09", "series_number": "3", "volume": "10", "issue": "3", "pages": "59-79" }, { "id": "authors:zn706-92571", "collection": "authors", "collection_id": "zn706-92571", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-142711979", "type": "article", "title": "Asynchronous distributed simulation via a sequence of parallel computations", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Misra", "given_name": "J.", "clpid": "Misra-J" } ], "abstract": "An approach to carrying out asynchronous, distributed simulation on multiprocessor message-passing architectures is presented. This scheme differs from other distributed simulation schemes because (1) the amount of memory required by all processors together is bounded and is no more than the amount required in sequential simulation and (2) the multiprocessor network is allowed to deadlock, the deadlock is detected, and then the deadlock is broken. Proofs for the correctness of this approach are outlined.", "doi": "10.1145/358598.358613", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "1981-04", "series_number": "4", "volume": "24", "issue": "4", "pages": "198-206" }, { "id": "authors:nah4f-8yr79", "collection": "authors", "collection_id": "nah4f-8yr79", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-151918151", "type": "article", "title": "Computational algorithms for product form queueing networks", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Sauer", "given_name": "Charles H.", "clpid": "Sauer-C-H" } ], "abstract": "In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.", "doi": "10.1145/359015.359020", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "1980-10", "series_number": "10", "volume": "23", "issue": "10", "pages": "573-583" }, { "id": "authors:z8v92-mjd86", "collection": "authors", "collection_id": "z8v92-mjd86", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-083035370", "type": "article", "title": "A simple model of distributed programs based on implementation-hiding and process autonomy", "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 model for a network of communicating processes. We extend well known ideas in sequential programming such as procedures, parameter passing and binding, and recursion to distributed programs. We stress the notion of implementation-hiding, i.e. the invoker of a process or procedure has no knowledge of the implementation of the invoked computation.", "doi": "10.1145/947680.947681", "issn": "0362-1340", "publisher": "Association for Computing Machinery", "publication": "ACM SIGPLAN Notices", "publication_date": "1980-07", "series_number": "7-8", "volume": "15", "issue": "7-8", "pages": "26-35" }, { "id": "authors:693nm-nwf04", "collection": "authors", "collection_id": "693nm-nwf04", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190110-110914947", "type": "article", "title": "Computational algorithms for product form queueing networks", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Sauer", "given_name": "Charles H.", "clpid": "Sauer-C-H" } ], "abstract": "In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.", "doi": "10.1145/800199.806144", "issn": "0163-5999", "publisher": "Association for Computing Machinery (ACM)", "publication": "ACM SIGMETRICS Performance Evaluation Review", "publication_date": "1980-06", "series_number": "2", "volume": "9", "issue": "2", "pages": "1" }, { "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:ej0xr-f1s55", "collection": "authors", "collection_id": "ej0xr-f1s55", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-105904204", "type": "article", "title": "The impact of distributions and disciplines on multiple processor systems", "author": [ { "family_name": "Sauer", "given_name": "Charles H.", "clpid": "Sauer-C-H" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" } ], "abstract": "Simple queueing models are used to study the performance tradeoffs of multiple processor systems. Issues considered include the impact of CPU service disciplines and distributions, level of multiprogramming, multitasking, and job priorities.", "doi": "10.1145/359046.359053", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "1979-01", "series_number": "1", "volume": "22", "issue": "1", "pages": "25-34" }, { "id": "authors:xz3n2-5d526", "collection": "authors", "collection_id": "xz3n2-5d526", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-161030053", "type": "article", "title": "Models for parallel processing within programs: application to CPU: I/O and I/O: I/O overlap", "author": [ { "family_name": "Towsley", "given_name": "D.", "clpid": "Towsley-D" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Browne", "given_name": "J. C.", "clpid": "Browne-J-C" } ], "abstract": "Approximate queueing models for internal parallel processing by individual programs in a multiprogrammed system are developed in this paper. The solution technique is developed by network decomposition. The models are formulated in terms of CPU:I/O and I/O:I/O overlap and applied to the analysis of these problems. The percentage performance improvement from CPU:I/O overlap is found to be greatest for systems which are in approximate CPU:I/O utilization balance and for low degrees of multiprogramming. The percentage improvement from I/O:I/O overlap is found to be greatest for systems in which the I/O system is more utilized than the CPU.", "doi": "10.1145/359619.359622", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "1978-10", "series_number": "10", "volume": "21", "issue": "10", "pages": "821-831" }, { "id": "authors:e133d-15388", "collection": "authors", "collection_id": "e133d-15388", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-155805180", "type": "article", "title": "Approximate Methods for Analyzing Queueing Network Models of Computing Systems", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Sauer", "given_name": "Charles H.", "clpid": "Sauer-C-H" } ], "abstract": "The two primary issues in choosing a computing system model are credibility of the model and cost of developing and solving the model Credibility is determined by 1) the experience and biases of the persons using the model, 2) the extent to which the model represents system features, and 3) the accuracy of the solution technique. Queueing network models are widely used because they have proven effective and are inexpensive to solve. However,\nmost queueing network models make strong assumptions to assure an exact numerical solution. When such assumptions severely affect credibility, simulation or other approaches\nare used, in spite of their relatively high cost. It is the contention of this paper that queueing network models with credible assumptions can be solved approximately to provide credible performance estimates at low cost This contention is supported by examples of approximate solutions of queueing network models. Two major approaches to approximate solution, aggregation (decomposition) and diffusion, are discussed.", "doi": "10.1145/356733.356737", "issn": "0360-0300", "publisher": "Association for Computing Machinery", "publication": "ACM Computing Surveys", "publication_date": "1978-09", "series_number": "3", "volume": "10", "issue": "3", "pages": "281-317" }, { "id": "authors:rkqwk-s0081", "collection": "authors", "collection_id": "rkqwk-s0081", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190109-110649524", "type": "article", "title": "Product Form and Local Balance in Queueing Networks", "author": [ { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Howard", "given_name": "John H.", "clpid": "Howard-J-H" }, { "family_name": "Towsley", "given_name": "Donald F.", "clpid": "Towsley-D-F" } ], "abstract": "A new property of queueing discipline, station balance, seems to explain why some disciplines yield product form solutions for queues and networks using nonexponential service disciplines and other disciplines do not. A queueing discipline satisfies station balance if rates at which customers receive service at each position of the queue are proportional to the probability that a customer arrives at that position. Station and local balance in queues and networks of queues are investigated. In addition to characterizing local balance and product form, the results of the paper generalize previous results on local balance to arbitrary differentiable service distribution functions.", "doi": "10.1145/322003.322009", "issn": "0004-5411", "publisher": "Association for Computing Machinery", "publication": "Journal of the ACM", "publication_date": "1977-04", "series_number": "2", "volume": "24", "issue": "2", "pages": "250-263" }, { "id": "authors:p83vd-95268", "collection": "authors", "collection_id": "p83vd-95268", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190109-124527286", "type": "article", "title": "Memory management and response time", "author": [ { "family_name": "Brown", "given_name": "R. M.", "clpid": "Brown-R-M" }, { "family_name": "Browne", "given_name": "J. C.", "clpid": "Browne-J-C" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" } ], "abstract": "This paper presents a computationally tractable methodology for including accurately the effects of finite memory size and workload memory requirements in queueing network models of computer systems. Empirical analyses and analytic studies based on applying this methodology to an actual multiaccess interactive system are reported. Relations between workload variables such as memory requirement distribution and job swap time, and performance measures such as response time and memory utilization are graphically displayed. A multiphase, analytically soluble model is proposed as being broadly applicable to the analysis of interactive computer systems which use nonpaged memories.", "doi": "10.1145/359436.359443", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "1977-03", "series_number": "3", "volume": "20", "issue": "3", "pages": "153-165" }, { "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:52r9z-27e04", "collection": "authors", "collection_id": "52r9z-27e04", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-104559390", "type": "article", "title": "Scheduling partially ordered tasks with probabilistic execution times", "author": [ { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Reynolds", "given_name": "P. F.", "clpid": "Reynolds-P-F" } ], "abstract": "The objective of this paper is to relate models of multi-tasking in which task times are known or known to be equal to models in which task times are unknown. We study bounds on completion times and the applicability of optimal deterministic schedules to probabilistic models. Level algorithms are shown to be optimal for forest precedence graphs in which task times are independent and identically distributed exponential or Erlang random variables. A time sharing system simulation shows that multi-tasking could reduce response times and that response time is insensitive to multi-tasking scheduling disciplines.", "doi": "10.1145/800213.806534", "issn": "0163-5980", "publisher": "Association for Computing Machinery", "publication": "ACM SIGOPS Operating Systems Review", "publication_date": "1975-11", "series_number": "5", "volume": "9", "issue": "5", "pages": "169-177" }, { "id": "authors:yp0j7-mwf72", "collection": "authors", "collection_id": "yp0j7-mwf72", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-140309634", "type": "article", "title": "Open, Closed, and Mixed Networks of Queues with Different Classes of Customers", "author": [ { "family_name": "Baskett", "given_name": "Forest", "clpid": "Baskett-F" }, { "family_name": "Chandy", "given_name": "K. Mani", "clpid": "Chandy-K-M" }, { "family_name": "Muntz", "given_name": "Richard R.", "clpid": "Muntz-R-R" }, { "family_name": "Palacios", "given_name": "Fernando G.", "clpid": "Palacios-F-G" } ], "abstract": "The joint equilibrium distribution of queue sizes in a network of queues containing N service centers and R classes of customers is derived. The equilibrium state probabilities have the general form P(S) = Cd(S) f_1(x_1)f_2(x_2)\u00b7f_N(x_N), where S is the state of the system, x, is the configuration of customers at the ith service center, d(S) is a function of the state of the model, f, is a function that depends on the type of the ith service center, and C is a normalizing constant. It is assumed that the equilibrium probabilities exist and are unique. Four types of service centers to model central processors, data channels, terminals, and routing delays are considered. The queueing disciplines associated with these service centers include first-come-first-served, processor sharing,\nno queueing, and last-come-first-served. Each customer belongs to a single class of customers while awaiting or receiving service at a service center, but may change classes and service centers according to fixed probabilities at the completion of a service request. For open networks, state dependent arrival processes are considered. Closed networks are those with no exogenous arrivals. A network may be closed with respect to some classes of customers and open with respect to other classes of customers. At three of the four types of service centers, the service times of customers are governed by probability distributions having rational Laplace transforms, different classes of customers having different distributions. At first-come-first-served-type service centers, the service time distribution must be identical and exponential for all classes of customers. Examples show how different classes of customers can affect models of computer systems.", "doi": "10.1145/321879.321887", "issn": "0004-5411", "publisher": "Association for Computing Machinery", "publication": "Journal of the ACM", "publication_date": "1975-04", "series_number": "2", "volume": "22", "issue": "2", "pages": "248-260" }, { "id": "authors:376rf-v3s31", "collection": "authors", "collection_id": "376rf-v3s31", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-160504256", "type": "article", "title": "A comparison of list schedules for parallel processing systems", "author": [ { "family_name": "Adam", "given_name": "Thomas L.", "clpid": "Adam-T-L" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" }, { "family_name": "Dickson", "given_name": "J. R.", "clpid": "Dickson-J-R" } ], "abstract": "The problem of scheduling two or more processors to minimize the execution time of a program which consists of a set of partially ordered tasks is studied. Cases where task execution times are deterministic and others in which execution times are random variables are analyzed. It is shown that different algorithms suggested in the literature vary significantly in execution time and that the B-schedule of Coffman and Graham is near-optimal. A dynamic programming solution for the case in which execution times are random variables is presented.", "doi": "10.1145/361604.361619", "issn": "0001-0782", "publisher": "Association for Computing Machinery", "publication": "Communications of the ACM", "publication_date": "1974-12", "series_number": "12", "volume": "17", "issue": "12", "pages": "685-690" }, { "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" }, { "id": "authors:19as9-c9990", "collection": "authors", "collection_id": "19as9-c9990", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190110-155953410", "type": "article", "title": "Optimization of Memory Hierarchies in Multiprogrammed Systems", "author": [ { "family_name": "Ramamoorthy", "given_name": "C. V.", "clpid": "Ramamoorthy-C-V" }, { "family_name": "Chandy", "given_name": "K. M.", "clpid": "Chandy-K-M" } ], "abstract": "The optimization of memory hierarchy involves the selection of types and sizes of memory devices such that the average access time to an information block is a minimum for a particular cost constraint. It is assumed that the frequency of usage of the information is known a priori. In this paper the optimization theory for a single task or program is reviewed and it is extended to a general case in multiprogramming when a number of tasks are executed concurrently. Another important extension treats the case when memories are available only in indivisible modules. Comparisons with conventional methods of solution as well as computational experience on the multiprogrammed and modular cases are given.", "issn": "0004-5411", "publisher": "Association for Computing Machinery", "publication": "Journal of the ACM", "publication_date": "1970-07", "series_number": "3", "volume": "17", "issue": "3", "pages": "426-445" } ]