05110nam 2200697 a 450 991045928350332120200520144314.01-282-62409-197866126240941-84719-807-4(CKB)2670000000036112(EBL)950547(OCoLC)797916461(SSID)ssj0000404606(PQKBManifestationID)11260694(PQKBTitleCode)TC0000404606(PQKBWorkID)10346522(PQKB)11145645(MiAaPQ)EBC950547(CaSebORM)9781847198068(PPN)22802191X(Au-PeEL)EBL950547(CaPaEBR)ebr10441095(CaONFJC)MIL262409(EXLCZ)99267000000003611220110121d2010 uy 0engur|n|---|||||txtccrOracle JRockit[electronic resource] the definitive guide : develop and manage robust Java applications with Oracle's high-performance Java Virtual Machine /Marcus Hirt, Marcus Lagergren1st editionBirmingham, U.K. Packt Enterprise20101 online resource (588 p.)Includes index.1-84719-806-6 Includes bibliographical references (p. [493]-501) and index.Cover; Copyright; Credits; Foreword; About the Authors; About the Reviewers; Table of Contents; Preface; Chapter 1: Getting Started; Obtaining the JRockit JVM; Migrating to JRockit; Command-line options; System properties; Standardized options; Non-standard options; Changes in behavior; A note on JRockit versioning; Getting help; Summary; Chapter 2: Adaptive Code Generation; Platform independence; The Java Virtual Machine; Stack machine; Bytecode format; Operations and operands; The constant pool; Code generation strategies; Pure bytecode interpretation; Static compilationTotal JIT compilationMixed mode interpretation; Adaptive code generation; Determining ""hotness""; Invocation counters; Software-based thread sampling; Hardware-based sampling; Optimizing a changing program; Inside the JIT compiler; Working with bytecode; Bytecode obfuscation; Bytecode ""optimizers""; Abstract syntax trees; Where to optimize; The JRockit code pipeline; Why JRockit has no bytecode interpreter; Bootstrapping; Runtime code generation; Trampolines; Code generation requests; Optimization requests; On-stack replacement; Bookkeeping; A walkthrough of method generation in JRockitThe JRockit IR formatJIT compilation; Generating optimized code; Controlling code generation in JRockit; Command-line flags and directive files; Command-line flags; Directive files; Summary; Chapter 3: Adaptive Memory Management; The concept of automatic memory management; Adaptive memory management; Advantages of automatic memory management; Disadvantages of automatic memory management; Fundamental heap management; Allocating and releasing objects; Fragmentation and compaction; Garbage collection algorithms; Reference counting; Tracing techniques; Mark and sweep; Stop and copyStopping the worldConservative versus exact collectors; Livemaps; Generational garbage collection; Multi generation nurseries; Write barriers; Throughput versus low latency; Optimizing for throughput; Optimizing for low latency; Garbage collection in JRockit; Old collections; Nursery collections; Permanent generations; Compaction; Speeding it up and making it scale; Thread local allocation; Larger heaps; 32-Bits and the 4-GB Barrier; The 64-bit world; Cache friendliness; Prefetching; Data placement; NUMA; Large pages; Adaptability; Near-real-time garbage collection; Hard and soft real-timeJRockit Real TimeDoes the soft real-time approach work?; How does it work?; The Java memory API; Finalizers; References; Weak references; Soft references; Phantom references; Differences in JVM behavior; Pitfalls and false optimizations; Java is not C++; Controlling JRockit memory management; Basic switches; Outputting GC data; Set initial and maximum heap size; Controlling what to optimize for; Specifying a garbage collection strategy; Compressed references; Advanced switches; Summary; Chapter 4: Threads and Synchronization; Fundamental concepts; Hard to debug; Difficult to optimizeLatency analysisDevelop and manage robust Java applications with Oracle's high-performance JRockit Java Virtual Machine with this book and eBookApplication softwareDevelopmentJava (Computer program language)Electronic books.Application softwareDevelopment.Java (Computer program language)005.1005.133Hirt Marcus973607Lagergren Marcus973608MiAaPQMiAaPQMiAaPQBOOK9910459283503321Oracle JRockit2215051UNINA02139nas 2200625-- 450 991033973210332120241221111335.0(CKB)954921368588(CONSER)---75646014-(MiFhGG)6184(EXLCZ)9995492136858820751216a19759999 --- aengtxtrdacontentcrdamediacrrdacarrierEmployee relations law journal[New York][Executive Enterprises Publications Co.]1 online resourceRefereed/Peer-reviewedPublisher: Executive Enterprises Publications Co., 1975-<19>; John Wiley & Sons, <1996->Print version: Employee relations law journal. (DLC) 75646014 (OCoLC)60621747 0098-8898 EMPLOYEE RELAT LAW JEmpl. relat. law j.Labor laws and legislationUnited StatesPeriodicalsIndustrial relationsUnited StatesPeriodicalsIndustrial relationsfast(OCoLC)fst00971609Labor laws and legislationfast(OCoLC)fst00989967ArbeidsrechtgttArbeidsverhoudingengttArbeitsrechtstwArbeitsbeziehungenstwUSAstwArbeitskräftestwWirtschaftswissenschaftstwUnited Statesfasthttps://id.oclc.org/worldcat/entity/E39PBJtxgQXMWqmjMjjwXRHgrqPeriodicals.fastPeriodicals.lcgftLabor laws and legislationIndustrial relationsIndustrial relations.Labor laws and legislation.Arbeidsrecht.Arbeidsverhoudingen.Arbeitsrecht.Arbeitsbeziehungen.USA.Arbeitskräfte.Wirtschaftswissenschaft.344/.73/0105JOURNAL9910339732103321exl_impl conversionEmployee relations law journal2305491UNINA04241nam 22007335 450 991014349930332120251116233949.03-540-68536-710.1007/BFb0053977(CKB)1000000000210961(SSID)ssj0000324224(PQKBManifestationID)11259129(PQKBTitleCode)TC0000324224(PQKBWorkID)10312706(PQKB)10721498(DE-He213)978-3-540-68536-4(PPN)155183060(EXLCZ)99100000000021096120121227d1998 u| 0engurnn|008mamaatxtccrJob Scheduling Strategies for Parallel Processing IPPS/SPDP'98 Workshop, Orlando, Florida, USA, March 30, 1998 Proceedings /edited by Dror G. Feitelson, Larry Rudolph1st ed. 1998.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1998.1 online resource (X, 266 p.) Lecture Notes in Computer Science,0302-9743 ;1459Bibliographic Level Mode of Issuance: Monograph3-540-64825-9 Metrics and benchmarking for parallel job scheduling -- A comparative study of real workload traces and synthetic workload models for parallel job scheduling -- Lachesis: A job scheduler for the cray T3E -- A resource management architecture for metacomputing systems -- Implementing the combination of time sharing and space sharing on AP/Linux -- Job scheduling scheme for pure space sharing among rigid jobs -- Predicting application run times using historical information -- Job scheduling strategies for networks of workstations -- Probabilistic loop scheduling considering communication overhead -- Improving first-come-first-serve job scheduling by gang scheduling -- Expanding symmetric multiprocessor capability through gang scheduling -- Overhead analysis of preemptive gang scheduling -- Dynamic coscheduling on workstation clusters.This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Job Scheduling Strategies for Parallel Processing held during IPPS/SPDP'98, in Orlando, Florida, USA, in March 1998. The 13 revised full papers presented have gone through an iterated reviewing process and give a report on the state of the art in the area.Lecture Notes in Computer Science,0302-9743 ;1459Computer architectureOperating systems (Computers)Computer programmingAlgorithmsMicroprocessorsComputer System Implementationhttps://scigraph.springernature.com/ontologies/product-market-codes/I13057Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14045Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Processor Architectureshttps://scigraph.springernature.com/ontologies/product-market-codes/I13014Register-Transfer-Level Implementationhttps://scigraph.springernature.com/ontologies/product-market-codes/I12069Computer architecture.Operating systems (Computers)Computer programming.Algorithms.Microprocessors.Computer System Implementation.Operating Systems.Programming Techniques.Algorithm Analysis and Problem Complexity.Processor Architectures.Register-Transfer-Level Implementation.005.4/3475Feitelson Dror Gedthttp://id.loc.gov/vocabulary/relators/edtRudolph Larryedthttp://id.loc.gov/vocabulary/relators/edtIPPS/SPDP '98 WorkshopBOOK9910143499303321Job Scheduling Strategies for Parallel Processing2569128UNINA