Analysis and synthesis of computer systems /:
Analysis and Synthesis of Computer Systems presents a broad overview of methods that are used to evaluate the performance of computer systems and networks, manufacturing systems, and interconnected services systems. Aside from a highly readable style that rigorously addresses all subjects, this seco...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
London, UK :
Imperial College Press,
©2010.
|
| Ausgabe: | 2nd ed. |
| Schriftenreihe: | Advances in computer science and engineering. Texts ;
v. 4. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Analysis and Synthesis of Computer Systems presents a broad overview of methods that are used to evaluate the performance of computer systems and networks, manufacturing systems, and interconnected services systems. Aside from a highly readable style that rigorously addresses all subjects, this second edition includes new chapters on numerical methods for queueing models and on G-networks, the latter being a new area of queuing theory that one of the authors has pioneered. This book will have a broad appeal to students, practitioners and researchers in several different areas, including practicing computer engineers as well as computer science and engineering students. |
| Beschreibung: | 1 online resource (x, 313 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781848163966 1848163967 1282759922 9781282759923 9786612759925 6612759925 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn667822732 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr mn||||||||| | ||
| 008 | 100414s2010 enka fob 001 0 eng d | ||
| 010 | |z 2010485690 | ||
| 040 | |a CDX |b eng |e pn |c CDX |d OCLCQ |d N$T |d OSU |d YDXCP |d E7B |d OCLCQ |d EBLCP |d STF |d UKMGB |d OCLCQ |d UIU |d OCLCA |d OCLCQ |d DEBSZ |d OCLCQ |d OCLCA |d OCLCQ |d OCLCF |d OCLCQ |d AZK |d AGLDB |d MOR |d PIFAG |d ZCU |d OTZ |d MERUC |d OCLCQ |d U3W |d WRM |d JBG |d VTS |d ICG |d INT |d REC |d OCLCQ |d DKC |d LEAUB |d OCLCQ |d UKAHL |d UWK |d LIP |d OCLCQ |d UKCRE |d OCLCQ |d OCLCO |d QGK |d TUHNV |d CNNOR |d VHC |d OCLCO |d OCL |d OCLCQ |d OCLCO |d OCLCQ |d OCLCL |d SXB |d OCLCQ |d OCLCO | ||
| 016 | 7 | |a 015535887 |2 Uk | |
| 019 | |a 670429007 |a 754711860 |a 961614540 |a 962617213 |a 988498912 |a 991963883 |a 994983143 |a 1037718486 |a 1038639565 |a 1062951515 |a 1086489746 |a 1110357441 |a 1120876622 |a 1153477616 |a 1162290005 |a 1181926684 |a 1189806019 |a 1241782083 |a 1243595524 |a 1290060211 |a 1298900718 |a 1300627088 |a 1303303653 |a 1303458034 | ||
| 020 | |a 9781848163966 |q (electronic bk.) | ||
| 020 | |a 1848163967 |q (electronic bk.) | ||
| 020 | |a 1282759922 | ||
| 020 | |a 9781282759923 | ||
| 020 | |a 9786612759925 | ||
| 020 | |a 6612759925 | ||
| 020 | |z 9781848163959 | ||
| 020 | |z 1848163959 | ||
| 024 | 8 | |a 9786612759925 | |
| 035 | |a (OCoLC)667822732 |z (OCoLC)670429007 |z (OCoLC)754711860 |z (OCoLC)961614540 |z (OCoLC)962617213 |z (OCoLC)988498912 |z (OCoLC)991963883 |z (OCoLC)994983143 |z (OCoLC)1037718486 |z (OCoLC)1038639565 |z (OCoLC)1062951515 |z (OCoLC)1086489746 |z (OCoLC)1110357441 |z (OCoLC)1120876622 |z (OCoLC)1153477616 |z (OCoLC)1162290005 |z (OCoLC)1181926684 |z (OCoLC)1189806019 |z (OCoLC)1241782083 |z (OCoLC)1243595524 |z (OCoLC)1290060211 |z (OCoLC)1298900718 |z (OCoLC)1300627088 |z (OCoLC)1303303653 |z (OCoLC)1303458034 | ||
| 037 | |a 275992 |b MIL | ||
| 050 | 4 | |a QA76.9.E94 |b G44 2010eb | |
| 072 | 7 | |a COM |x 011000 |2 bisacsh | |
| 082 | 7 | |a 004.2/4 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Gelenbe, Erol, |d 1945- |1 https://id.oclc.org/worldcat/entity/E39PBJfrPWcM6cBfFym9HwVjYP |0 http://id.loc.gov/authorities/names/n50018271 | |
| 245 | 1 | 0 | |a Analysis and synthesis of computer systems / |c Erol Gelenbe, Isi Mitrani. |
| 250 | |a 2nd ed. | ||
| 260 | |a London, UK : |b Imperial College Press, |c ©2010. | ||
| 300 | |a 1 online resource (x, 313 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file |2 rda | ||
| 380 | |a Bibliography | ||
| 490 | 1 | |a Advances in computer science and engineering. Texts ; |v v. 4 | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a 1. Basic tools of probabilistic modelling. 1.1. General background. 1.2. Markov processes. The exponential distribution. 1.3. Poisson arrival streams. Important properties. 1.4. Steady-state. Balance diagrams. The "Birth and Death" process. 1.5. The M/M/1, M/M/c and related queueing systems. 1.6. Little's result. Applications. The M/G/1 system. 1. 7. Operational identities. 1.8. Priority queueing -- 2. The queue with server of walking type and its applications to computer system modelling. 2.1. Introduction. 2.2. The queue with server of walking type with Poisson arrivals, and the M/G/1 queue. 2.3. Evaluation of secondary memory device performance. 2.4. Analysis of multiplexed data communication systems -- 3. Queueing network models. 3.1. General remarks. 3.2. Feedforward networks and product-form solution. 3.3. Jackson networks. 3.4. Other scheduling strategies and service time distributions. 3.5. The BCMP theorem. 3.6. The computation of performance measures -- 4. Queueing networks with multiple classes of positive and negative customers and product form solution. 4.1. Introduction. 4.2. The model. 4.3. Main results. 4.4. Existence of the solution to the traffic equations. 4.5. Conclusion -- 5. Markov-modulated queues. 5.1. A multiserver queue with breakdowns and repairs. 5.2. Manufacturing blocking. 5.3. Phase-type distributions. 5.4. Checkpointing and recovery in the presence of faults. 5.5. Spectral expansion solution. 5.6. Balance equations. 5.7. Batch arrivals and/or departures. 5.8. A simple approximation. 5.9. The heavy traffic limit. 5.10. Applications and comparisons. 5.11. Remarks -- 6. Diffusion approximation methods for general queueing networks. 6.1. Introduction. 6.2. Diffusion approximation for a single queue. 6.3. Diffusion approximations for general networks of queues with one customer class. 6.4. Approximate behaviour of a single queue in a network with multiple customer classes. 6.5. Conclusion -- 7. Approximate decomposition and iterative techniques for closed model solution. 7.1. Introduction. 7.2. Subsystem isolation. 7.3. Decomposition as an approximate solution method. 7.4. An electric circuit analogy for queueing network solution -- 8. Synthesis problems in single-resource systems : characterisation and control of achievable performance. 8.1. Problem formulation. 8.2. Conservation laws and inequalities. 8.3. Characterisation theorems. 8.4. The realisation of pre-specified performance vectors. Complete families of scheduling strategies. 8.5. Optimal scheduling strategies -- 9. Control of performance in multiple-resource systems. 9.1. Some problems arising in multiprogrammed computer systems. 9.2. The modelling of system resources and program behaviour. 9.3. Control of the degree of multiprogramming. 9.4. The page fault rate control policy (RCP). 9.5. Control of performance by selective memory allocation. 9.6. Towards a characterisation of achievable performance in terminal systems -- 10. A queue with server of walking type. 10.1. Introduction. 10.2. Properties of the waiting time process. 10.3. Application to a paging drum model. | |
| 520 | |a Analysis and Synthesis of Computer Systems presents a broad overview of methods that are used to evaluate the performance of computer systems and networks, manufacturing systems, and interconnected services systems. Aside from a highly readable style that rigorously addresses all subjects, this second edition includes new chapters on numerical methods for queueing models and on G-networks, the latter being a new area of queuing theory that one of the authors has pioneered. This book will have a broad appeal to students, practitioners and researchers in several different areas, including practicing computer engineers as well as computer science and engineering students. | ||
| 588 | 0 | |a Print version record. | |
| 546 | |a English. | ||
| 650 | 0 | |a Computer systems |x Evaluation. | |
| 650 | 0 | |a Queuing theory. |0 http://id.loc.gov/authorities/subjects/sh85109832 | |
| 650 | 0 | |a Electronic digital computers |x Evaluation. |0 http://id.loc.gov/authorities/subjects/sh85042316 | |
| 650 | 6 | |a Ordinateurs |x Évaluation. | |
| 650 | 6 | |a Théorie des files d'attente. | |
| 650 | 6 | |a Systèmes informatiques |x Évaluation. | |
| 650 | 7 | |a COMPUTERS |x Systems Architecture |x General. |2 bisacsh | |
| 650 | 7 | |a Electronic digital computers |x Evaluation |2 fast | |
| 650 | 7 | |a Computer systems |x Evaluation |2 fast | |
| 650 | 7 | |a Queuing theory |2 fast | |
| 700 | 1 | |a Mitrani, I. | |
| 758 | |i has work: |a Analysis and synthesis of computer systems (Text) |1 https://id.oclc.org/worldcat/entity/E39PCYBGXwWYxFVV7v9dgyvXbb |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Gelenbe, E., 1945- |t Analysis and synthesis of computer systems. |b 2nd ed. |d London : Academic Press ; Hackensack, NJ : Distributed by World Scientific Pub. Co., ©2010 |z 9781848163959 |w (DLC) 2010485690 |w (OCoLC)619938522 |
| 830 | 0 | |a Advances in computer science and engineering. |p Texts ; |v v. 4. |0 http://id.loc.gov/authorities/names/no2007041420 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=340776 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH24682626 | ||
| 938 | |a Coutts Information Services |b COUT |n 15220659 |c 88.00 USD | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL731185 | ||
| 938 | |a ebrary |b EBRY |n ebr10422213 | ||
| 938 | |a EBSCOhost |b EBSC |n 340776 | ||
| 938 | |a YBP Library Services |b YANK |n 3511261 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn667822732 |
|---|---|
| _version_ | 1816881741895303168 |
| adam_text | |
| any_adam_object | |
| author | Gelenbe, Erol, 1945- |
| author2 | Mitrani, I. |
| author2_role | |
| author2_variant | i m im |
| author_GND | http://id.loc.gov/authorities/names/n50018271 |
| author_facet | Gelenbe, Erol, 1945- Mitrani, I. |
| author_role | |
| author_sort | Gelenbe, Erol, 1945- |
| author_variant | e g eg |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.E94 G44 2010eb |
| callnumber-search | QA76.9.E94 G44 2010eb |
| callnumber-sort | QA 276.9 E94 G44 42010EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 1. Basic tools of probabilistic modelling. 1.1. General background. 1.2. Markov processes. The exponential distribution. 1.3. Poisson arrival streams. Important properties. 1.4. Steady-state. Balance diagrams. The "Birth and Death" process. 1.5. The M/M/1, M/M/c and related queueing systems. 1.6. Little's result. Applications. The M/G/1 system. 1. 7. Operational identities. 1.8. Priority queueing -- 2. The queue with server of walking type and its applications to computer system modelling. 2.1. Introduction. 2.2. The queue with server of walking type with Poisson arrivals, and the M/G/1 queue. 2.3. Evaluation of secondary memory device performance. 2.4. Analysis of multiplexed data communication systems -- 3. Queueing network models. 3.1. General remarks. 3.2. Feedforward networks and product-form solution. 3.3. Jackson networks. 3.4. Other scheduling strategies and service time distributions. 3.5. The BCMP theorem. 3.6. The computation of performance measures -- 4. Queueing networks with multiple classes of positive and negative customers and product form solution. 4.1. Introduction. 4.2. The model. 4.3. Main results. 4.4. Existence of the solution to the traffic equations. 4.5. Conclusion -- 5. Markov-modulated queues. 5.1. A multiserver queue with breakdowns and repairs. 5.2. Manufacturing blocking. 5.3. Phase-type distributions. 5.4. Checkpointing and recovery in the presence of faults. 5.5. Spectral expansion solution. 5.6. Balance equations. 5.7. Batch arrivals and/or departures. 5.8. A simple approximation. 5.9. The heavy traffic limit. 5.10. Applications and comparisons. 5.11. Remarks -- 6. Diffusion approximation methods for general queueing networks. 6.1. Introduction. 6.2. Diffusion approximation for a single queue. 6.3. Diffusion approximations for general networks of queues with one customer class. 6.4. Approximate behaviour of a single queue in a network with multiple customer classes. 6.5. Conclusion -- 7. Approximate decomposition and iterative techniques for closed model solution. 7.1. Introduction. 7.2. Subsystem isolation. 7.3. Decomposition as an approximate solution method. 7.4. An electric circuit analogy for queueing network solution -- 8. Synthesis problems in single-resource systems : characterisation and control of achievable performance. 8.1. Problem formulation. 8.2. Conservation laws and inequalities. 8.3. Characterisation theorems. 8.4. The realisation of pre-specified performance vectors. Complete families of scheduling strategies. 8.5. Optimal scheduling strategies -- 9. Control of performance in multiple-resource systems. 9.1. Some problems arising in multiprogrammed computer systems. 9.2. The modelling of system resources and program behaviour. 9.3. Control of the degree of multiprogramming. 9.4. The page fault rate control policy (RCP). 9.5. Control of performance by selective memory allocation. 9.6. Towards a characterisation of achievable performance in terminal systems -- 10. A queue with server of walking type. 10.1. Introduction. 10.2. Properties of the waiting time process. 10.3. Application to a paging drum model. |
| ctrlnum | (OCoLC)667822732 |
| dewey-full | 004.2/4 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.2/4 |
| dewey-search | 004.2/4 |
| dewey-sort | 14.2 14 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 2nd ed. |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>08135cam a2200781 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn667822732</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mn|||||||||</controlfield><controlfield tag="008">100414s2010 enka fob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2010485690</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">CDX</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">CDX</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">OSU</subfield><subfield code="d">YDXCP</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">EBLCP</subfield><subfield code="d">STF</subfield><subfield code="d">UKMGB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UIU</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">AGLDB</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">ZCU</subfield><subfield code="d">OTZ</subfield><subfield code="d">MERUC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">WRM</subfield><subfield code="d">JBG</subfield><subfield code="d">VTS</subfield><subfield code="d">ICG</subfield><subfield code="d">INT</subfield><subfield code="d">REC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DKC</subfield><subfield code="d">LEAUB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKAHL</subfield><subfield code="d">UWK</subfield><subfield code="d">LIP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKCRE</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">QGK</subfield><subfield code="d">TUHNV</subfield><subfield code="d">CNNOR</subfield><subfield code="d">VHC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SXB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">015535887</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">670429007</subfield><subfield code="a">754711860</subfield><subfield code="a">961614540</subfield><subfield code="a">962617213</subfield><subfield code="a">988498912</subfield><subfield code="a">991963883</subfield><subfield code="a">994983143</subfield><subfield code="a">1037718486</subfield><subfield code="a">1038639565</subfield><subfield code="a">1062951515</subfield><subfield code="a">1086489746</subfield><subfield code="a">1110357441</subfield><subfield code="a">1120876622</subfield><subfield code="a">1153477616</subfield><subfield code="a">1162290005</subfield><subfield code="a">1181926684</subfield><subfield code="a">1189806019</subfield><subfield code="a">1241782083</subfield><subfield code="a">1243595524</subfield><subfield code="a">1290060211</subfield><subfield code="a">1298900718</subfield><subfield code="a">1300627088</subfield><subfield code="a">1303303653</subfield><subfield code="a">1303458034</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848163966</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848163967</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1282759922</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781282759923</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786612759925</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6612759925</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781848163959</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1848163959</subfield></datafield><datafield tag="024" ind1="8" ind2=" "><subfield code="a">9786612759925</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)667822732</subfield><subfield code="z">(OCoLC)670429007</subfield><subfield code="z">(OCoLC)754711860</subfield><subfield code="z">(OCoLC)961614540</subfield><subfield code="z">(OCoLC)962617213</subfield><subfield code="z">(OCoLC)988498912</subfield><subfield code="z">(OCoLC)991963883</subfield><subfield code="z">(OCoLC)994983143</subfield><subfield code="z">(OCoLC)1037718486</subfield><subfield code="z">(OCoLC)1038639565</subfield><subfield code="z">(OCoLC)1062951515</subfield><subfield code="z">(OCoLC)1086489746</subfield><subfield code="z">(OCoLC)1110357441</subfield><subfield code="z">(OCoLC)1120876622</subfield><subfield code="z">(OCoLC)1153477616</subfield><subfield code="z">(OCoLC)1162290005</subfield><subfield code="z">(OCoLC)1181926684</subfield><subfield code="z">(OCoLC)1189806019</subfield><subfield code="z">(OCoLC)1241782083</subfield><subfield code="z">(OCoLC)1243595524</subfield><subfield code="z">(OCoLC)1290060211</subfield><subfield code="z">(OCoLC)1298900718</subfield><subfield code="z">(OCoLC)1300627088</subfield><subfield code="z">(OCoLC)1303303653</subfield><subfield code="z">(OCoLC)1303458034</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">275992</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.E94</subfield><subfield code="b">G44 2010eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">011000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004.2/4</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gelenbe, Erol,</subfield><subfield code="d">1945-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJfrPWcM6cBfFym9HwVjYP</subfield><subfield code="0">http://id.loc.gov/authorities/names/n50018271</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analysis and synthesis of computer systems /</subfield><subfield code="c">Erol Gelenbe, Isi Mitrani.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2nd ed.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">London, UK :</subfield><subfield code="b">Imperial College Press,</subfield><subfield code="c">©2010.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 313 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield><subfield code="2">rda</subfield></datafield><datafield tag="380" ind1=" " ind2=" "><subfield code="a">Bibliography</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Advances in computer science and engineering. Texts ;</subfield><subfield code="v">v. 4</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">1. Basic tools of probabilistic modelling. 1.1. General background. 1.2. Markov processes. The exponential distribution. 1.3. Poisson arrival streams. Important properties. 1.4. Steady-state. Balance diagrams. The "Birth and Death" process. 1.5. The M/M/1, M/M/c and related queueing systems. 1.6. Little's result. Applications. The M/G/1 system. 1. 7. Operational identities. 1.8. Priority queueing -- 2. The queue with server of walking type and its applications to computer system modelling. 2.1. Introduction. 2.2. The queue with server of walking type with Poisson arrivals, and the M/G/1 queue. 2.3. Evaluation of secondary memory device performance. 2.4. Analysis of multiplexed data communication systems -- 3. Queueing network models. 3.1. General remarks. 3.2. Feedforward networks and product-form solution. 3.3. Jackson networks. 3.4. Other scheduling strategies and service time distributions. 3.5. The BCMP theorem. 3.6. The computation of performance measures -- 4. Queueing networks with multiple classes of positive and negative customers and product form solution. 4.1. Introduction. 4.2. The model. 4.3. Main results. 4.4. Existence of the solution to the traffic equations. 4.5. Conclusion -- 5. Markov-modulated queues. 5.1. A multiserver queue with breakdowns and repairs. 5.2. Manufacturing blocking. 5.3. Phase-type distributions. 5.4. Checkpointing and recovery in the presence of faults. 5.5. Spectral expansion solution. 5.6. Balance equations. 5.7. Batch arrivals and/or departures. 5.8. A simple approximation. 5.9. The heavy traffic limit. 5.10. Applications and comparisons. 5.11. Remarks -- 6. Diffusion approximation methods for general queueing networks. 6.1. Introduction. 6.2. Diffusion approximation for a single queue. 6.3. Diffusion approximations for general networks of queues with one customer class. 6.4. Approximate behaviour of a single queue in a network with multiple customer classes. 6.5. Conclusion -- 7. Approximate decomposition and iterative techniques for closed model solution. 7.1. Introduction. 7.2. Subsystem isolation. 7.3. Decomposition as an approximate solution method. 7.4. An electric circuit analogy for queueing network solution -- 8. Synthesis problems in single-resource systems : characterisation and control of achievable performance. 8.1. Problem formulation. 8.2. Conservation laws and inequalities. 8.3. Characterisation theorems. 8.4. The realisation of pre-specified performance vectors. Complete families of scheduling strategies. 8.5. Optimal scheduling strategies -- 9. Control of performance in multiple-resource systems. 9.1. Some problems arising in multiprogrammed computer systems. 9.2. The modelling of system resources and program behaviour. 9.3. Control of the degree of multiprogramming. 9.4. The page fault rate control policy (RCP). 9.5. Control of performance by selective memory allocation. 9.6. Towards a characterisation of achievable performance in terminal systems -- 10. A queue with server of walking type. 10.1. Introduction. 10.2. Properties of the waiting time process. 10.3. Application to a paging drum model.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Analysis and Synthesis of Computer Systems presents a broad overview of methods that are used to evaluate the performance of computer systems and networks, manufacturing systems, and interconnected services systems. Aside from a highly readable style that rigorously addresses all subjects, this second edition includes new chapters on numerical methods for queueing models and on G-networks, the latter being a new area of queuing theory that one of the authors has pioneered. This book will have a broad appeal to students, practitioners and researchers in several different areas, including practicing computer engineers as well as computer science and engineering students.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer systems</subfield><subfield code="x">Evaluation.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Queuing theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85109832</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Electronic digital computers</subfield><subfield code="x">Evaluation.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85042316</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Ordinateurs</subfield><subfield code="x">Évaluation.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des files d'attente.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Systèmes informatiques</subfield><subfield code="x">Évaluation.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Systems Architecture</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electronic digital computers</subfield><subfield code="x">Evaluation</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer systems</subfield><subfield code="x">Evaluation</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Queuing theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mitrani, I.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Analysis and synthesis of computer systems (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCYBGXwWYxFVV7v9dgyvXbb</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Gelenbe, E., 1945-</subfield><subfield code="t">Analysis and synthesis of computer systems.</subfield><subfield code="b">2nd ed.</subfield><subfield code="d">London : Academic Press ; Hackensack, NJ : Distributed by World Scientific Pub. Co., ©2010</subfield><subfield code="z">9781848163959</subfield><subfield code="w">(DLC) 2010485690</subfield><subfield code="w">(OCoLC)619938522</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Advances in computer science and engineering.</subfield><subfield code="p">Texts ;</subfield><subfield code="v">v. 4.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2007041420</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=340776</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH24682626</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">15220659</subfield><subfield code="c">88.00 USD</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL731185</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10422213</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">340776</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3511261</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn667822732 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:33Z |
| institution | BVB |
| isbn | 9781848163966 1848163967 1282759922 9781282759923 9786612759925 6612759925 |
| language | English |
| oclc_num | 667822732 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (x, 313 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Imperial College Press, |
| record_format | marc |
| series | Advances in computer science and engineering. Texts ; |
| series2 | Advances in computer science and engineering. Texts ; |
| spelling | Gelenbe, Erol, 1945- https://id.oclc.org/worldcat/entity/E39PBJfrPWcM6cBfFym9HwVjYP http://id.loc.gov/authorities/names/n50018271 Analysis and synthesis of computer systems / Erol Gelenbe, Isi Mitrani. 2nd ed. London, UK : Imperial College Press, ©2010. 1 online resource (x, 313 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier data file rda Bibliography Advances in computer science and engineering. Texts ; v. 4 Includes bibliographical references and index. 1. Basic tools of probabilistic modelling. 1.1. General background. 1.2. Markov processes. The exponential distribution. 1.3. Poisson arrival streams. Important properties. 1.4. Steady-state. Balance diagrams. The "Birth and Death" process. 1.5. The M/M/1, M/M/c and related queueing systems. 1.6. Little's result. Applications. The M/G/1 system. 1. 7. Operational identities. 1.8. Priority queueing -- 2. The queue with server of walking type and its applications to computer system modelling. 2.1. Introduction. 2.2. The queue with server of walking type with Poisson arrivals, and the M/G/1 queue. 2.3. Evaluation of secondary memory device performance. 2.4. Analysis of multiplexed data communication systems -- 3. Queueing network models. 3.1. General remarks. 3.2. Feedforward networks and product-form solution. 3.3. Jackson networks. 3.4. Other scheduling strategies and service time distributions. 3.5. The BCMP theorem. 3.6. The computation of performance measures -- 4. Queueing networks with multiple classes of positive and negative customers and product form solution. 4.1. Introduction. 4.2. The model. 4.3. Main results. 4.4. Existence of the solution to the traffic equations. 4.5. Conclusion -- 5. Markov-modulated queues. 5.1. A multiserver queue with breakdowns and repairs. 5.2. Manufacturing blocking. 5.3. Phase-type distributions. 5.4. Checkpointing and recovery in the presence of faults. 5.5. Spectral expansion solution. 5.6. Balance equations. 5.7. Batch arrivals and/or departures. 5.8. A simple approximation. 5.9. The heavy traffic limit. 5.10. Applications and comparisons. 5.11. Remarks -- 6. Diffusion approximation methods for general queueing networks. 6.1. Introduction. 6.2. Diffusion approximation for a single queue. 6.3. Diffusion approximations for general networks of queues with one customer class. 6.4. Approximate behaviour of a single queue in a network with multiple customer classes. 6.5. Conclusion -- 7. Approximate decomposition and iterative techniques for closed model solution. 7.1. Introduction. 7.2. Subsystem isolation. 7.3. Decomposition as an approximate solution method. 7.4. An electric circuit analogy for queueing network solution -- 8. Synthesis problems in single-resource systems : characterisation and control of achievable performance. 8.1. Problem formulation. 8.2. Conservation laws and inequalities. 8.3. Characterisation theorems. 8.4. The realisation of pre-specified performance vectors. Complete families of scheduling strategies. 8.5. Optimal scheduling strategies -- 9. Control of performance in multiple-resource systems. 9.1. Some problems arising in multiprogrammed computer systems. 9.2. The modelling of system resources and program behaviour. 9.3. Control of the degree of multiprogramming. 9.4. The page fault rate control policy (RCP). 9.5. Control of performance by selective memory allocation. 9.6. Towards a characterisation of achievable performance in terminal systems -- 10. A queue with server of walking type. 10.1. Introduction. 10.2. Properties of the waiting time process. 10.3. Application to a paging drum model. Analysis and Synthesis of Computer Systems presents a broad overview of methods that are used to evaluate the performance of computer systems and networks, manufacturing systems, and interconnected services systems. Aside from a highly readable style that rigorously addresses all subjects, this second edition includes new chapters on numerical methods for queueing models and on G-networks, the latter being a new area of queuing theory that one of the authors has pioneered. This book will have a broad appeal to students, practitioners and researchers in several different areas, including practicing computer engineers as well as computer science and engineering students. Print version record. English. Computer systems Evaluation. Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Electronic digital computers Evaluation. http://id.loc.gov/authorities/subjects/sh85042316 Ordinateurs Évaluation. Théorie des files d'attente. Systèmes informatiques Évaluation. COMPUTERS Systems Architecture General. bisacsh Electronic digital computers Evaluation fast Computer systems Evaluation fast Queuing theory fast Mitrani, I. has work: Analysis and synthesis of computer systems (Text) https://id.oclc.org/worldcat/entity/E39PCYBGXwWYxFVV7v9dgyvXbb https://id.oclc.org/worldcat/ontology/hasWork Print version: Gelenbe, E., 1945- Analysis and synthesis of computer systems. 2nd ed. London : Academic Press ; Hackensack, NJ : Distributed by World Scientific Pub. Co., ©2010 9781848163959 (DLC) 2010485690 (OCoLC)619938522 Advances in computer science and engineering. Texts ; v. 4. http://id.loc.gov/authorities/names/no2007041420 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=340776 Volltext |
| spellingShingle | Gelenbe, Erol, 1945- Analysis and synthesis of computer systems / Advances in computer science and engineering. Texts ; 1. Basic tools of probabilistic modelling. 1.1. General background. 1.2. Markov processes. The exponential distribution. 1.3. Poisson arrival streams. Important properties. 1.4. Steady-state. Balance diagrams. The "Birth and Death" process. 1.5. The M/M/1, M/M/c and related queueing systems. 1.6. Little's result. Applications. The M/G/1 system. 1. 7. Operational identities. 1.8. Priority queueing -- 2. The queue with server of walking type and its applications to computer system modelling. 2.1. Introduction. 2.2. The queue with server of walking type with Poisson arrivals, and the M/G/1 queue. 2.3. Evaluation of secondary memory device performance. 2.4. Analysis of multiplexed data communication systems -- 3. Queueing network models. 3.1. General remarks. 3.2. Feedforward networks and product-form solution. 3.3. Jackson networks. 3.4. Other scheduling strategies and service time distributions. 3.5. The BCMP theorem. 3.6. The computation of performance measures -- 4. Queueing networks with multiple classes of positive and negative customers and product form solution. 4.1. Introduction. 4.2. The model. 4.3. Main results. 4.4. Existence of the solution to the traffic equations. 4.5. Conclusion -- 5. Markov-modulated queues. 5.1. A multiserver queue with breakdowns and repairs. 5.2. Manufacturing blocking. 5.3. Phase-type distributions. 5.4. Checkpointing and recovery in the presence of faults. 5.5. Spectral expansion solution. 5.6. Balance equations. 5.7. Batch arrivals and/or departures. 5.8. A simple approximation. 5.9. The heavy traffic limit. 5.10. Applications and comparisons. 5.11. Remarks -- 6. Diffusion approximation methods for general queueing networks. 6.1. Introduction. 6.2. Diffusion approximation for a single queue. 6.3. Diffusion approximations for general networks of queues with one customer class. 6.4. Approximate behaviour of a single queue in a network with multiple customer classes. 6.5. Conclusion -- 7. Approximate decomposition and iterative techniques for closed model solution. 7.1. Introduction. 7.2. Subsystem isolation. 7.3. Decomposition as an approximate solution method. 7.4. An electric circuit analogy for queueing network solution -- 8. Synthesis problems in single-resource systems : characterisation and control of achievable performance. 8.1. Problem formulation. 8.2. Conservation laws and inequalities. 8.3. Characterisation theorems. 8.4. The realisation of pre-specified performance vectors. Complete families of scheduling strategies. 8.5. Optimal scheduling strategies -- 9. Control of performance in multiple-resource systems. 9.1. Some problems arising in multiprogrammed computer systems. 9.2. The modelling of system resources and program behaviour. 9.3. Control of the degree of multiprogramming. 9.4. The page fault rate control policy (RCP). 9.5. Control of performance by selective memory allocation. 9.6. Towards a characterisation of achievable performance in terminal systems -- 10. A queue with server of walking type. 10.1. Introduction. 10.2. Properties of the waiting time process. 10.3. Application to a paging drum model. Computer systems Evaluation. Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Electronic digital computers Evaluation. http://id.loc.gov/authorities/subjects/sh85042316 Ordinateurs Évaluation. Théorie des files d'attente. Systèmes informatiques Évaluation. COMPUTERS Systems Architecture General. bisacsh Electronic digital computers Evaluation fast Computer systems Evaluation fast Queuing theory fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85109832 http://id.loc.gov/authorities/subjects/sh85042316 |
| title | Analysis and synthesis of computer systems / |
| title_auth | Analysis and synthesis of computer systems / |
| title_exact_search | Analysis and synthesis of computer systems / |
| title_full | Analysis and synthesis of computer systems / Erol Gelenbe, Isi Mitrani. |
| title_fullStr | Analysis and synthesis of computer systems / Erol Gelenbe, Isi Mitrani. |
| title_full_unstemmed | Analysis and synthesis of computer systems / Erol Gelenbe, Isi Mitrani. |
| title_short | Analysis and synthesis of computer systems / |
| title_sort | analysis and synthesis of computer systems |
| topic | Computer systems Evaluation. Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Electronic digital computers Evaluation. http://id.loc.gov/authorities/subjects/sh85042316 Ordinateurs Évaluation. Théorie des files d'attente. Systèmes informatiques Évaluation. COMPUTERS Systems Architecture General. bisacsh Electronic digital computers Evaluation fast Computer systems Evaluation fast Queuing theory fast |
| topic_facet | Computer systems Evaluation. Queuing theory. Electronic digital computers Evaluation. Ordinateurs Évaluation. Théorie des files d'attente. Systèmes informatiques Évaluation. COMPUTERS Systems Architecture General. Electronic digital computers Evaluation Computer systems Evaluation Queuing theory |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=340776 |
| work_keys_str_mv | AT gelenbeerol analysisandsynthesisofcomputersystems AT mitranii analysisandsynthesisofcomputersystems |