[ { "id": "https://authors.library.caltech.edu/records/3g2ne-1f408", "eprint_id": 112353, "eprint_status": "archive", "datestamp": "2023-08-22 11:54:44", "lastmod": "2023-10-23 22:30:37", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Filippitzis-Filippos", "name": { "family": "Filippitzis", "given": "Filippos" }, "orcid": "0000-0001-8377-4914" }, { "id": "Kohler-M-D", "name": { "family": "Kohler", "given": "Monica D." }, "orcid": "0000-0002-4703-190X" }, { "id": "Heaton-T-H", "name": { "family": "Heaton", "given": "Thomas H." }, "orcid": "0000-0003-3363-2197" }, { "id": "Graves-Robert-W", "name": { "family": "Graves", "given": "Robert W." }, "orcid": "0000-0001-9758-453X" }, { "id": "Clayton-R-W", "name": { "family": "Clayton", "given": "Robert W." }, "orcid": "0000-0003-3323-3508" }, { "id": "Guy-Richard-G", "name": { "family": "Guy", "given": "Richard G." }, "orcid": "0000-0002-8651-5608" }, { "id": "Bunn-J-J", "name": { "family": "Bunn", "given": "Julian J." }, "orcid": "0000-0002-3798-298X" }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" }, "orcid": "0000-0001-9190-1290" } ] }, "title": "Ground motions in urban Los Angeles from the 2019 Ridgecrest earthquake sequence", "ispublished": "pub", "full_text_status": "public", "keywords": "Earthquake ground motions, ground motion amplification, community seismic network, Ridgecrest earthquake sequence, simulation predictions, GMPE predictions; Geophysics; Geotechnical Engineering and Engineering Geology", "note": "\u00a9 The Author(s) 2021. \n\nArticle first published online: April 28, 2021; Issue published: November 1, 2021. Received: February 09, 2021; Accepted: February 22, 2021. \n\nWe acknowledge the Texas Advanced Computing Center (TACC) at The University of Texas at Austin (http://www.tacc.utexas.edu/) for providing high-performance computing resources through an allocation to the Southern California Earthquake Center (SCEC). We thank John H. Shaw and Andreas Plesch for providing assistance in obtaining the regional basement topography data. The authors appreciate the constructive reviews of the manuscript provided by Morgan Page and Grace Parker. \n\nThe author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: We are grateful to Caltech, the Betty and Gordon Moore Foundation, the Conrad N. Hilton Foundation, and Computers & Structures, Inc., for funding this project and for supporting the continuous operation of the Community Seismic Network. This research was also supported by the Southern California Earthquake Center (Contribution No. 10931). SCEC is funded by NSF Cooperative Agreement EAR-1600087 & USGS Cooperative Agreement G17AC00047. The first author was supported by the Cecil and Sally Drinkward Graduate Fellowship at the California Institute of Technology. \n\nThe author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.\n\n
Published - 10.1177_87552930211003916.pdf
Supplemental Material - sj-pdf-1-eqs-10.1177_87552930211003916.pdf
", "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.", "date": "2021-11-01", "date_type": "published", "publication": "Earthquake Spectra", "volume": "37", "number": "4", "publisher": "Earthquake Engineering Research Institute", "pagerange": "2493-2522", "id_number": "CaltechAUTHORS:20211209-231200000", "issn": "8755-2930", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20211209-231200000", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Caltech" }, { "agency": "Gordon and Betty Moore Foundation" }, { "agency": "Conrad N. Hilton Foundation" }, { "agency": "Computers & Structures, Inc" }, { "agency": "Southern California Earthquake Center (SCEC)", "grant_number": "10931" }, { "agency": "NSF", "grant_number": "EAR-1600087" }, { "agency": "USGS", "grant_number": "G17AC00047" }, { "agency": "Cecil and Sally Drinkward Fellowship" } ] }, "local_group": { "items": [ { "id": "Seismological-Laboratory" }, { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.1177/87552930211003916", "primary_object": { "basename": "10.1177_87552930211003916.pdf", "url": "https://authors.library.caltech.edu/records/3g2ne-1f408/files/10.1177_87552930211003916.pdf" }, "related_objects": [ { "basename": "sj-pdf-1-eqs-10.1177_87552930211003916.pdf", "url": "https://authors.library.caltech.edu/records/3g2ne-1f408/files/sj-pdf-1-eqs-10.1177_87552930211003916.pdf" } ], "resource_type": "article", "pub_year": "2021", "author_list": "Filippitzis, Filippos; Kohler, Monica D.; et el." }, { "id": "https://authors.library.caltech.edu/records/m4qpg-a5r57", "eprint_id": 107360, "eprint_status": "archive", "datestamp": "2023-08-20 00:10:20", "lastmod": "2023-10-23 15:48:48", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Kohler-M-D", "name": { "family": "Kohler", "given": "Monica D." }, "orcid": "0000-0002-4703-190X" }, { "id": "Filippitzis-Filippos", "name": { "family": "Filippitzis", "given": "Filippos" }, "orcid": "0000-0001-8377-4914" }, { "id": "Heaton-T-H", "name": { "family": "Heaton", "given": "Thomas" }, "orcid": "0000-0003-3363-2197" }, { "id": "Clayton-R-W", "name": { "family": "Clayton", "given": "Robert W." }, "orcid": "0000-0003-3323-3508" }, { "id": "Guy-Richard-G", "name": { "family": "Guy", "given": "Richard" }, "orcid": "0000-0002-8651-5608" }, { "id": "Bunn-Julian", "name": { "family": "Bunn", "given": "Julian" }, "orcid": "0000-0002-3798-298X" }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" }, "orcid": "0000-0001-9190-1290" } ] }, "title": "2019 Ridgecrest Earthquake Reveals Areas of Los Angeles That Amplify Shaking of High-Rises", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2020 Seismological Society of America. \n\nManuscript received 4 May 2020; Published online 30 September 2020. \n\nThis article greatly benefitted from thoughtful reviews provided by Art Frankel and an anonymous reviewer. The authors are grateful to Caltech, the Betty and Gordon Moore Foundation, the Conrad N. Hilton Foundation, and Computers & Structures, Inc. for providing support for the Community Seismic Network and for this study. \n\nData and Resources: Community Seismic Network (CSN) strong\u2010motion data for the Ridgecrest earthquake are available from csn.caltech.edu/data. Southern California Seismic Network (SCSN) data are available from the Southern California Earthquake Data Center (scedc.caltech.edu). The authors acknowledge accessing strong\u2010motion data through the Center for Engineering Strong Motion Data (CESMD; strongmotioncenter.org. All websites were last accessed August 2020. The networks or agencies providing the data used in this article are the California Strong Motion Instrumentation Program (CSMIP) and the U.S. Geological Survey (USGS) National Strong Motion Project (NSMP). The unpublished manuscript by F. Filippitzis, M. D. Kohler, T. H. Heaton, R. W. Graves, R. W. Clayton, R. G. Guy, J. J. Bunn, and K. M. Chandy (2020), \"Ground motion response in urban Los Angeles from the 2019 Ridgecrest earthquake sequence,\" submitted to Earthq. Spectra. The supplemental material contains seven figures (Figs. S1\u2013S7) cited in the main article.\n\nSupplemental Material - srl-2020170_supplement.pdf
", "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.", "date": "2020-11", "date_type": "published", "publication": "Seismological Research Letters", "volume": "91", "number": "6", "publisher": "Seismological Society of America", "pagerange": "3370-3380", "id_number": "CaltechAUTHORS:20210107-103141484", "issn": "0895-0695", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210107-103141484", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Caltech" }, { "agency": "Gordon and Betty Moore Foundation" }, { "agency": "Conrad N. Hilton Foundation" }, { "agency": "Computers and Structures, Inc." } ] }, "local_group": { "items": [ { "id": "Seismological-Laboratory" }, { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.1785/0220200170", "primary_object": { "basename": "srl-2020170_supplement.pdf", "url": "https://authors.library.caltech.edu/records/m4qpg-a5r57/files/srl-2020170_supplement.pdf" }, "resource_type": "article", "pub_year": "2020", "author_list": "Kohler, Monica D.; Filippitzis, Filippos; et el." }, { "id": "https://authors.library.caltech.edu/records/r8k57-m8t03", "eprint_id": 99876, "eprint_status": "archive", "datestamp": "2023-08-19 20:25:29", "lastmod": "2023-10-18 18:53:37", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Clayton-R-W", "name": { "family": "Clayton", "given": "Robert W." }, "orcid": "0000-0003-3323-3508" }, { "id": "Kohler-M-D", "name": { "family": "Kohler", "given": "Monica" } }, { "id": "Guy-Richard", "name": { "family": "Guy", "given": "Richard" } }, { "id": "Bunn-J", "name": { "family": "Bunn", "given": "Julian" }, "orcid": "0000-0002-3798-298X" }, { "id": "Heaton-T-H", "name": { "family": "Heaton", "given": "Thomas" }, "orcid": "0000-0003-3363-2197" }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "Mani" } } ] }, "title": "CSN-LAUSD Network: A Dense Accelerometer Network in Los Angeles Schools", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2019 Seismological Society of America. \n\nPublished Online 13 November 2019. \n\nData and Resources: Data from felt and interesting events are available at http://csn.caltech.edu/data/ along with the recordings of other Community Seismic Network (CSN) stations. In particular the data of the Ridgecrest earthquake shown in Figures 3, 5, 6, 7 and S1 are archived there. The continuous data from the CSN network are not generally released due to privacy concerns, but we are attempting to obtain permission for the Los Angeles Unified School District (LAUSD) stations. The VS30 measures in the region of LAUSD are available from https://earthquake.usgs.gov/data/vs30. The client software is available at https://github.com/jjbunn/PyCSN. More information on the CSN and CSN\u2010LAUSD networks is available at http://csn.caltech.edu (last accessed July 27, 2019). The Raspberry Shake network can be accessed at https://raspberryshake.org. Details on the Phidget sensor are available at https://www.phidgets.com/?&prodid=31. All websites were last accessed on July 2019. The supplemental material includes movies of ground accelerations due to the 6 July 2019 M7.1 Ridgecrest earthquake are shown in Figure S1. The time slices shown in Figure 6 are one panel from each of the videos. The data have been bandpass filtered from 100\u20101 s and 100\u20105 s. The movie starts at 60 s after the origin time and runs until 92 s. \n\nThe authors thank the Betty and Gordon Moore Foundation, Caltech, the Conrad N. Hilton Foundation, and Computers and Structures, Inc., for funding for this project. The authors thank Los Angeles Unified School District (LAUSD), and in particular Jill Barnes, for facilitating this project, and the many volunteers who have helped build the Community Seismic Network (CSN) sensors. Charles Dorn and Filippos Filippitzis from Caltech created Figures 4 and 7, respectively.\n\nAccepted Version - SRL-2019200_Galley_Final.pdf
Supplemental Material - srl-2019200_supplement.docx
Supplemental Material - srl-2019200_supplement_movie-1sec.mpg
Supplemental Material - srl-2019200_supplement_movie-5sec.mpg
", "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.", "date": "2020-03-01", "date_type": "published", "publication": "Seismological Research Letters", "volume": "91", "number": "2A", "publisher": "Seismological Society of America", "pagerange": "622-630", "id_number": "CaltechAUTHORS:20191115-160214215", "issn": "0895-0695", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191115-160214215", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Gordon and Betty Moore Foundation" }, { "agency": "Caltech" }, { "agency": "Conrad N. Hilton Foundation" }, { "agency": "Computers and Structures, Inc." } ] }, "local_group": { "items": [ { "id": "Seismological-Laboratory" }, { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.1785/0220190200", "primary_object": { "basename": "srl-2019200_supplement_movie-1sec.mpg", "url": "https://authors.library.caltech.edu/records/r8k57-m8t03/files/srl-2019200_supplement_movie-1sec.mpg" }, "related_objects": [ { "basename": "srl-2019200_supplement_movie-5sec.mpg", "url": "https://authors.library.caltech.edu/records/r8k57-m8t03/files/srl-2019200_supplement_movie-5sec.mpg" }, { "basename": "SRL-2019200_Galley_Final.pdf", "url": "https://authors.library.caltech.edu/records/r8k57-m8t03/files/SRL-2019200_Galley_Final.pdf" }, { "basename": "srl-2019200_supplement.docx", "url": "https://authors.library.caltech.edu/records/r8k57-m8t03/files/srl-2019200_supplement.docx" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Clayton, Robert W.; Kohler, Monica; et el." }, { "id": "https://authors.library.caltech.edu/records/ch58y-08r59", "eprint_id": 68832, "eprint_status": "archive", "datestamp": "2023-08-20 13:32:01", "lastmod": "2023-10-20 15:46:35", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Kohler-M-D", "name": { "family": "Kohler", "given": "Monica D." } }, { "id": "Massari-A", "name": { "family": "Massari", "given": "Anthony" }, "orcid": "0000-0002-6561-4674" }, { "id": "Heaton-T-H", "name": { "family": "Heaton", "given": "Thomas H." }, "orcid": "0000-0003-3363-2197" }, { "id": "Kanamori-H", "name": { "family": "Kanamori", "given": "Hiroo" }, "orcid": "0000-0001-8219-9428" }, { "id": "Hauksson-E", "name": { "family": "Hauksson", "given": "Egill" }, "orcid": "0000-0002-6834-5051" }, { "id": "Guy-R", "name": { "family": "Guy", "given": "Richard" } }, { "id": "Clayton-R-W", "name": { "family": "Clayton", "given": "Robert W." }, "orcid": "0000-0003-3323-3508" }, { "id": "Bunn-J", "name": { "family": "Bunn", "given": "Julian" }, "orcid": "0000-0002-3798-298X" }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } } ] }, "title": "Downtown Los Angeles 52-Story High-Rise and Free-Field Response to an Oil Refinery Explosion", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2016 Earthquake Engineering Research Institute. \n\nWe appreciate discussions with Caltech Professor of Aeronautics and Mechanical Engineering Joseph Shepherd, and Caltech Professor of Planetary Science Andrew Ingersol who provided useful feedback on this study. We thank three anonymous reviewers whose comments improved this paper. We also thank the Betty and Gordon Moore Foundation, the Terrestrial Hazard Observation and Reporting Center at Caltech, and the Divisions of Geological and Planetary Science, and Engineering and Applied Science at Caltech for funding the development of the Community Seismic Network. The USGS Advanced National Seismic System and California Office of Emergency Services provided funding for SCSN operations. The Los Angeles/Long Beach Urban Area Security Initiative (UASI) funded a recent upgrade of the SCSN.\n\nPublished - 062315eqs101m.pdf
", "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.", "date": "2016-08-30", "date_type": "published", "publication": "Earthquake Spectra", "volume": "32", "number": "3", "publisher": "Earthquake Engineering Research Institute", "pagerange": "1793-1820", "id_number": "CaltechAUTHORS:20160705-133353269", "issn": "8755-2930", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160705-133353269", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Gordon and Betty Moore Foundation" }, { "agency": "Terrestrial Hazard Observation and Reporting Center" }, { "agency": "Caltech" }, { "agency": "USGS" }, { "agency": "California Office of Emergency Services" }, { "agency": "Los Angeles/Long Beach Urban Area Security Initiative (UASI)" } ] }, "local_group": { "items": [ { "id": "Seismological-Laboratory" }, { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.1193/062315EQS101M", "primary_object": { "basename": "062315eqs101m.pdf", "url": "https://authors.library.caltech.edu/records/ch58y-08r59/files/062315eqs101m.pdf" }, "resource_type": "article", "pub_year": "2016", "author_list": "Kohler, Monica D.; Massari, Anthony; et el." }, { "id": "https://authors.library.caltech.edu/records/c96wg-85x76", "eprint_id": 61021, "eprint_status": "archive", "datestamp": "2023-08-20 07:59:22", "lastmod": "2023-10-24 23:18:56", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Clayton-R-W", "name": { "family": "Clayton", "given": "Robert W." }, "orcid": "0000-0003-3323-3508" }, { "id": "Heaton-T-H", "name": { "family": "Heaton", "given": "Thomas" }, "orcid": "0000-0003-3363-2197" }, { "id": "Kohler-M-D", "name": { "family": "Kohler", "given": "Monica" } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "Mani" } }, { "id": "Guy-Richard", "name": { "family": "Guy", "given": "Richard" } }, { "id": "Bunn-J", "name": { "family": "Bunn", "given": "Julian" }, "orcid": "0000-0002-3798-298X" } ] }, "title": "Community Seismic Network: A Dense Array to Sense Earthquake Strong Motion", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2015 Seismological Society of America. \n\nPublished Online 5 August 2015. \n\nWe thank the Betty and Gordon Moore Foundation and the California Institute of Technology for funding the development of the Community Seismic Network.\n\nPublished - 1354.full.pdf
", "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).", "date": "2015-09", "date_type": "published", "publication": "Seismological Research Letters", "volume": "86", "number": "5", "publisher": "Seismological Society of America", "pagerange": "1354-1363", "id_number": "CaltechAUTHORS:20151012-154950185", "issn": "0895-0695", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20151012-154950185", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Gordon and Betty Moore Foundation" }, { "agency": "Caltech" } ] }, "local_group": { "items": [ { "id": "Seismological-Laboratory" }, { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.1785/0220150094", "primary_object": { "basename": "1354.full.pdf", "url": "https://authors.library.caltech.edu/records/c96wg-85x76/files/1354.full.pdf" }, "resource_type": "article", "pub_year": "2015", "author_list": "Clayton, Robert W.; Heaton, Thomas; et el." }, { "id": "https://authors.library.caltech.edu/records/5h1p1-dnz43", "eprint_id": 80069, "eprint_status": "archive", "datestamp": "2023-08-20 08:03:17", "lastmod": "2023-10-17 15:28:43", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bose-Subhonmesh", "name": { "family": "Bose", "given": "Subhonmesh" }, "orcid": "0000-0002-3445-4479" }, { "id": "Gayme-D-F", "name": { "family": "Gayme", "given": "Dennice F." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" } ] }, "title": "Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow", "ispublished": "pub", "full_text_status": "public", "keywords": "Conic relaxation, semidefinite programming, optimal power flow", "note": "\u00a9 2015 IEEE. \n\nManuscript received April 8, 2014; revised September 28, 2014; accepted November 17, 2014. Date of publication February 6, 2015; date of current version September 14, 2015. \n\nThis work was supported in part by the National Science Foundation through NetSE CNS 0911041, in part by the ARPA-E through GENI DE AR0000226, in part by Southern California Edison, in part by the National Science Council of Taiwan through NSC 103-3113-P-008-001, in part by the Los Alamos National Lab (DoE), and in part by the Caltech's Resnick Institute. Recommended by Associate Editor M. Chertkov.\n\nSubmitted - 1203.5599.pdf
", "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.", "date": "2015-09", "date_type": "published", "publication": "IEEE Transactions on Control of Network Systems", "volume": "2", "number": "3", "publisher": "IEEE", "pagerange": "278-287", "id_number": "CaltechAUTHORS:20170810-100823060", "issn": "2325-5870", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-100823060", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-0911041" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-AR0000226" }, { "agency": "Southern California Edison" }, { "agency": "National Science Council (Taipei)", "grant_number": "NSC 103-3113-P-008-001" }, { "agency": "Resnick Sustainability Institute" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1109/TCNS.2015.2401172", "primary_object": { "basename": "1203.5599.pdf", "url": "https://authors.library.caltech.edu/records/5h1p1-dnz43/files/1203.5599.pdf" }, "resource_type": "article", "pub_year": "2015", "author_list": "Bose, Subhonmesh; Gayme, Dennice F.; et el." }, { "id": "https://authors.library.caltech.edu/records/cnzr3-x6138", "eprint_id": 48315, "eprint_status": "archive", "datestamp": "2023-08-20 01:45:13", "lastmod": "2023-10-17 18:42:04", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Faulkner-M", "name": { "family": "Faulkner", "given": "Matthew" } }, { "id": "Clayton-R-W", "name": { "family": "Clayton", "given": "Robert" }, "orcid": "0000-0003-3323-3508" }, { "id": "Heaton-T-H", "name": { "family": "Heaton", "given": "Thomas H." }, "orcid": "0000-0003-3363-2197" }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Kohler-M-D", "name": { "family": "Kohler", "given": "Monica" } }, { "id": "Bunn-J", "name": { "family": "Bunn", "given": "Julian" }, "orcid": "0000-0002-3798-298X" }, { "id": "Guy-R", "name": { "family": "Guy", "given": "Richard" } }, { "id": "Liu-Annie-H", "name": { "family": "Liu", "given": "Annie" } }, { "id": "Olson-M", "name": { "family": "Olson", "given": "Michael" } }, { "id": "Cheng-Ming-Hei", "name": { "family": "Cheng", "given": "MingHei" } }, { "id": "Krause-A", "name": { "family": "Krause", "given": "Andreas" }, "orcid": "0000-0001-7260-9673" } ] }, "title": "The Caltech CSN project collects sensor data from thousands of personal devices for realtime response to dangerous earthquakes", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2014 ACM, Inc. \n\nWe would like to thank the Gordon and Betty Moore Foundation, the National Science Foundation (awards CNS0932392, IIS0953413), and European Research Council Starting Grant 307036. Andreas Krause was supported in part by a Microsoft Research Faculty Fellowship. We also thank Signal Hill Petroleum and Nodal Seismic for data from the Long\nBeach Network, and the Southern California Seismic Network for data from the permanent earthquake network in Southern California.\n\nSubmitted - Faulkner2013-CACM.pdf
", "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.", "date": "2014-07-01", "date_type": "published", "publication": "Communications of the ACM", "volume": "57", "number": "7", "publisher": "Association for Computing Machinery", "pagerange": "66-75", "id_number": "CaltechAUTHORS:20140811-131704662", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140811-131704662", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Gordon and Betty Moore Foundation" }, { "agency": "NSF", "grant_number": "CNS-0932392" }, { "agency": "NSF", "grant_number": "IIS-0953413" }, { "agency": "European Research Council (ERC)", "grant_number": "307036" }, { "agency": "Microsoft Research" } ] }, "local_group": { "items": [ { "id": "Seismological-Laboratory" }, { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.1145/2622633", "primary_object": { "basename": "Faulkner2013-CACM.pdf", "url": "https://authors.library.caltech.edu/records/cnzr3-x6138/files/Faulkner2013-CACM.pdf" }, "resource_type": "article", "pub_year": "2014", "author_list": "Faulkner, Matthew; Clayton, Robert; et el." }, { "id": "https://authors.library.caltech.edu/records/06xvj-bp732", "eprint_id": 48687, "eprint_status": "archive", "datestamp": "2023-08-20 01:38:28", "lastmod": "2023-10-17 19:32:46", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Faulkner-M", "name": { "family": "Faulkner", "given": "Matthew" } }, { "id": "Clayton-R-W", "name": { "family": "Clayton", "given": "Robert W." }, "orcid": "0000-0003-3323-3508" }, { "id": "Heaton-T-H", "name": { "family": "Heaton", "given": "Thomas" }, "orcid": "0000-0003-3363-2197" }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Kohler-M-D", "name": { "family": "Kohler", "given": "Monica D." } }, { "id": "Bunn-J", "name": { "family": "Bunn", "given": "Julian" }, "orcid": "0000-0002-3798-298X" }, { "id": "Guy-R", "name": { "family": "Guy", "given": "Richard" } }, { "id": "Liu-Annie-H", "name": { "family": "Liu", "given": "Annie" } }, { "id": "Olson-M", "name": { "family": "Olson", "given": "Michael" } }, { "id": "Cheng-Ming-Hei", "name": { "family": "Cheng", "given": "Ming-Hei" } }, { "id": "Krause-A", "name": { "family": "Krause", "given": "Andreas" }, "orcid": "0000-0001-7260-9673" } ] }, "title": "Community Sense and Response Systems: Your Phone as Quake Detector", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2014 ACM.\n\nWe would like to thank the Gordon and Betty Moore Foundation, the National Science Foundation (awards\nCNS0932392, IIS0953413), and European Research Council Starting Grant 307036. Andreas Krause was supported in part by a Microsoft Research Faculty Fellowship. We also\nthank Signal Hill Petroleum and Nodal Seismic for data from the Long Beach Network, and the Southern California Seismic Network for data from the permanent earthquake network in Southern California.\n\nAccepted Version - Faulkner2013-CACM.pdf
", "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.", "date": "2014-07", "date_type": "published", "publication": "Communications of the ACM", "volume": "57", "number": "7", "publisher": "Association for Computing Machinery", "pagerange": "66-75", "id_number": "CaltechAUTHORS:20140819-131736568", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140819-131736568", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Gordon and Betty Moore Foundation" }, { "agency": "NSF", "grant_number": "CNS-0932392" }, { "agency": "NSF", "grant_number": "IIS-0953413" }, { "agency": "European Research Council (ERC)", "grant_number": "307036" }, { "agency": "Microsoft Research" } ] }, "local_group": { "items": [ { "id": "Seismological-Laboratory" }, { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.1145/2622633", "primary_object": { "basename": "Faulkner2013-CACM.pdf", "url": "https://authors.library.caltech.edu/records/06xvj-bp732/files/Faulkner2013-CACM.pdf" }, "resource_type": "article", "pub_year": "2014", "author_list": "Faulkner, Matthew; Clayton, Robert W.; et el." }, { "id": "https://authors.library.caltech.edu/records/r68eb-k0712", "eprint_id": 42998, "eprint_status": "archive", "datestamp": "2023-08-22 10:44:31", "lastmod": "2023-10-25 23:11:47", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Cai-Desmond-W-H", "name": { "family": "Cai", "given": "Desmond W. H." }, "orcid": "0000-0001-9207-1890" }, { "id": "Adlakha-S", "name": { "family": "Adlakha", "given": "Sachin" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "De-Martini-P", "name": { "family": "De Martini", "given": "Paul" } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } } ] }, "title": "Impact of residential PV adoption on Retail Electricity Rates", "ispublished": "pub", "full_text_status": "restricted", "keywords": "PV adoption; Distributed energy adoption; Electricity rate spiral", "note": "\u00a9 2013 Elsevier Ltd. Received 27 November 2012. Accepted 2 July 2013. Available online 3 August 2013. We thank Prof. Adam Wierman, Prof. John Ledyard, and Dr. Julian Bunn of Caltech, Leonardo Von Prellwitz of Cisco, Jeff Gooding, Robert Sherick, Russell Garwac, Andre Ramirez, Sunil Shah, Lynda Ziegler, Paula Campbell, Gregg Ander, Carlos Haiad, Juan Menedex, Scott Mitchell, and Devin Rauss of SCE, Lena Hansen of Rocky Mountain Institute (RMI), Tom McDaniel, Jack Peurach, and Carl Lenox of SunPower, Hung-po Chao of NEISO, George Lee, and Neil Fromer of Caltech for helpful comments and input. This work was supported by NSF NetSE Grant CNS 0911041, ARPA-E Grant DE-AR0000226, Southern California Edison, National Science Council of Taiwan, R.O.C, Grant NSC 101-3113-P-008-001, Resnick Institute, and Okawa Foundation.", "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.", "date": "2013-11", "date_type": "published", "publication": "Energy Policy", "volume": "62", "publisher": "Elsevier", "pagerange": "830-843", "id_number": "CaltechAUTHORS:20131213-111904382", "issn": "0301-4215", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131213-111904382", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF NetSE", "grant_number": "CNS-0911041" }, { "agency": "ARPA-E", "grant_number": "DE-AR0000226" }, { "agency": "Southern California Edison" }, { "agency": "National Science Council (Taipei)", "grant_number": "NSC 101-3113-P-008-001" }, { "agency": "Resnick Sustainability Institute" }, { "agency": "Okawa Foundation" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1016/j.enpol.2013.07.009", "resource_type": "article", "pub_year": "2013", "author_list": "Cai, Desmond W. H.; Adlakha, Sachin; et el." }, { "id": "https://authors.library.caltech.edu/records/ybd4q-73m56", "eprint_id": 25497, "eprint_status": "archive", "datestamp": "2023-08-19 07:52:13", "lastmod": "2023-10-24 15:55:22", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Go-B", "name": { "family": "Go", "given": "Brian" } }, { "id": "Mitra-S", "name": { "family": "Mitra", "given": "Sayan" } }, { "id": "Pilotto-C", "name": { "family": "Pilotto", "given": "Concetta" } }, { "id": "White-J", "name": { "family": "White", "given": "Jerome" } } ] }, "title": "Verification of distributed systems with local\u2013global predicates", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Concurrency Convergence Local\u2013global Stability Theorem prover Verification", "note": "\u00a9 2010 BCS. Received 28 February 2009. Revised 1 October 2009. Accepted 8 March 2010 by T. Margaria, D. Kr\u00f6ning, and J. Woodcock. Published online 9 April 2010. The authors would like to thank the referees for their very helpful and constructive comments. This work was supported in part by the Multidisciplinary Research Initiative (MURI) from the Air Force Office of Scientific\nResearch.", "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.", "date": "2011-09", "date_type": "published", "publication": "Formal Aspects of Computing", "volume": "23", "number": "5", "publisher": "Springer", "pagerange": "649-679", "id_number": "CaltechAUTHORS:20110929-135751977", "issn": "0934-5043", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20110929-135751977", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)/Multidisciplinary University Research Initiative (MURI)" } ] }, "doi": "10.1007/s00165-010-0150-7", "resource_type": "article", "pub_year": "2011", "author_list": "Chandy, K. Mani; Go, Brian; et el." }, { "id": "https://authors.library.caltech.edu/records/rnqrr-5y876", "eprint_id": 29260, "eprint_status": "archive", "datestamp": "2023-08-19 04:56:08", "lastmod": "2023-10-24 22:02:47", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Clayton-R-W", "name": { "family": "Clayton", "given": "Robert W." }, "orcid": "0000-0003-3323-3508" }, { "id": "Heaton-T-H", "name": { "family": "Heaton", "given": "Thomas" }, "orcid": "0000-0003-3363-2197" }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "Mani" } }, { "id": "Krause-A", "name": { "family": "Krause", "given": "Andreas" }, "orcid": "0000-0001-7260-9673" }, { "id": "Kohler-M-D", "name": { "family": "Kohler", "given": "Monica" } }, { "id": "Bunn-J", "name": { "family": "Bunn", "given": "Julian" }, "orcid": "0000-0002-3798-298X" }, { "id": "Guy-R", "name": { "family": "Guy", "given": "Richard" } }, { "id": "Olson-M", "name": { "family": "Olson", "given": "Michael" } }, { "id": "Faulkner-M", "name": { "family": "Faulkner", "given": "Matthew" } }, { "id": "Cheng-Ming-Hei", "name": { "family": "Cheng", "given": "MingHei" } }, { "id": "Strand-L", "name": { "family": "Strand", "given": "Leif" } }, { "id": "Chandy-R", "name": { "family": "Chandy", "given": "Rishi" } }, { "id": "Obenshain-D", "name": { "family": "Obenshain", "given": "Daniel" } }, { "id": "Liu-Annie-H", "name": { "family": "Liu", "given": "Anne" } }, { "id": "Aivazis-M", "name": { "family": "Aivazis", "given": "Michael" } } ] }, "title": "Community Seismic Network", "ispublished": "pub", "full_text_status": "public", "keywords": "Seismology/Ground motion, Instruments and techniques, Seismic risk, Computational geophysics/Algorithms and implementation, Data dissemination/Seismological data", "note": "\u00a9 2011 Istituto Nazionale di Geofisica e Vulcanologia.\nThis work is licensed under a Creative Commons Attribution 3.0 License. \n\nReceived June 30, 2011; accepted October 26, 2011.\n\nThe development of the Community Seismic Network is supported by the Betty and Gordon Moore Foundation. This\nresearch is also supported by NSF Award CNS0932392. We \nthank NodalSeismic Inc. for the samples of data used in Figure 3. The manuscript was significantly improved by suggestions from the associate editor, Paul Earle, and a reviewer, Jesse Lawrence.\n\nPublished - Clayton2011p17102Ann_Geophys-Italy.pdf
", "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.", "date": "2011", "date_type": "published", "publication": "Annals of Geophysics", "volume": "54", "number": "6", "publisher": "Istituto Nazionale di Geofisica e Vulcanologia", "pagerange": "738-747", "id_number": "CaltechAUTHORS:20120213-121753118", "issn": "1593-5213", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120213-121753118", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Gordon and Betty Moore Foundation" }, { "agency": "NSF", "grant_number": "CNS-0932392" } ] }, "local_group": { "items": [ { "id": "Seismological-Laboratory" }, { "id": "Division-of-Geological-and-Planetary-Sciences" } ] }, "doi": "10.4401/ag-5269", "primary_object": { "basename": "Clayton2011p17102Ann_Geophys-Italy.pdf", "url": "https://authors.library.caltech.edu/records/rnqrr-5y876/files/Clayton2011p17102Ann_Geophys-Italy.pdf" }, "resource_type": "article", "pub_year": "2011", "author_list": "Clayton, Robert W.; Heaton, Thomas; et el." }, { "id": "https://authors.library.caltech.edu/records/nfnff-jr960", "eprint_id": 17375, "eprint_status": "archive", "datestamp": "2023-08-19 01:14:32", "lastmod": "2023-10-19 23:50:00", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Estrin-D", "name": { "family": "Estrin", "given": "Deborah" } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Young-R-M", "name": { "family": "Young", "given": "R. Michael" } }, { "id": "Smarr-L", "name": { "family": "Smarr", "given": "Larry" } }, { "id": "Odlyzko-A", "name": { "family": "Odlyzko", "given": "Andrew" } }, { "id": "Clark-D", "name": { "family": "Clark", "given": "David" } }, { "id": "Reding-V", "name": { "family": "Reding", "given": "Viviane" } }, { "id": "Ishida-T", "name": { "family": "Ishida", "given": "Toru" } }, { "id": "Sharma-Sharad", "name": { "family": "Sharma", "given": "Sharad" } }, { "id": "Cerf-V-G", "name": { "family": "Cerf", "given": "Vinton G." } }, { "id": "H\u00f6lzle-U", "name": { "family": "H\u00f6lzle", "given": "Urs" } }, { "id": "Barroso-L-A", "name": { "family": "Barroso", "given": "Luiz Andr\u00e9" } }, { "id": "Mulligan-G", "name": { "family": "Mulligan", "given": "Geoff" } }, { "id": "Hooke-A", "name": { "family": "Hooke", "given": "Adrian" } }, { "id": "Elliott-C", "name": { "family": "Elliott", "given": "Chip" } } ] }, "title": "Internet Predictions", "ispublished": "pub", "full_text_status": "public", "keywords": "participatory sensing, Internet, personal data vault, ubiquitous data capture, data processing, data protection, tussle, socio-technical systems, broadband, global networks, interactive entertainment, cloud computing, procedural content generation, climate, carbon emissions, green, Internet evolution, wireless, technology forecasting, prognosticators, vision, tussle, socio-technical systems, broadband, global networks, information society, future ICT for sustainable growth, Internet of Things, open machine translation, intercultural collaboration, services computing, language grid, cloud computing, bottom of the pyramid, quant revolution, multinationals, knowledge-worker, profit-center, creation net, Software engineering, telecommunications, space technology", "note": "\u00a9 2010 IEEE.\n\nPublished - Chandy2010p6880Ieee_Internet_Comput.pdf
Supplemental Material - mic2010010012s.pdf
", "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.", "date": "2010-01", "date_type": "published", "publication": "IEEE Internet Computing", "volume": "14", "number": "1", "publisher": "IEEE", "pagerange": "12-42", "id_number": "CaltechAUTHORS:20100202-112121782", "issn": "1089-7801", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20100202-112121782", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "collection": "CaltechAUTHORS", "doi": "10.1109/MIC.2010.12", "primary_object": { "basename": "Chandy2010p6880Ieee_Internet_Comput.pdf", "url": "https://authors.library.caltech.edu/records/nfnff-jr960/files/Chandy2010p6880Ieee_Internet_Comput.pdf" }, "related_objects": [ { "basename": "mic2010010012s.pdf", "url": "https://authors.library.caltech.edu/records/nfnff-jr960/files/mic2010010012s.pdf" } ], "resource_type": "article", "pub_year": "2010", "author_list": "Estrin, Deborah; Chandy, K. Mani; et el." }, { "id": "https://authors.library.caltech.edu/records/d3knq-mcm54", "eprint_id": 23250, "eprint_status": "archive", "datestamp": "2023-08-19 01:18:35", "lastmod": "2023-10-23 18:57:29", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } } ] }, "title": "The Impact of Sense and Respond Systems", "ispublished": "pub", "full_text_status": "public", "keywords": "participatory sensing, Internet, personal data vault, ubiquitous data capture, data processing, data protection, tussle, socio-technical systems, broadband, global networks, interactive entertainment, cloud computing, procedural content generation, climate, carbon emissions, green, Internet evolution, wireless, technology forecasting, prognosticators, vision, tussle, socio-technical systems, broadband, global networks, information society, future ICT for sustainable growth, Internet of Things, open machine translation, intercultural collaboration, services computing, language grid, cloud computing, bottom of the pyramid, quant revolution, multinationals, knowledge-worker, profit-center, creation net, Software engineering, telecommunications, space technology", "note": "\u00a9 2010 IEEE.\n\nPublished - Chandy2010p6880Ieee_Internet_Comput.pdf
", "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.", "date": "2010-01", "date_type": "published", "publication": "IEEE Internet Computing", "volume": "14", "number": "1", "publisher": "IEEE", "pagerange": "14-16", "id_number": "CaltechAUTHORS:20110407-094212599", "issn": "1089-7801", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20110407-094212599", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/MIC.20", "primary_object": { "basename": "Chandy2010p6880Ieee_Internet_Comput.pdf", "url": "https://authors.library.caltech.edu/records/d3knq-mcm54/files/Chandy2010p6880Ieee_Internet_Comput.pdf" }, "resource_type": "article", "pub_year": "2010", "author_list": "Chandy, K. Mani" }, { "id": "https://authors.library.caltech.edu/records/7zhvp-6as34", "eprint_id": 75006, "eprint_status": "archive", "datestamp": "2023-08-19 01:19:31", "lastmod": "2023-10-25 14:39:18", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } } ] }, "title": "The Impact of Sense and Response Systems", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2010 IEEE.\n\nPublished - 05370818.pdf
", "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.", "date": "2010-01", "date_type": "published", "publication": "IEEE Internet Computing", "volume": "14", "number": "1", "publisher": "IEEE", "pagerange": "14-16", "id_number": "CaltechAUTHORS:20170309-150535053", "issn": "1089-7801", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170309-150535053", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "collection": "CaltechAUTHORS", "doi": "10.1109/MIC.2010.12", "primary_object": { "basename": "05370818.pdf", "url": "https://authors.library.caltech.edu/records/7zhvp-6as34/files/05370818.pdf" }, "resource_type": "article", "pub_year": "2010", "author_list": "Chandy, K. Mani" }, { "id": "https://authors.library.caltech.edu/records/01nck-ntz85", "eprint_id": 98341, "eprint_status": "archive", "datestamp": "2023-08-22 01:30:55", "lastmod": "2023-10-18 17:16:23", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Charpentier-M", "name": { "family": "Charpentier", "given": "Michel" } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } } ] }, "title": "Specification transformers: a predicate transformer approach to composition", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Computer Program; General Theory; Desirable Property; Compositional System; Composition Operator", "note": "\u00a9 Springer-Verlag Berlin/Heidelberg 2004. \n\nReceived: 30 May 2002/ Revised version: 16 August 2003/ Published online: 30 October 2003.", "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.", "date": "2004-02", "date_type": "published", "publication": "Acta Informatica", "volume": "40", "number": "4", "publisher": "Springer-Verlag", "pagerange": "265-301", "id_number": "CaltechAUTHORS:20190829-131532981", "issn": "0001-5903", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190829-131532981", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1007/s00236-003-0130-y", "resource_type": "article", "pub_year": "2004", "author_list": "Charpentier, Michel and Chandy, K. Mani" }, { "id": "https://authors.library.caltech.edu/records/rrc2c-r7j16", "eprint_id": 99808, "eprint_status": "archive", "datestamp": "2023-08-21 22:55:58", "lastmod": "2023-10-18 18:49:26", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Charpentier-M", "name": { "family": "Charpentier", "given": "Michel" } } ] }, "title": "An Experiment in Program Composition and Proof", "ispublished": "pub", "full_text_status": "restricted", "keywords": "composition; formal specification; program verification; temporal logic; UNITY", "note": "\u00a9 2002 Kluwer Academic Publishers. \n\nThis work is supported by a grant from the Air Force Office of Scientific Research.", "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.", "date": "2002-01", "date_type": "published", "publication": "Formal Methods in System Design", "volume": "20", "number": "1", "publisher": "Springer", "pagerange": "7-21", "id_number": "CaltechAUTHORS:20191112-111040108", "issn": "0925-9856", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191112-111040108", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)" } ] }, "doi": "10.1023/a:1012952311559", "resource_type": "article", "pub_year": "2002", "author_list": "Chandy, K. Mani and Charpentier, Michel" }, { "id": "https://authors.library.caltech.edu/records/bvsmx-njk68", "eprint_id": 76449, "eprint_status": "archive", "datestamp": "2023-08-19 03:17:48", "lastmod": "2023-10-25 16:00:23", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Rifkin-A", "name": { "family": "Rifkin", "given": "Adam" } }, { "id": "Schooler-E-M", "name": { "family": "Schooler", "given": "Eve" } } ] }, "title": "Using announce-listen with global events to develop distributed control systems", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 1998 John Wiley & Sons. \n\nManuscript received: 28 February 1998. Manuscript revised: 01 April 1998. \n\nThis work was supported under the Caltech Infospheres Project is sponsored by the Air Force Office of Scientific Research under grant AFOSR F49620-94-1-0244, by the CISE directorate of the National Science Foundation under Problem Solving Environments grant CCR-9527130, by the NSF Center for Research on Parallel Computation under Cooperative Agreement Number CCR9120008, by a Microsoft Graduate Fellowship, and by Parasoft and Novell.\n\nSubmitted - 12147bcf2392f91927cb9a1255c259cc2f7b.pdf
", "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.", "date": "1998-09", "date_type": "published", "publication": "Concurrency and Computation: Practice and Experience", "volume": "10", "number": "11-13", "publisher": "Wiley", "pagerange": "1021-1027", "id_number": "CaltechAUTHORS:20170409-080717471", "issn": "1532-0626", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170409-080717471", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "F49620-94-1-0244" }, { "agency": "NSF", "grant_number": "CCR-9527130" }, { "agency": "NSF", "grant_number": "CCR-9120008" }, { "agency": "Microsoft" }, { "agency": "Parasoft Corporation" }, { "agency": "Novell Corporation" } ] }, "doi": "10.1002/(SICI)1096-9128(199809/11)10:11/13%3C1021::AID-CPE411%3E3.0.CO;2-K", "primary_object": { "basename": "12147bcf2392f91927cb9a1255c259cc2f7b.pdf", "url": "https://authors.library.caltech.edu/records/bvsmx-njk68/files/12147bcf2392f91927cb9a1255c259cc2f7b.pdf" }, "resource_type": "article", "pub_year": "1998", "author_list": "Chandy, K. Mani; Rifkin, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/hz17w-cpk10", "eprint_id": 46602, "eprint_status": "archive", "datestamp": "2023-08-19 01:54:17", "lastmod": "2023-10-26 19:52:07", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Kiniry-J-R", "name": { "family": "Kiniry", "given": "Joseph" }, "orcid": "0000-0002-3589-2454" }, { "id": "Rifkin-A", "name": { "family": "Rifkin", "given": "Adam" } }, { "id": "Zimmerman-D-M", "name": { "family": "Zimmerman", "given": "Daniel" } } ] }, "title": "Webs of Archived Distributed Computations for Asynchronous Collaboration", "ispublished": "pub", "full_text_status": "restricted", "keywords": "distributed systems, archiving, transactions, distributed sessions, global snapshots, asynchronous\ncollaboration, world wide web, infospheres, components, composition", "note": "\u00a9 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. Received August 8, 1996 ; Revised April 15, 1997.\nEditor: Salim Hariri. The Caltech Infospheres Project is sponsored by the Air Force Office of Scientific Research under grant AFOSR F49620-94-1-0244, by the CISE directorate of the National Science Foundation under Problem Solving\nEnvironments grant CCR-9527130, by the NSF Center for Research on Parallel Computation under Cooperative\nAgreement Number CCR-9120008, and by Novell, Inc. Please see http://www.infospheres.caltech.edu/ for more information about the Infospheres Infrastructure. The idea of archiving computational experiments in asynchronous\ncollaborations and linking the archived experiments was originally suggested by John Reynders and Peter Beckman of Los Alamos National Laboratories.", "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.", "date": "1997-10-01", "date_type": "published", "publication": "Journal of Supercomputing", "volume": "11", "number": "2", "publisher": "Springer Verlag", "pagerange": "101-118", "id_number": "CaltechAUTHORS:20140701-112530382", "issn": "0920-8542", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140701-112530382", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "F49620-94-1-0244" }, { "agency": "NSF CISE directorate Problem Solving Environments", "grant_number": "CCR-9527130" }, { "agency": "NSF Center for Research on Parallel Computation Cooperative Agreement Number", "grant_number": "CCR-9120008" } ] }, "doi": "10.1023/A:1007903821879", "resource_type": "article", "pub_year": "1997", "author_list": "Chandy, K. Mani; Kiniry, Joseph; et el." }, { "id": "https://authors.library.caltech.edu/records/314q7-4rp75", "eprint_id": 4352, "eprint_status": "archive", "datestamp": "2023-08-22 11:51:21", "lastmod": "2023-10-16 17:43:06", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Rifkin-A", "name": { "family": "Rifkin", "given": "Adam" } } ] }, "title": "Systematic composition of distributed objects: Processes and sessions", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 1997 by British Computer Society. \n\nReceived June, 1996; revised February, 1997. \n\nThis work constitutes part of the Caltech Infospheres Project; more information is available on the Web at http://www.infospheres.caltech.edu/. The Caltech Infospheres Project is sponsored by the Air Force Office of Scientific Research under grant AFOSR F49620-94-1-0244, by the NSF Center for Research on Parallel Computation under Cooperative Agreement Number CCR-9120008, by the CISE directorate of the National Science Foundation under Problem Solving Environments grant CCR-9527130, by the Advanced Research Projects Agency and by Novell, Inc.", "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.", "date": "1997-08-01", "date_type": "published", "publication": "Computer Journal", "volume": "40", "number": "8", "publisher": "Computer Journal", "pagerange": "465-478", "id_number": "CaltechAUTHORS:CHAcj97", "issn": "0010-4620", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:CHAcj97", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1093/comjnl/40.8.465", "primary_object": { "basename": "CHAcj97.pdf", "url": "https://authors.library.caltech.edu/records/314q7-4rp75/files/CHAcj97.pdf" }, "resource_type": "article", "pub_year": "1997", "author_list": "Chandy, K. Mani and Rifkin, Adam" }, { "id": "https://authors.library.caltech.edu/records/x0j0a-7hf56", "eprint_id": 46607, "eprint_status": "archive", "datestamp": "2023-08-19 00:52:17", "lastmod": "2023-10-26 19:52:24", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Rifkin-A", "name": { "family": "Rifkin", "given": "Adam" } } ] }, "title": "Systematic Composition of Objects in Distributed Internet Applications: Processes and Sessions", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 1997 IEEE. Date of Conference: 7-10 Jan 1997. This is supported in part by NSF grants CCR-912008 and CCR-9527130. This work constitutes part of the Caltecb Infospheres Project.\n\nPublished - Chandy_1997p395.pdf
", "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.", "date": "1997-01", "date_type": "published", "publication": "Proceedings of the Annual Hawaii International Conference on System Sciences", "volume": "1", "publisher": "IEEE", "pagerange": "395-404", "id_number": "CaltechAUTHORS:20140701-135237680", "issn": "1060-3425", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140701-135237680", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCR-912008" }, { "agency": "NSF", "grant_number": "CCR-9527130" } ] }, "doi": "10.1109/HICSS.1997.667288", "primary_object": { "basename": "Chandy_1997p395.pdf", "url": "https://authors.library.caltech.edu/records/x0j0a-7hf56/files/Chandy_1997p395.pdf" }, "resource_type": "article", "pub_year": "1997", "author_list": "Chandy, K. Mani and Rifkin, Adam" }, { "id": "https://authors.library.caltech.edu/records/y1mpw-tsq06", "eprint_id": 66579, "eprint_status": "archive", "datestamp": "2023-08-20 00:28:06", "lastmod": "2023-10-18 18:36:04", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bagrodia-R", "name": { "family": "Bagrodia", "given": "R." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Liao-Wen-Toh", "name": { "family": "Liao", "given": "Wen Toh" } } ] }, "title": "A Unifying Framework Distributed Simulation", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Algorithms, Languages, Performance, Theory, Maisie, space-time simulation, time-parallel simulation, UNITY", "note": "\u00a9 1991 ACM.\n\nReceived September 1991; accepted May 1992.", "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.", "date": "1991-10", "date_type": "published", "publication": "ACM Transactions on Modeling and Computer Simulation (TOMACS)", "volume": "1", "number": "4", "publisher": "ACM", "pagerange": "348-385", "id_number": "CaltechAUTHORS:20160502-095026188", "issn": "1049-3301", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160502-095026188", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/130611.130614", "resource_type": "article", "pub_year": "1991", "author_list": "Bagrodia, R.; Chandy, K. M.; et el." }, { "id": "https://authors.library.caltech.edu/records/4chat-vem22", "eprint_id": 41468, "eprint_status": "archive", "datestamp": "2023-08-19 17:35:10", "lastmod": "2023-10-24 23:46:04", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Lamport-L", "name": { "family": "Lamport", "given": "Leslie" } } ] }, "title": "Distributed Snapshots: Determining Global States of a Distributed System", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Words and Phrases: Global States, Distributed deadlock detection, distributed \nsystems, message communication systems", "note": "Copyright \u00a9 1985 ACM, Inc. \n\nReceived January 1984; revised September 1984; accepted 7 December 1984. \n\nThis work was supported in part by the Air Force Office of Scientific Research under Grant AFOSR 81-0205 and in part by the National Science Foundation under Grant MCS 81-04459. \n\nJ. Misra's contributions in defining the problem of global state detection are \ngratefully acknowledged. We are grateful to E. W. Dijkstra and C. S. Scholten \nfor their comments-particularly regarding the proof of Theorem 1. The outline \nof the current version of the proof was suggested by them. Dijkstra's note [3] on \nthe subject provides colorful insight into the problem of stability detection. \nThanks are due to C. A. R. Hoare, F. Schneider, and G. Andrews who helped us \nwith detailed comments. We are grateful to Anita Jones and anonymous referees \nfor suggestions.", "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.", "date": "1985-02", "date_type": "published", "publication": "ACM Transactions on Computer Systems", "volume": "3", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "63-75", "id_number": "CaltechAUTHORS:20130923-092736838", "issn": "0734-2071", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130923-092736838", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "81-0205" }, { "agency": "NSF", "grant_number": "MCS 81-04459" } ] }, "doi": "10.1145/214451.214456", "resource_type": "article", "pub_year": "1985", "author_list": "Chandy, K. Mani and Lamport, Leslie" }, { "id": "https://authors.library.caltech.edu/records/edwde-vty84", "eprint_id": 478, "eprint_status": "archive", "datestamp": "2023-08-22 04:06:08", "lastmod": "2023-10-13 21:50:01", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bryant-R-M", "name": { "family": "Bryant", "given": "Raymond M." } }, { "id": "Krzesinski-A-E", "name": { "family": "Krzesinski", "given": "Anthony E." } }, { "id": "Lakshmi-M-S", "name": { "family": "Lakshmi", "given": "M. Seetha" } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } } ] }, "title": "The MVA Priority Approximation", "ispublished": "pub", "full_text_status": "public", "keywords": "Performance, Theory, Approximate solutions, error analysis, mean value analysis, multiclass queuing networks, priority queuing networks, product form solutions", "note": "\"\u00a9 ACM, 1984. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Computer Systems (TOCS), 2, 4, November 1984 http://doi.acm.org/10.1145/357401.357406\" \n\nReceived June 1983; revised July 1984; accepted July 1984. \n\nThe global balance solver used to calculate the exact solutions was written by Bryan Rosenburg of the University of Wisconsin-Madison. This program was an essential part of the research reported here. Dinkar Sitaram, also of the University of Wisconsin-Madison, provided valuable assistance during the early phase of testing of the MVA algorithms reported here.", "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.", "date": "1984-11", "date_type": "published", "publication": "ACM Transactions on Computer Systems", "volume": "2", "number": "4", "publisher": "Association for Computing Machinery", "pagerange": "335-359", "id_number": "CaltechAUTHORS:BRYacmtcs84", "issn": "0734-2071", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:BRYacmtcs84", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "primary_object": { "basename": "BRYacmtcs84.pdf", "url": "https://authors.library.caltech.edu/records/edwde-vty84/files/BRYacmtcs84.pdf" }, "resource_type": "article", "pub_year": "1984", "author_list": "Bryant, Raymond M.; Krzesinski, Anthony E.; et el." }, { "id": "https://authors.library.caltech.edu/records/yst31-ssw92", "eprint_id": 92227, "eprint_status": "archive", "datestamp": "2023-08-19 17:11:51", "lastmod": "2023-10-20 00:06:39", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Misra-J", "name": { "family": "Misra", "given": "J." } } ] }, "title": "The drinking philosophers problem", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Asymmetry, dining philosophers problem", "note": "\u00a9 1984 ACM. \n\nReceived May 1983; revised February 1984; accepted May 1984. \n\nLecture notes in computer science Vol. 174. \n\nThis work was supported by the Air Force Office of Scientific Research under grant AFOSR 81-0205. \n\nWe thank W.H.J. Feijen and A.J.M. Van Gasteren of Eindhoven University of Technology and Greg Andrews of the University of Arizona for their detailed comments. We are grateful to three unknown referees and to Susan Graham for detailed comments. Conversations with E.W. Dijkstra on this problem were most helpful.", "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.", "date": "1984-10", "date_type": "published", "publication": "ACM Transactions on Programming Languages and Systems (TOPLAS)", "volume": "6", "number": "4", "publisher": "Association for Computing Machinery", "pagerange": "632-646", "id_number": "CaltechAUTHORS:20190111-153432743", "issn": "0164-0925", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-153432743", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "81-0205" } ] }, "doi": "10.1145/1780.1804", "resource_type": "article", "pub_year": "1984", "author_list": "Chandy, K. M. and Misra, J." }, { "id": "https://authors.library.caltech.edu/records/gsez6-b8b74", "eprint_id": 92228, "eprint_status": "archive", "datestamp": "2023-08-19 15:58:43", "lastmod": "2023-10-20 00:06:42", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Misra-J", "name": { "family": "Misra", "given": "Jayadev" } }, { "id": "Haas-L-M", "name": { "family": "Haas", "given": "Laura M." } } ] }, "title": "Distributed deadlock detection", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Distributed deadlock detection, message communication systems, resource deadlock, communication deadlock", "note": "\u00a9 1983 ACM. \n\nReceived May 1981; revised August 1982; accepted November 1982. \n\nThis work has been supported by the Air Force Office of Scientific Research under grant AFOSR 81-0205 and by the University of Texas under a grant from the University Research Institute. \n\nWe are particularly grateful to E. W. Dijkstra and C. S. Scholten for their encouragement and advice. In particular, the proof of Theorem 2 was suggested by Scholten. We were helped greatly by comments from G. Andrews, N. Francez, C. A. R. Hoare, Anita Jones, and F. Schneider. Special thanks to the referees for their comments.", "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.", "date": "1983-05", "date_type": "published", "publication": "ACM Transactions on Computer Systems", "volume": "1", "number": "2", "publisher": "Association for Computing Machinery", "pagerange": "144-156", "id_number": "CaltechAUTHORS:20190111-154120345", "issn": "0734-2071", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-154120345", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "81-0205" }, { "agency": "University of Texas" } ] }, "doi": "10.1145/357360.357365", "resource_type": "article", "pub_year": "1983", "author_list": "Chandy, K. Mani; Misra, Jayadev; et el." }, { "id": "https://authors.library.caltech.edu/records/8q5hm-qnk74", "eprint_id": 92224, "eprint_status": "archive", "datestamp": "2023-08-19 15:55:40", "lastmod": "2023-10-20 00:06:20", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Martin-A-J", "name": { "family": "Martin", "given": "A. J." } } ] }, "title": "A Characterization of Product-Form Queuing Networks", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Networks, product form", "note": "\u00a9 1983 ACM. \n\nThis work was supported by the National Science Foundation under Grant MCS 81-01911. \n\nThe phrase \"distinguished class\" was suggested by G. E. Lindzey, Jr. The word \"balanced\" and the balanced lemma were suggested by a referee. Helpful comments from both referees and from M. S. Goheen improved the paper.", "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.", "date": "1983-04", "date_type": "published", "publication": "Journal of the ACM", "volume": "30", "number": "2", "publisher": "Association for Computing Machinery", "pagerange": "286-299", "id_number": "CaltechAUTHORS:20190111-145202534", "issn": "0004-5411", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-145202534", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "MCS 81-01911" } ] }, "doi": "10.1145/322374.322378", "resource_type": "article", "pub_year": "1983", "author_list": "Chandy, K. M. and Martin, A. J." }, { "id": "https://authors.library.caltech.edu/records/2xtxh-6m967", "eprint_id": 92256, "eprint_status": "archive", "datestamp": "2023-08-19 15:28:49", "lastmod": "2023-10-20 00:08:42", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Neuse-D", "name": { "family": "Neuse", "given": "Doug" } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } } ] }, "title": "HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Approximations, analytical models, performance analysis,\ngeneral closed queueing networks, computer system models, priority scheduling, non-local-balance, non-product-form, aggregation theorem", "note": "\u00a9 1982 ACM. \n\nThis work was supported in part by NSF Grant MCS81-01911.", "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.", "date": "1982-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "11", "number": "4", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "195-212", "id_number": "CaltechAUTHORS:20190114-142130380", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-142130380", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "MCS81-01911" } ] }, "doi": "10.1145/1035293.1035322", "resource_type": "article", "pub_year": "1982", "author_list": "Neuse, Doug and Chandy, K. Mani" }, { "id": "https://authors.library.caltech.edu/records/ng6k6-kmm84", "eprint_id": 92211, "eprint_status": "archive", "datestamp": "2023-08-19 15:24:41", "lastmod": "2023-10-20 00:05:17", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Misra-J", "name": { "family": "Misra", "given": "J." } } ] }, "title": "Distributed computation on graphs: shortest path algorithms", "ispublished": "pub", "full_text_status": "restricted", "keywords": "distributed computation, shortest path, negative cycle, depth first search, diffusing computation", "note": "\u00a9 1982 ACM. \n\nReceived 7/80; revised 9/81; accepted 3/82. \n\nThis work was supported in part by the Air Force Office of Scientific Research under grant AFOSR 81-0205. \n\nWe are indebted to E. W. Dijkstra for his comments on an earlier draft of this paper; his suggestions led to more concise proofs in Section 5. We are also grateful to unknown referees and M. D. McIlroy for their suggestions and corrections.", "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.", "date": "1982-11", "date_type": "published", "publication": "Communications of the ACM", "volume": "25", "number": "11", "publisher": "Association for Computing Machinery", "pagerange": "833-837", "id_number": "CaltechAUTHORS:20190111-085547749", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-085547749", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "81-0205" } ] }, "doi": "10.1145/358690.358717", "resource_type": "article", "pub_year": "1982", "author_list": "Chandy, K. M. and Misra, J." }, { "id": "https://authors.library.caltech.edu/records/gtmpd-e9875", "eprint_id": 92205, "eprint_status": "archive", "datestamp": "2023-08-19 15:21:13", "lastmod": "2023-10-20 00:04:44", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Misra-J", "name": { "family": "Misra", "given": "J." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } } ] }, "title": "A Distributed Graph Algorithm: Knot Detection", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Distributed algorithms, message communication, knot", "note": "\u00a9 1982 ACM. \n\nReceived September 1981; revised May 1982; accepted May 1982. \n\nSupported in part by the Air Force under grant AFOSR 81-0205. \n\nWe gratefully acknowledge the suggestions of E. W. Dijkstra and C. S. Scholten, on whose work this paper is based. We are also grateful to two anonymous referees for their valuable comments.", "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.", "date": "1982-10", "date_type": "published", "publication": "ACM Transactions on Programming Languages and Systems (TOPLAS)", "volume": "4", "number": "4", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "678-686", "id_number": "CaltechAUTHORS:20190110-150349106", "issn": "0164-0925", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190110-150349106", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "81-0205" } ] }, "resource_type": "article", "pub_year": "1982", "author_list": "Misra, J. and Chandy, K. M." }, { "id": "https://authors.library.caltech.edu/records/ewa81-51v69", "eprint_id": 92250, "eprint_status": "archive", "datestamp": "2023-08-19 14:55:03", "lastmod": "2023-10-20 00:08:07", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Neuse-D", "name": { "family": "Neuse", "given": "Doug" } } ] }, "title": "Linearizer: a heuristic algorithm for queueing network models of computing systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "closed queueing network, product-form queueing network, local balance queueing network", "note": "\u00a9 1982 ACM. \n\nReceived 9/80; revised 1/81; accepted 6/81. \n\nThis work was supported in part by the National Science Foundation under Grant MCS74-13302.", "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.", "date": "1982-02", "date_type": "published", "publication": "Communications of the ACM", "volume": "25", "number": "2", "publisher": "Association for Computing Machinery", "pagerange": "126-134", "id_number": "CaltechAUTHORS:20190114-104059640", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-104059640", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "MCS74-13302" } ] }, "doi": "10.1145/358396.358403", "resource_type": "article", "pub_year": "1982", "author_list": "Chandy, K. Mani and Neuse, Doug" }, { "id": "https://authors.library.caltech.edu/records/xcg4x-8cw89", "eprint_id": 92217, "eprint_status": "archive", "datestamp": "2023-08-19 14:49:40", "lastmod": "2023-10-20 00:05:40", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Misra-J", "name": { "family": "Misra", "given": "Jayadev" } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } } ] }, "title": "Termination Detection of Diffusing Computations in Communicating Sequential Processes", "ispublished": "pub", "full_text_status": "restricted", "keywords": "distributed systems, networks of processes, termination detection, diffusing computation", "note": "\u00a9 1982 ACM. \n\nReceived April 1980; revised October 1980 and June 1981; accepted June 1981. \n\nThis research was supported in part by the National Science Foundation under grant MCS-79-25383 and by ARPA Systems Modeling Parts II and III under grant N00039-78-G-0080. \n\nWe are grateful to R. Kieburtz, S. Owicki, A. Silberschatz, and C. S. Scholten for comments on this paper. Constructive comments of the referees helped considerably in improving the exposition.", "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.", "date": "1982-01", "date_type": "published", "publication": "ACM Transactions on Programming Languages and Systems (TOPLAS)", "volume": "4", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "37-43", "id_number": "CaltechAUTHORS:20190111-133115677", "issn": "0164-0925", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-133115677", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "MCS-79-25383" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00039-78-G-0080" }, { "agency": "Advanced Research Projects Agency (ARPA)" } ] }, "doi": "10.1145/357153.357156", "resource_type": "article", "pub_year": "1982", "author_list": "Misra, Jayadev and Chandy, K. M." }, { "id": "https://authors.library.caltech.edu/records/cpq9r-h3329", "eprint_id": 92223, "eprint_status": "archive", "datestamp": "2023-08-19 14:23:15", "lastmod": "2023-10-20 00:06:14", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Neuse-D", "name": { "family": "Neuse", "given": "D." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K." } } ] }, "title": "SCAT: A heuristic algorithm for queueing network models of computing systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Queueing networks, product-form, approximations, analytic models, performance analysis, load-dependent queues, iterative algorithms", "note": "\u00a9 1981 ACM. \n\nThis work was supported in part by NSF Grant MCS74-13302.", "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.", "date": "1981-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "10", "number": "3", "publisher": "Association for Computing Machinery", "pagerange": "59-79", "id_number": "CaltechAUTHORS:20190111-144627224", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-144627224", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "MCS74-13302" } ] }, "doi": "10.1145/1010629.805476", "resource_type": "article", "pub_year": "1981", "author_list": "Neuse, D. and Chandy, K." }, { "id": "https://authors.library.caltech.edu/records/zn706-92571", "eprint_id": 92257, "eprint_status": "archive", "datestamp": "2023-08-19 14:06:05", "lastmod": "2023-10-20 00:08:45", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Misra-J", "name": { "family": "Misra", "given": "J." } } ] }, "title": "Asynchronous distributed simulation via a sequence of parallel computations", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 1981 ACM. \n\nReceived 2/80; revised 9/80; accepted 12/80. \n\nThis work is partially supported by NSF grants MCS77-09812 and MCS 79-25383 and AFOSR 77-3409.", "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.", "date": "1981-04", "date_type": "published", "publication": "Communications of the ACM", "volume": "24", "number": "4", "publisher": "Association for Computing Machinery", "pagerange": "198-206", "id_number": "CaltechAUTHORS:20190114-142711979", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-142711979", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "MCS 77-09812" }, { "agency": "NSF", "grant_number": "MCS 79-25383" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "77-3409" } ] }, "doi": "10.1145/358598.358613", "resource_type": "article", "pub_year": "1981", "author_list": "Chandy, K. M. and Misra, J." }, { "id": "https://authors.library.caltech.edu/records/nah4f-8yr79", "eprint_id": 92262, "eprint_status": "archive", "datestamp": "2023-08-19 13:32:14", "lastmod": "2023-10-20 00:09:09", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Sauer-C-H", "name": { "family": "Sauer", "given": "Charles H." } } ] }, "title": "Computational algorithms for product form queueing networks", "ispublished": "pub", "full_text_status": "restricted", "keywords": "performance evaluation, queueing networks, product form", "note": "\u00a9 1980 ACM. \n\nReceived 2/80; accepted 4/80; revised 5/80. \n\nWe are grateful to G.S. Graham and anonymous referees for their comments on a draft of this paper.", "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.", "date": "1980-10", "date_type": "published", "publication": "Communications of the ACM", "volume": "23", "number": "10", "publisher": "Association for Computing Machinery", "pagerange": "573-583", "id_number": "CaltechAUTHORS:20190114-151918151", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-151918151", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/359015.359020", "resource_type": "article", "pub_year": "1980", "author_list": "Chandy, K. Mani and Sauer, Charles H." }, { "id": "https://authors.library.caltech.edu/records/z8v92-mjd86", "eprint_id": 92210, "eprint_status": "archive", "datestamp": "2023-08-19 13:22:34", "lastmod": "2023-10-20 00:05:12", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Misra-J", "name": { "family": "Misra", "given": "J." } } ] }, "title": "A simple model of distributed programs based on implementation-hiding and process autonomy", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 1980 ACM. \n\nWork partially supported by AFOSR AF77-3409.", "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.", "date": "1980-07", "date_type": "published", "publication": "ACM SIGPLAN Notices", "volume": "15", "number": "7-8", "publisher": "Association for Computing Machinery", "pagerange": "26-35", "id_number": "CaltechAUTHORS:20190111-083035370", "issn": "0362-1340", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-083035370", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "AF77-3409" } ] }, "doi": "10.1145/947680.947681", "resource_type": "article", "pub_year": "1980", "author_list": "Chandy, K. M. and Misra, J." }, { "id": "https://authors.library.caltech.edu/records/693nm-nwf04", "eprint_id": 92196, "eprint_status": "archive", "datestamp": "2023-08-19 13:18:13", "lastmod": "2023-10-20 00:04:18", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Sauer-C-H", "name": { "family": "Sauer", "given": "Charles H." } } ] }, "title": "Computational algorithms for product form queueing networks", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Performance evaluation, queueing networks, product form", "note": "\u00a9 1980 ACM.", "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.", "date": "1980-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "9", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "1", "id_number": "CaltechAUTHORS:20190110-110914947", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190110-110914947", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/800199.806144", "resource_type": "article", "pub_year": "1980", "author_list": "Chandy, K. Mani and Sauer, Charles H." }, { "id": "https://authors.library.caltech.edu/records/ej0xr-f1s55", "eprint_id": 92216, "eprint_status": "archive", "datestamp": "2023-08-19 12:00:52", "lastmod": "2023-10-20 00:05:37", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Sauer-C-H", "name": { "family": "Sauer", "given": "Charles H." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } } ] }, "title": "The impact of distributions and disciplines on multiple processor systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "multiprogramming, multiprocessing, scheduling disciplines, performance", "note": "\u00a9 1979 ACM. \n\nReceived June 1976; revised September 1977. \n\nThis work was supported by the National Science Foundation under Grant GJ-35109. \n\nPart of this work was done at the IBM Thomas J. Watson Research Center and the authors are grateful to Donald Tang, Donald Frazer, and Hisashi Kobayashi for help and encouragement. The authors also wish to thank James Browne for his help.", "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.", "date": "1979-01", "date_type": "published", "publication": "Communications of the ACM", "volume": "22", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "25-34", "id_number": "CaltechAUTHORS:20190111-105904204", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-105904204", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "GJ-35109" } ] }, "doi": "10.1145/359046.359053", "resource_type": "article", "pub_year": "1979", "author_list": "Sauer, Charles H. and Chandy, K. Mani" }, { "id": "https://authors.library.caltech.edu/records/xz3n2-5d526", "eprint_id": 92232, "eprint_status": "archive", "datestamp": "2023-08-19 11:40:24", "lastmod": "2023-10-20 00:07:03", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Towsley-D", "name": { "family": "Towsley", "given": "D." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Browne-J-C", "name": { "family": "Browne", "given": "J. C." } } ] }, "title": "Models for parallel processing within programs: application to CPU: I/O and I/O: I/O overlap", "ispublished": "pub", "full_text_status": "restricted", "keywords": "multiprogramming, parallel processing, queueing network models, multiprocessing of computation and I/O", "note": "\u00a9 1978 ACM. \n\nReceived January 1977; revised January 1978.", "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.", "date": "1978-10", "date_type": "published", "publication": "Communications of the ACM", "volume": "21", "number": "10", "publisher": "Association for Computing Machinery", "pagerange": "821-831", "id_number": "CaltechAUTHORS:20190111-161030053", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-161030053", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/359619.359622", "resource_type": "article", "pub_year": "1978", "author_list": "Towsley, D.; Chandy, K. M.; et el." }, { "id": "https://authors.library.caltech.edu/records/e133d-15388", "eprint_id": 92230, "eprint_status": "archive", "datestamp": "2023-08-19 11:37:35", "lastmod": "2023-10-20 00:06:52", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Sauer-C-H", "name": { "family": "Sauer", "given": "Charles H." } } ] }, "title": "Approximate Methods for Analyzing Queueing Network Models of Computing Systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "performance evaluation, queueing networks, approximate solutions, hierarchical modeling", "note": "\u00a9 1978 ACM. \n\nReceived February 6, 1978; Final revision accepted June 7, 1978.", "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.", "date": "1978-09", "date_type": "published", "publication": "ACM Computing Surveys", "volume": "10", "number": "3", "publisher": "Association for Computing Machinery", "pagerange": "281-317", "id_number": "CaltechAUTHORS:20190111-155805180", "issn": "0360-0300", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-155805180", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/356733.356737", "resource_type": "article", "pub_year": "1978", "author_list": "Chandy, K. Mani and Sauer, Charles H." }, { "id": "https://authors.library.caltech.edu/records/rkqwk-s0081", "eprint_id": 92167, "eprint_status": "archive", "datestamp": "2023-08-19 10:35:09", "lastmod": "2023-10-20 00:02:17", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Howard-J-H", "name": { "family": "Howard", "given": "John H." } }, { "id": "Towsley-D-F", "name": { "family": "Towsley", "given": "Donald F." } } ] }, "title": "Product Form and Local Balance in Queueing Networks", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 1977 Association for Computing Machinery, Inc. \n\nThis work was supported by the National Science Foundation under Grants DCR 74-13302 and GJ-1084.", "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.", "date": "1977-04", "date_type": "published", "publication": "Journal of the ACM", "volume": "24", "number": "2", "publisher": "Association for Computing Machinery", "pagerange": "250-263", "id_number": "CaltechAUTHORS:20190109-110649524", "issn": "0004-5411", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190109-110649524", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "DCR 74-13302" }, { "agency": "NSF", "grant_number": "GJ-1084" } ] }, "doi": "10.1145/322003.322009", "resource_type": "article", "pub_year": "1977", "author_list": "Chandy, K. Mani; Howard, John H.; et el." }, { "id": "https://authors.library.caltech.edu/records/p83vd-95268", "eprint_id": 92172, "eprint_status": "archive", "datestamp": "2023-08-19 10:32:03", "lastmod": "2023-10-20 00:02:31", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Brown-R-M", "name": { "family": "Brown", "given": "R. M." } }, { "id": "Browne-J-C", "name": { "family": "Browne", "given": "J. C." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } } ] }, "title": "Memory management and response time", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 1977 Association for Computing Machinery, Inc. \n\nReceived June 1974; revised June 1976. \n\nThis research was partially supported by the National Science Foundation under Grants GJ-1084 and DCR 74-13302.", "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.", "date": "1977-03", "date_type": "published", "publication": "Communications of the ACM", "volume": "20", "number": "3", "publisher": "Association for Computing Machinery", "pagerange": "153-165", "id_number": "CaltechAUTHORS:20190109-124527286", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190109-124527286", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "GJ-1084" }, { "agency": "NSF", "grant_number": "DCR 74-13302" } ] }, "doi": "10.1145/359436.359443", "resource_type": "article", "pub_year": "1977", "author_list": "Brown, R. M.; Browne, J. C.; et el." }, { "id": "https://authors.library.caltech.edu/records/52r9z-27e04", "eprint_id": 92251, "eprint_status": "archive", "datestamp": "2023-08-19 09:38:18", "lastmod": "2023-10-20 00:08:12", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Reynolds-P-F", "name": { "family": "Reynolds", "given": "P. F." } } ] }, "title": "Scheduling partially ordered tasks with probabilistic execution times", "ispublished": "pub", "full_text_status": "restricted", "keywords": "deterministic models, probabilistic models, multi-tasking, multiprocessing", "note": "\u00a9 1975 ACM. \n\nThis research was supported by NSF Grant DCR74-13302.", "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.", "date": "1975-11", "date_type": "published", "publication": "ACM SIGOPS Operating Systems Review", "volume": "9", "number": "5", "publisher": "Association for Computing Machinery", "pagerange": "169-177", "id_number": "CaltechAUTHORS:20190114-104559390", "issn": "0163-5980", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190114-104559390", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "DCR74-13302" } ] }, "doi": "10.1145/800213.806534", "resource_type": "article", "pub_year": "1975", "author_list": "Chandy, K. M. and Reynolds, P. F." }, { "id": "https://authors.library.caltech.edu/records/yp0j7-mwf72", "eprint_id": 92221, "eprint_status": "archive", "datestamp": "2023-08-19 09:22:21", "lastmod": "2023-10-20 00:06:06", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Baskett-F", "name": { "family": "Baskett", "given": "Forest" } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. Mani" } }, { "id": "Muntz-R-R", "name": { "family": "Muntz", "given": "Richard R." } }, { "id": "Palacios-F-G", "name": { "family": "Palacios", "given": "Fernando G." } } ] }, "title": "Open, Closed, and Mixed Networks of Queues with Different Classes of Customers", "ispublished": "pub", "full_text_status": "restricted", "keywords": "networks of queues, theory of queues, queueing theory, multiprogramming, time-sharing, processor sharing, Markov processes", "note": "\u00a9 1975, Association for Computing Machinery, Inc. \n\nReceived August 1972; Revised August 1974. \n\nThis research was supported in part by the U.S. Army, U.S. Navy, and U.S. Air Force Joint Services Electronics Programs under Contract N-00013-67-A-0112-0044, in part by the National Science Foundation under Grants GJ-1084 and GJ-35109, and in part by the Advanced Research Projects Agency of the Department of Defense under Contract DAHC-15-69-C-0158.", "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.", "date": "1975-04", "date_type": "published", "publication": "Journal of the ACM", "volume": "22", "number": "2", "publisher": "Association for Computing Machinery", "pagerange": "248-260", "id_number": "CaltechAUTHORS:20190111-140309634", "issn": "0004-5411", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-140309634", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Army Research Office (ARO)" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N-00013-67-A-0112-0044" }, { "agency": "Air Force Office of Scientific Research (AFOSR)" }, { "agency": "NSF", "grant_number": "GJ-1084" }, { "agency": "NSF", "grant_number": "GJ-35109" }, { "agency": "Advanced Research Projects Agency (ARPA)", "grant_number": "DAHC-15-69-C-0158" } ] }, "doi": "10.1145/321879.321887", "resource_type": "article", "pub_year": "1975", "author_list": "Baskett, Forest; Chandy, K. Mani; et el." }, { "id": "https://authors.library.caltech.edu/records/376rf-v3s31", "eprint_id": 92231, "eprint_status": "archive", "datestamp": "2023-08-19 09:10:00", "lastmod": "2023-10-20 00:06:58", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Adam-T-L", "name": { "family": "Adam", "given": "Thomas L." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } }, { "id": "Dickson-J-R", "name": { "family": "Dickson", "given": "J. R." } } ] }, "title": "A comparison of list schedules for parallel processing systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "parallel processing, precedence graphs, scheduling, list scheduling, optimization, dynamic programing", "note": "\u00a9 1974 Association for Computing Machinery, Inc. \n\nReceived April 1973; revised February 1974. \n\nThis work was supported by NSF Grant GJ-35109. \n\nThe authors would like to thank Professor Edward G. Coffman for his suggestions.", "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.", "date": "1974-12", "date_type": "published", "publication": "Communications of the ACM", "volume": "17", "number": "12", "publisher": "Association for Computing Machinery", "pagerange": "685-690", "id_number": "CaltechAUTHORS:20190111-160504256", "issn": "0001-0782", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190111-160504256", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "GJ-35109" } ] }, "doi": "10.1145/361604.361619", "resource_type": "article", "pub_year": "1974", "author_list": "Adam, Thomas L.; Chandy, K. M.; et el." }, { "id": "https://authors.library.caltech.edu/records/19as9-c9990", "eprint_id": 92206, "eprint_status": "archive", "datestamp": "2023-08-19 07:09:15", "lastmod": "2023-10-20 00:04:52", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Ramamoorthy-C-V", "name": { "family": "Ramamoorthy", "given": "C. V." } }, { "id": "Chandy-K-M", "name": { "family": "Chandy", "given": "K. M." } } ] }, "title": "Optimization of Memory Hierarchies in Multiprogrammed Systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "memory hierarchy, optimization, multiprogramming", "note": "\u00a9 1970 ACM. \n\nReceived December 1967; Revised November 1969. \n\nThe authors sincerely thank Mr. Richard Collier, graduate student at the University of Texas, for programming and simulation help.", "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.", "date": "1970-07", "date_type": "published", "publication": "Journal of the ACM", "volume": "17", "number": "3", "publisher": "Association for Computing Machinery", "pagerange": "426-445", "id_number": "CaltechAUTHORS:20190110-155953410", "issn": "0004-5411", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190110-155953410", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "resource_type": "article", "pub_year": "1970", "author_list": "Ramamoorthy, C. V. and Chandy, K. M." } ]