000 | 03318nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-642-02924-0 | ||
003 | DE-He213 | ||
005 | 20240423125751.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2009 gw | s |||| 0|eng d | ||
020 |
_a9783642029240 _9978-3-642-02924-0 |
||
024 | 7 |
_a10.1007/978-3-642-02924-0 _2doi |
|
050 | 4 | _aQA76.9.E94 | |
072 | 7 |
_aUYD _2bicssc |
|
072 | 7 |
_aCOM011000 _2bisacsh |
|
072 | 7 |
_aUYD _2thema |
|
082 | 0 | 4 |
_a004.24 _223 |
245 | 1 | 0 |
_aComputer Performance Engineering _h[electronic resource] : _b6th European Performance Engineering Workshop, EPEW 2009 London, UK, July 9-10, 2009 Proceedings / _cedited by Jeremy T. Bradley. |
250 | _a1st ed. 2009. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2009. |
|
300 |
_aX, 221 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aProgramming and Software Engineering, _x2945-9168 ; _v5652 |
|
505 | 0 | _aTagged Generalized Stochastic Petri Nets -- Modelling Zoned RAID Systems Using Fork-Join Queueing Simulation -- Performance of Auctions and Sealed Bids -- Applying Symbolic Techniques to the Representation of Non-Markovian Models with Continuous PH Distributions -- Mean Value Analysis for a Class of PEPA Models -- Automatic Generation of Performance Analysis Results: Requirements and Demonstration -- Analytical Model of Traffic Compression in the UMTS Network -- From DFTs to PEPA: A Model-to-Model Transformation -- Passage-End Analysis -- Stochastic Monotonicity in Queueing Networks -- Fast Generation of Scale Free Networks with Directed Arcs -- A More Realistic Peer-to-Peer Grid Market Model -- Migrating Auctioneers on Internet Auctions for Improved Utility and Performance -- Analytical Model of the Soft Handoff Mechanism in the UMTS Network -- Analytical Model of TCP NewReno through a CTMC -- Packet Loss Analysis of Load-Balancing Switch with ON/OFF Input Processes -- Approximate Analysis of a Round Robin Scheduling Scheme for Network Coding -- Analysis of Large Populations of Interacting Objects with Mean Field and Markovian Agents. | |
650 | 0 |
_aElectronic digital computers _xEvaluation. |
|
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer engineering. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer programming. | |
650 | 1 | 4 | _aSystem Performance and Evaluation. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aComputer Engineering and Networks. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aProgramming Techniques. |
700 | 1 |
_aBradley, Jeremy T. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642029233 |
776 | 0 | 8 |
_iPrinted edition: _z9783642029257 |
830 | 0 |
_aProgramming and Software Engineering, _x2945-9168 ; _v5652 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-02924-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c181482 _d181482 |