Efficient Polymorphic Calls: The Springer International Series in Engineering and Computer Science, cartea 596
Autor Karel Driesenen Limba Engleză Paperback – 26 oct 2012
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 967.58 lei 6-8 săpt. | |
Springer Us – 26 oct 2012 | 967.58 lei 6-8 săpt. | |
Hardback (1) | 973.77 lei 6-8 săpt. | |
Springer Us – 28 feb 2001 | 973.77 lei 6-8 săpt. |
Din seria The Springer International Series in Engineering and Computer Science
- Preț: 119.98 lei
- 24% Preț: 1041.97 lei
- 20% Preț: 422.81 lei
- Preț: 206.36 lei
- 20% Preț: 313.26 lei
- 20% Preț: 632.66 lei
- 23% Preț: 687.70 lei
- 18% Preț: 1204.93 lei
- 18% Preț: 948.75 lei
- 20% Preț: 635.23 lei
- 18% Preț: 932.78 lei
- 20% Preț: 635.73 lei
- 15% Preț: 626.72 lei
- 20% Preț: 632.97 lei
- 18% Preț: 933.22 lei
- 20% Preț: 633.63 lei
- 20% Preț: 978.13 lei
- 20% Preț: 635.09 lei
- 18% Preț: 930.90 lei
- 20% Preț: 978.77 lei
- 18% Preț: 940.85 lei
- 20% Preț: 634.12 lei
- 15% Preț: 638.60 lei
- 18% Preț: 934.19 lei
- 18% Preț: 1200.75 lei
- 18% Preț: 941.47 lei
- 15% Preț: 633.14 lei
- 18% Preț: 932.47 lei
- 18% Preț: 931.38 lei
- 20% Preț: 1262.96 lei
Preț: 967.58 lei
Preț vechi: 1209.47 lei
-20% Nou
Puncte Express: 1451
Preț estimativ în valută:
185.26€ • 192.91$ • 153.71£
185.26€ • 192.91$ • 153.71£
Carte tipărită la comandă
Livrare economică 14-28 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461356752
ISBN-10: 146135675X
Pagini: 240
Ilustrații: XVII, 216 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.34 kg
Ediția:Softcover reprint of the original 1st ed. 2001
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 146135675X
Pagini: 240
Ilustrații: XVII, 216 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.34 kg
Ediția:Softcover reprint of the original 1st ed. 2001
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1 Introduction.- 1.1 Polymorphism.- 1.2 Inheritance.- 1.3 Problem statement.- 1.4 Overview.- 2 Polymorphic calls.- 2.1 Basic construct.- 2.2 Hand-crafted polymorphism.- 2.3 Object-oriented message dispatch.- 3 Software techniques for efficient polymorphic calls.- 3.1 Basic message dispatch in object-oriented languages.- 3.2 Dynamic techniques.- 3.3 Static techniques.- 3.4 Memory cost.- 3.5 Programming environment aspects.- 3.6 Summary.- 4 Row displacement compression of message dispatch tables.- 4.1 Class-based row displacement.- 4.2 Selector-based row displacement.- 4.3 Compression results.- 4.4 Optimizing table compression speed.- 4.5 interactive programming environments.- 4.6 Summary.- 5 Analysis of dispatch sequences on modern processor architectures.- 5.1 Parameters influencing performance.- 5.2 Dispatch cost calculation.- 5.3 Cost of dynamic typing and multiple inheritance.- 5.4 Influence of processor implementation.- 5.5 Limitations.- 5.6 Summary.- 6 Measurement of virtual function call overhead on modern processors.- 6.1 Virtual function tables and the thunk variant.- 6.2 Superscalar processors.- 6.3 Method.- 6.4 Results.- 6.5 Discussion.- 6.6 Summary.- 7 Hardware techniques.- 7.1 Software vs. hardware prediction.- 7.2 Hardware indirect branch prediction.- 7.3 Indirect branch frequency.- 7.4 Experimental setup.- 7.5 Problem statement.- 8 Basic indirect branch predictors.- 8.1 Branch target buffer.- 8.2 Two-level predictor.- 8.3 History buffers.- 8.4 history tables.- 8.5 Summary.- 9 Hybrid indirect branch predictors.- 9.1 Hybrid prediction.- 9.2 Branch classification.- 9.3 Dual-path hybrid prediction.- 9.4 Cascaded prediction.- 9.5 Summary.- 10 Related work.- 10.1 Software techniques.- 10.2 Polymorphic calls in Java.- 10.3 Hardware techniques.- 11 Conclusions.- 12 Glossary.- 13 References.- Appendix A Polymorphic call sequences in assembly.- Appendix B Indirect branch execution intervals.- Appendix C Basic prediction accuracy per benchmark.