Synchronization mechanisms for modular programming languages:
Any programming language that supports concurrency needs a synchronization construct with which to express access control for shared resources. This thesis examines synchronization constructs from the standpoint of language design for reliable software. The criteria a synchronization mechanism must...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1979
|
| Schlagworte: | |
| Zusammenfassung: | Any programming language that supports concurrency needs a synchronization construct with which to express access control for shared resources. This thesis examines synchronization constructs from the standpoint of language design for reliable software. The criteria a synchronization mechanism must satisfy to support construction of reliable, easily maintainable concurrent software are defined. Some of these criteria, such as expressive power, can be defined only with respect to the set of problems the mechanism is expected to handle. A definition of the range of problems considered to be synchronization problems is therefore needed. Such a definition is provided by describing the possible types of constraints that may be imposed on access to shared resources. We then use this taxonomy of synchronization constraints to develop techniques for evaluating how well synchronization constructs meet the criteria discussed. These techniques are then applied to three existing synchronization mechanisms: monitors, path expressions, and serializers. Evaluations are presented, and the three mechanisms compared. (Author). |
| Beschreibung: | Zugl.: Diss., 1979 |
| Beschreibung: | 116 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021875865 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880222s1979 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227411288 | ||
| 035 | |a (DE-599)BVBBV021875865 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-211 | ||
| 100 | 1 | |a Bloom, Toby |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Synchronization mechanisms for modular programming languages |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1979 | |
| 300 | |a 116 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Zugl.: Diss., 1979 | ||
| 520 | 3 | |a Any programming language that supports concurrency needs a synchronization construct with which to express access control for shared resources. This thesis examines synchronization constructs from the standpoint of language design for reliable software. The criteria a synchronization mechanism must satisfy to support construction of reliable, easily maintainable concurrent software are defined. Some of these criteria, such as expressive power, can be defined only with respect to the set of problems the mechanism is expected to handle. A definition of the range of problems considered to be synchronization problems is therefore needed. Such a definition is provided by describing the possible types of constraints that may be imposed on access to shared resources. We then use this taxonomy of synchronization constraints to develop techniques for evaluating how well synchronization constructs meet the criteria discussed. These techniques are then applied to three existing synchronization mechanisms: monitors, path expressions, and serializers. Evaluations are presented, and the three mechanisms compared. (Author). | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Computer logic |2 dtict | |
| 650 | 7 | |a Computer program reliability |2 dtict | |
| 650 | 7 | |a Formats |2 dtict | |
| 650 | 7 | |a Methodology |2 dtict | |
| 650 | 7 | |a Modular construction |2 dtict | |
| 650 | 7 | |a Programming languages |2 dtict | |
| 650 | 7 | |a Theses |2 dtict | |
| 650 | 7 | |a Time studies |2 dtict | |
| 650 | 0 | 7 | |a Software Engineering |0 (DE-588)4116521-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Synchronisierung |0 (DE-588)4130847-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Modulare Programmierung |0 (DE-588)4120756-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Software Engineering |0 (DE-588)4116521-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Modulare Programmierung |0 (DE-588)4120756-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Synchronisierung |0 (DE-588)4130847-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091509 | ||
Datensatz im Suchindex
| _version_ | 1804135815234715648 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Bloom, Toby |
| author_facet | Bloom, Toby |
| author_role | aut |
| author_sort | Bloom, Toby |
| author_variant | t b tb |
| building | Verbundindex |
| bvnumber | BV021875865 |
| ctrlnum | (OCoLC)227411288 (DE-599)BVBBV021875865 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02730nam a2200493zc 4500</leader><controlfield tag="001">BV021875865</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880222s1979 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227411288</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021875865</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-211</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bloom, Toby</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Synchronization mechanisms for modular programming languages</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">116 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Diss., 1979</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Any programming language that supports concurrency needs a synchronization construct with which to express access control for shared resources. This thesis examines synchronization constructs from the standpoint of language design for reliable software. The criteria a synchronization mechanism must satisfy to support construction of reliable, easily maintainable concurrent software are defined. Some of these criteria, such as expressive power, can be defined only with respect to the set of problems the mechanism is expected to handle. A definition of the range of problems considered to be synchronization problems is therefore needed. Such a definition is provided by describing the possible types of constraints that may be imposed on access to shared resources. We then use this taxonomy of synchronization constraints to develop techniques for evaluating how well synchronization constructs meet the criteria discussed. These techniques are then applied to three existing synchronization mechanisms: monitors, path expressions, and serializers. Evaluations are presented, and the three mechanisms compared. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer logic</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer program reliability</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formats</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Methodology</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Modular construction</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programming languages</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theses</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Time studies</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Software Engineering</subfield><subfield code="0">(DE-588)4116521-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Synchronisierung</subfield><subfield code="0">(DE-588)4130847-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Modulare Programmierung</subfield><subfield code="0">(DE-588)4120756-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Software Engineering</subfield><subfield code="0">(DE-588)4116521-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Modulare Programmierung</subfield><subfield code="0">(DE-588)4120756-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Synchronisierung</subfield><subfield code="0">(DE-588)4130847-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091509</subfield></datafield></record></collection> |
| id | DE-604.BV021875865 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:35Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091509 |
| oclc_num | 227411288 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 116 S. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Bloom, Toby Verfasser aut Synchronization mechanisms for modular programming languages Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1979 116 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Diss., 1979 Any programming language that supports concurrency needs a synchronization construct with which to express access control for shared resources. This thesis examines synchronization constructs from the standpoint of language design for reliable software. The criteria a synchronization mechanism must satisfy to support construction of reliable, easily maintainable concurrent software are defined. Some of these criteria, such as expressive power, can be defined only with respect to the set of problems the mechanism is expected to handle. A definition of the range of problems considered to be synchronization problems is therefore needed. Such a definition is provided by describing the possible types of constraints that may be imposed on access to shared resources. We then use this taxonomy of synchronization constraints to develop techniques for evaluating how well synchronization constructs meet the criteria discussed. These techniques are then applied to three existing synchronization mechanisms: monitors, path expressions, and serializers. Evaluations are presented, and the three mechanisms compared. (Author). Computer Programming and Software scgdst Computer logic dtict Computer program reliability dtict Formats dtict Methodology dtict Modular construction dtict Programming languages dtict Theses dtict Time studies dtict Software Engineering (DE-588)4116521-4 gnd rswk-swf Synchronisierung (DE-588)4130847-5 gnd rswk-swf Modulare Programmierung (DE-588)4120756-7 gnd rswk-swf Software Engineering (DE-588)4116521-4 s DE-604 Modulare Programmierung (DE-588)4120756-7 s Synchronisierung (DE-588)4130847-5 s |
| spellingShingle | Bloom, Toby Synchronization mechanisms for modular programming languages Computer Programming and Software scgdst Computer logic dtict Computer program reliability dtict Formats dtict Methodology dtict Modular construction dtict Programming languages dtict Theses dtict Time studies dtict Software Engineering (DE-588)4116521-4 gnd Synchronisierung (DE-588)4130847-5 gnd Modulare Programmierung (DE-588)4120756-7 gnd |
| subject_GND | (DE-588)4116521-4 (DE-588)4130847-5 (DE-588)4120756-7 |
| title | Synchronization mechanisms for modular programming languages |
| title_auth | Synchronization mechanisms for modular programming languages |
| title_exact_search | Synchronization mechanisms for modular programming languages |
| title_exact_search_txtP | Synchronization mechanisms for modular programming languages |
| title_full | Synchronization mechanisms for modular programming languages |
| title_fullStr | Synchronization mechanisms for modular programming languages |
| title_full_unstemmed | Synchronization mechanisms for modular programming languages |
| title_short | Synchronization mechanisms for modular programming languages |
| title_sort | synchronization mechanisms for modular programming languages |
| topic | Computer Programming and Software scgdst Computer logic dtict Computer program reliability dtict Formats dtict Methodology dtict Modular construction dtict Programming languages dtict Theses dtict Time studies dtict Software Engineering (DE-588)4116521-4 gnd Synchronisierung (DE-588)4130847-5 gnd Modulare Programmierung (DE-588)4120756-7 gnd |
| topic_facet | Computer Programming and Software Computer logic Computer program reliability Formats Methodology Modular construction Programming languages Theses Time studies Software Engineering Synchronisierung Modulare Programmierung |
| work_keys_str_mv | AT bloomtoby synchronizationmechanismsformodularprogramminglanguages |