The event based language and its multiple processor implementations:
This research defines and analyzes a simple language for parallel programming which is designed for multiple processor systems. The language (EBL) is based on events which provide the only control mechanism. Events are explicitly caused by the program, and they activate instances of dynamic program...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1980
|
| Subjects: | |
| Summary: | This research defines and analyzes a simple language for parallel programming which is designed for multiple processor systems. The language (EBL) is based on events which provide the only control mechanism. Events are explicitly caused by the program, and they activate instances of dynamic program units called event handlers. The only operation that can be performed by an instance of an event handler is the causing of new events. The language constructs are primitive; nevertheless, the capability of hierarchical program design is provided via static modules and other modularity sources. The language does not contain conventional constructs such as: variables, assignment statements, goto statements, iteration constructs, procedures, functions and semaphores; however, these can be easily modeled. In addition, events allow activation of parallel processes, synchronization of parallel processes, mutual exclusion, message passing, immutable objects, and the effect of mutable objects. Schemes for implementation of the language on processor networks are investigated. An implementation scheme based on communicating managers which operate without any centralized control is described. A relaxed distributed locking algorithm in which deadlocks are prevented is developed; it does not assume a total order on all objects to be locked. Several optimization problems, e.g., optimal distribution of objects in a network, are investigated. |
| Item Description: | Zugl.: Diss., 1980 |
| Physical Description: | 287 S. |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876411 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880307s1980 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227441159 | ||
| 035 | |a (DE-599)BVBBV021876411 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-226 | ||
| 100 | 1 | |a Reuveni, Asher |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The event based language and its multiple processor implementations |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1980 | |
| 300 | |a 287 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Zugl.: Diss., 1980 | ||
| 520 | 3 | |a This research defines and analyzes a simple language for parallel programming which is designed for multiple processor systems. The language (EBL) is based on events which provide the only control mechanism. Events are explicitly caused by the program, and they activate instances of dynamic program units called event handlers. The only operation that can be performed by an instance of an event handler is the causing of new events. The language constructs are primitive; nevertheless, the capability of hierarchical program design is provided via static modules and other modularity sources. The language does not contain conventional constructs such as: variables, assignment statements, goto statements, iteration constructs, procedures, functions and semaphores; however, these can be easily modeled. In addition, events allow activation of parallel processes, synchronization of parallel processes, mutual exclusion, message passing, immutable objects, and the effect of mutable objects. Schemes for implementation of the language on processor networks are investigated. An implementation scheme based on communicating managers which operate without any centralized control is described. A relaxed distributed locking algorithm in which deadlocks are prevented is developed; it does not assume a total order on all objects to be locked. Several optimization problems, e.g., optimal distribution of objects in a network, are investigated. | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Computer Systems |2 scgdst | |
| 650 | 7 | |a Control |2 dtict | |
| 650 | 7 | |a Data links |2 dtict | |
| 650 | 7 | |a Decentralization |2 dtict | |
| 650 | 7 | |a Fortran |2 dtict | |
| 650 | 7 | |a Message processing |2 dtict | |
| 650 | 7 | |a Models |2 dtict | |
| 650 | 7 | |a Multiprocessors |2 dtict | |
| 650 | 7 | |a Networks |2 dtict | |
| 650 | 7 | |a Parallel processing |2 dtict | |
| 650 | 7 | |a Parallel processors |2 dtict | |
| 650 | 7 | |a Programming languages |2 dtict | |
| 650 | 7 | |a Research management |2 dtict | |
| 650 | 7 | |a Synchronization(electronics) |2 dtict | |
| 650 | 7 | |a Theses |2 dtict | |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015092026 | ||
Record in the Search Index
| _version_ | 1804135815914192896 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Reuveni, Asher |
| author_facet | Reuveni, Asher |
| author_role | aut |
| author_sort | Reuveni, Asher |
| author_variant | a r ar |
| building | Verbundindex |
| bvnumber | BV021876411 |
| ctrlnum | (OCoLC)227441159 (DE-599)BVBBV021876411 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03099nam a2200529zc 4500</leader><controlfield tag="001">BV021876411</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880307s1980 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227441159</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876411</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-226</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Reuveni, Asher</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The event based language and its multiple processor implementations</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">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">287 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., 1980</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This research defines and analyzes a simple language for parallel programming which is designed for multiple processor systems. The language (EBL) is based on events which provide the only control mechanism. Events are explicitly caused by the program, and they activate instances of dynamic program units called event handlers. The only operation that can be performed by an instance of an event handler is the causing of new events. The language constructs are primitive; nevertheless, the capability of hierarchical program design is provided via static modules and other modularity sources. The language does not contain conventional constructs such as: variables, assignment statements, goto statements, iteration constructs, procedures, functions and semaphores; however, these can be easily modeled. In addition, events allow activation of parallel processes, synchronization of parallel processes, mutual exclusion, message passing, immutable objects, and the effect of mutable objects. Schemes for implementation of the language on processor networks are investigated. An implementation scheme based on communicating managers which operate without any centralized control is described. A relaxed distributed locking algorithm in which deadlocks are prevented is developed; it does not assume a total order on all objects to be locked. Several optimization problems, e.g., optimal distribution of objects in a network, are investigated.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</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 Systems</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Control</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data links</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Decentralization</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fortran</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Message processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Models</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Multiprocessors</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Networks</subfield><subfield code="2">dtict</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">Parallel processors</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">Research management</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Synchronization(electronics)</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="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="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015092026</subfield></datafield></record></collection> |
| id | DE-604.BV021876411 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:36Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015092026 |
| oclc_num | 227441159 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 287 S. |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Reuveni, Asher Verfasser aut The event based language and its multiple processor implementations Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1980 287 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Diss., 1980 This research defines and analyzes a simple language for parallel programming which is designed for multiple processor systems. The language (EBL) is based on events which provide the only control mechanism. Events are explicitly caused by the program, and they activate instances of dynamic program units called event handlers. The only operation that can be performed by an instance of an event handler is the causing of new events. The language constructs are primitive; nevertheless, the capability of hierarchical program design is provided via static modules and other modularity sources. The language does not contain conventional constructs such as: variables, assignment statements, goto statements, iteration constructs, procedures, functions and semaphores; however, these can be easily modeled. In addition, events allow activation of parallel processes, synchronization of parallel processes, mutual exclusion, message passing, immutable objects, and the effect of mutable objects. Schemes for implementation of the language on processor networks are investigated. An implementation scheme based on communicating managers which operate without any centralized control is described. A relaxed distributed locking algorithm in which deadlocks are prevented is developed; it does not assume a total order on all objects to be locked. Several optimization problems, e.g., optimal distribution of objects in a network, are investigated. Algorithms dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Control dtict Data links dtict Decentralization dtict Fortran dtict Message processing dtict Models dtict Multiprocessors dtict Networks dtict Parallel processing dtict Parallel processors dtict Programming languages dtict Research management dtict Synchronization(electronics) dtict Theses dtict Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 s DE-604 |
| spellingShingle | Reuveni, Asher The event based language and its multiple processor implementations Algorithms dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Control dtict Data links dtict Decentralization dtict Fortran dtict Message processing dtict Models dtict Multiprocessors dtict Networks dtict Parallel processing dtict Parallel processors dtict Programming languages dtict Research management dtict Synchronization(electronics) dtict Theses dtict Parallelverarbeitung (DE-588)4075860-6 gnd |
| subject_GND | (DE-588)4075860-6 |
| title | The event based language and its multiple processor implementations |
| title_auth | The event based language and its multiple processor implementations |
| title_exact_search | The event based language and its multiple processor implementations |
| title_exact_search_txtP | The event based language and its multiple processor implementations |
| title_full | The event based language and its multiple processor implementations |
| title_fullStr | The event based language and its multiple processor implementations |
| title_full_unstemmed | The event based language and its multiple processor implementations |
| title_short | The event based language and its multiple processor implementations |
| title_sort | the event based language and its multiple processor implementations |
| topic | Algorithms dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Control dtict Data links dtict Decentralization dtict Fortran dtict Message processing dtict Models dtict Multiprocessors dtict Networks dtict Parallel processing dtict Parallel processors dtict Programming languages dtict Research management dtict Synchronization(electronics) dtict Theses dtict Parallelverarbeitung (DE-588)4075860-6 gnd |
| topic_facet | Algorithms Computer Hardware Computer Programming and Software Computer Systems Control Data links Decentralization Fortran Message processing Models Multiprocessors Networks Parallel processing Parallel processors Programming languages Research management Synchronization(electronics) Theses Parallelverarbeitung |
| work_keys_str_mv | AT reuveniasher theeventbasedlanguageanditsmultipleprocessorimplementations |