Actors and continuous functionals:
This paper presents precise versions of some 'laws' that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating plausible restrictions on the histories of computations that are physically realizable. The laws are very general in that...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1977
|
| Schlagworte: | |
| Zusammenfassung: | This paper presents precise versions of some 'laws' that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating plausible restrictions on the histories of computations that are physically realizable. The laws are very general in that they are obeyed by parallel processes executing on a time varying number of distributed physical processors. For example, some of the processors might be in orbiting satellites. The laws are justified by appeal to physical intuition and are to be regarded as falsifiable assertions about the kinds of computations that occur in nature rather than as proved theorems in mathematics. The laws are intended to be used to analyze the mechanisms by which multiple processes can communicate to work effectively together to solve difficult problems. The laws presented in this paper are intended to be applied to the design and analysis of systems consisting of large numbers of physical processors. The development of such systems is becoming economical because of rapid progress in the development of large scale integrated circuits. We generalize the usual notion of the history of a computation as a sequence of events to the notion of a partial order of events. Partial orders of events seem better suited to expressing the causality involved in parallel computations than totally ordered sequences of events obtained by 'considering all shuffles' of the elementary steps of the various parallel processes. The utility of partial orders is demonstrated by using them to express our laws for distributed computation. These laws in turn can be used to prove the usual induction rules for proving properties of procedures. |
| Beschreibung: | 29 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021879860 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880811s1977 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227489554 | ||
| 035 | |a (DE-599)BVBBV021879860 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-194 | ||
| 100 | 1 | |a Hewitt, Carl |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Actors and continuous functionals |c Carl Hewitt and Henry Baker |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1977 | |
| 300 | |a 29 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a This paper presents precise versions of some 'laws' that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating plausible restrictions on the histories of computations that are physically realizable. The laws are very general in that they are obeyed by parallel processes executing on a time varying number of distributed physical processors. For example, some of the processors might be in orbiting satellites. The laws are justified by appeal to physical intuition and are to be regarded as falsifiable assertions about the kinds of computations that occur in nature rather than as proved theorems in mathematics. The laws are intended to be used to analyze the mechanisms by which multiple processes can communicate to work effectively together to solve difficult problems. The laws presented in this paper are intended to be applied to the design and analysis of systems consisting of large numbers of physical processors. The development of such systems is becoming economical because of rapid progress in the development of large scale integrated circuits. We generalize the usual notion of the history of a computation as a sequence of events to the notion of a partial order of events. Partial orders of events seem better suited to expressing the causality involved in parallel computations than totally ordered sequences of events obtained by 'considering all shuffles' of the elementary steps of the various parallel processes. The utility of partial orders is demonstrated by using them to express our laws for distributed computation. These laws in turn can be used to prove the usual induction rules for proving properties of procedures. | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Computer communications |2 dtict | |
| 650 | 7 | |a Electrical and Electronic Equipment |2 scgdst | |
| 650 | 7 | |a Graphs |2 dtict | |
| 650 | 7 | |a Integrated circuits |2 dtict | |
| 650 | 7 | |a Logic circuits |2 dtict | |
| 650 | 7 | |a Non-radio Communications |2 scgdst | |
| 650 | 7 | |a Parallel processing |2 dtict | |
| 650 | 7 | |a Programming languages |2 dtict | |
| 650 | 7 | |a Sequences |2 dtict | |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prozesssteuerung |0 (DE-588)4047594-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlange |0 (DE-588)4189150-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Prozesssteuerung |0 (DE-588)4047594-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Warteschlange |0 (DE-588)4189150-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Baker, Henry G. |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015095318 | ||
Datensatz im Suchindex
| _version_ | 1804135820070748160 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Hewitt, Carl Baker, Henry G. |
| author_facet | Hewitt, Carl Baker, Henry G. |
| author_role | aut aut |
| author_sort | Hewitt, Carl |
| author_variant | c h ch h g b hg hgb |
| building | Verbundindex |
| bvnumber | BV021879860 |
| ctrlnum | (OCoLC)227489554 (DE-599)BVBBV021879860 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03385nam a2200505zc 4500</leader><controlfield tag="001">BV021879860</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880811s1977 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227489554</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021879860</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-194</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hewitt, Carl</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Actors and continuous functionals</subfield><subfield code="c">Carl Hewitt and Henry Baker</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">1977</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 Bl.</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="520" ind1="3" ind2=" "><subfield code="a">This paper presents precise versions of some 'laws' that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating plausible restrictions on the histories of computations that are physically realizable. The laws are very general in that they are obeyed by parallel processes executing on a time varying number of distributed physical processors. For example, some of the processors might be in orbiting satellites. The laws are justified by appeal to physical intuition and are to be regarded as falsifiable assertions about the kinds of computations that occur in nature rather than as proved theorems in mathematics. The laws are intended to be used to analyze the mechanisms by which multiple processes can communicate to work effectively together to solve difficult problems. The laws presented in this paper are intended to be applied to the design and analysis of systems consisting of large numbers of physical processors. The development of such systems is becoming economical because of rapid progress in the development of large scale integrated circuits. We generalize the usual notion of the history of a computation as a sequence of events to the notion of a partial order of events. Partial orders of events seem better suited to expressing the causality involved in parallel computations than totally ordered sequences of events obtained by 'considering all shuffles' of the elementary steps of the various parallel processes. The utility of partial orders is demonstrated by using them to express our laws for distributed computation. These laws in turn can be used to prove the usual induction rules for proving properties of procedures.</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 communications</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electrical and Electronic Equipment</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Integrated circuits</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logic circuits</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Non-radio Communications</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallel processing</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">Sequences</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prozesssteuerung</subfield><subfield code="0">(DE-588)4047594-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlange</subfield><subfield code="0">(DE-588)4189150-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Prozesssteuerung</subfield><subfield code="0">(DE-588)4047594-3</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">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</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">Warteschlange</subfield><subfield code="0">(DE-588)4189150-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Baker, Henry G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015095318</subfield></datafield></record></collection> |
| id | DE-604.BV021879860 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:43Z |
| indexdate | 2024-07-09T20:46:34Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015095318 |
| oclc_num | 227489554 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 29 Bl. |
| publishDate | 1977 |
| publishDateSearch | 1977 |
| publishDateSort | 1977 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Hewitt, Carl Verfasser aut Actors and continuous functionals Carl Hewitt and Henry Baker Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1977 29 Bl. txt rdacontent n rdamedia nc rdacarrier This paper presents precise versions of some 'laws' that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating plausible restrictions on the histories of computations that are physically realizable. The laws are very general in that they are obeyed by parallel processes executing on a time varying number of distributed physical processors. For example, some of the processors might be in orbiting satellites. The laws are justified by appeal to physical intuition and are to be regarded as falsifiable assertions about the kinds of computations that occur in nature rather than as proved theorems in mathematics. The laws are intended to be used to analyze the mechanisms by which multiple processes can communicate to work effectively together to solve difficult problems. The laws presented in this paper are intended to be applied to the design and analysis of systems consisting of large numbers of physical processors. The development of such systems is becoming economical because of rapid progress in the development of large scale integrated circuits. We generalize the usual notion of the history of a computation as a sequence of events to the notion of a partial order of events. Partial orders of events seem better suited to expressing the causality involved in parallel computations than totally ordered sequences of events obtained by 'considering all shuffles' of the elementary steps of the various parallel processes. The utility of partial orders is demonstrated by using them to express our laws for distributed computation. These laws in turn can be used to prove the usual induction rules for proving properties of procedures. Computer Programming and Software scgdst Computer communications dtict Electrical and Electronic Equipment scgdst Graphs dtict Integrated circuits dtict Logic circuits dtict Non-radio Communications scgdst Parallel processing dtict Programming languages dtict Sequences dtict Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Prozesssteuerung (DE-588)4047594-3 gnd rswk-swf Warteschlange (DE-588)4189150-8 gnd rswk-swf Prozesssteuerung (DE-588)4047594-3 s DE-604 Parallelverarbeitung (DE-588)4075860-6 s Warteschlange (DE-588)4189150-8 s Baker, Henry G. Verfasser aut |
| spellingShingle | Hewitt, Carl Baker, Henry G. Actors and continuous functionals Computer Programming and Software scgdst Computer communications dtict Electrical and Electronic Equipment scgdst Graphs dtict Integrated circuits dtict Logic circuits dtict Non-radio Communications scgdst Parallel processing dtict Programming languages dtict Sequences dtict Parallelverarbeitung (DE-588)4075860-6 gnd Prozesssteuerung (DE-588)4047594-3 gnd Warteschlange (DE-588)4189150-8 gnd |
| subject_GND | (DE-588)4075860-6 (DE-588)4047594-3 (DE-588)4189150-8 |
| title | Actors and continuous functionals |
| title_auth | Actors and continuous functionals |
| title_exact_search | Actors and continuous functionals |
| title_exact_search_txtP | Actors and continuous functionals |
| title_full | Actors and continuous functionals Carl Hewitt and Henry Baker |
| title_fullStr | Actors and continuous functionals Carl Hewitt and Henry Baker |
| title_full_unstemmed | Actors and continuous functionals Carl Hewitt and Henry Baker |
| title_short | Actors and continuous functionals |
| title_sort | actors and continuous functionals |
| topic | Computer Programming and Software scgdst Computer communications dtict Electrical and Electronic Equipment scgdst Graphs dtict Integrated circuits dtict Logic circuits dtict Non-radio Communications scgdst Parallel processing dtict Programming languages dtict Sequences dtict Parallelverarbeitung (DE-588)4075860-6 gnd Prozesssteuerung (DE-588)4047594-3 gnd Warteschlange (DE-588)4189150-8 gnd |
| topic_facet | Computer Programming and Software Computer communications Electrical and Electronic Equipment Graphs Integrated circuits Logic circuits Non-radio Communications Parallel processing Programming languages Sequences Parallelverarbeitung Prozesssteuerung Warteschlange |
| work_keys_str_mv | AT hewittcarl actorsandcontinuousfunctionals AT bakerhenryg actorsandcontinuousfunctionals |