{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":43,"n_cols":5,"rows_kept":43,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[24,2,24,3],[27,2,27,3],[27,4,27,5],[28,2,28,3],[28,4,28,5],[29,2,29,3],[29,4,29,5],[30,2,30,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[38,2,38,3],[39,2,39,3],[41,2,41,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465872703316"]
[null,null,"Titolo",null,"Job Scheduling Strategies for Parallel Processing [[electronic resource] ] : IPPS '96 Workshop, Honolulu, Hawaii, April 16, 1996. Proceedings / / edited by Dror G. Feitelson, Larry Rudolph"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996"]
[null,null,"ISBN",null,"3-540-70710-7"]
[null,null,"Edizione",null,"[1st ed. 1996.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 300 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 1162"]
[null,null,"Disciplina",null,"005.4/3"]
[null,null,"Soggetti",null,"Architecture, Computer"]
[{"$nulls":4},"Microprocessors"]
[{"$nulls":4},"Operating systems (Computers)"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Logic design"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Computer System Implementation"]
[{"$nulls":4},"Processor Architectures"]
[{"$nulls":4},"Operating Systems"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Logic Design"]
[{"$nulls":4},"Computation by Abstract Devices"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Toward convergence in job schedulers for parallel supercomputers -- Workload evolution on the Cornell Theory Center IBM SP2 -- The EASY — LoadLeveler API project -- A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm -- Architecture-independent request-scheduling with tight waiting-time estimations -- Packing schemes for gang scheduling -- A gang scheduling design for multiprogrammed parallel computing environments -- Implementation of gang-scheduling on workstation cluster -- Managing checkpoints for parallel programs -- Using runtime measured workload characteristics in parallel processor scheduling -- Parallel application characterization for multiprocessor scheduling policy design -- Dynamic vs. static quantum-based parallel processor allocation -- "]
[{"$nulls":4},"Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison -- Dynamic partitioning in different distributed-memory environments -- Locality-information-based scheduling in shared-memory multiprocessors."]
[null,null,null,"Sommario/riassunto","This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996. The book presents 15 thoroughly revised full papers accepted for inclusion on the basis of the reports of at least five program committee members. The volume is a highly competent contribution to advancing the state-of-the-art in the area of job scheduling for parallel supercomputers. Among the topics addressed are job scheduler, workload evolution, gang scheduling, multiprocessor scheduling, parallel processor allocation, and distributed memory environments."]
[null,"2.","Record Nr.",null,"UNINA9910157768303321"]
[null,null,"Autore",null,"Hunt Kayla"]
[null,null,"Titolo",null,"Caged Eagles : A Daring Adventure to Discover Individual Freedom"]
[null,null,"Pubbl/distr/stampa",null,"Chicago : , : Publication Consultants, , 2014"]
[{"$nulls":4},"©2014"]
[null,null,"ISBN",null,"1-59433-174-X"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (192 pages)"]
[null,null,"Soggetti",null,"Insurgency"]
[{"$nulls":4},"Romans"]
[{"$nulls":4},"Sagas"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Cover Page -- Title Page -- Copyright -- Acknowledgements -- Contents -- Chapter One -- Chapter Two -- Chapter Three -- Chapter Four -- Chapter Five -- Chapter Six -- Chapter Seven -- Chapter Eight -- Chapter Nine -- Chapter Ten -- Chapter Eleven -- Chapter Twelve -- Chapter Thirteen -- Chapter Fourteen -- Chapter Fifteen -- Chapter Sixteen -- Chapter Seventeen -- Chapter Eighteen -- Chapter Nineteen -- Chapter Twenty -- Chapter Twenty-One -- Chapter Twenty-Two -- Chapter Twenty-Three -- Chapter Twenty-Four -- Chapter Twenty-Five -- Chapter Twenty-Six -- Chapter Twenty-Seven -- Chapter Twenty-Eight -- Chapter Twenty-Nine."]
[null,null,null,"Sommario/riassunto","Trevor Wells is overpowered by the confining rules and regulations of his society. Unable to break free, he's imprisoned for a crime of self-defense. The people in his life also try to control him; Dr. Leslie Taylor, the counselor keeping him in rehab because she's in love with him. Brandi Lewis, his ex-lover, who will do anything to have him back, and the mysterious spy hired to follow him to Alaska and report his every move. Just when everything seems hopeless, Trevor meets Blaine Martin, a revolutionary leader. Blaine convinces Trevor real freedom can exist again and persuades him to become a leader in this campaign. Winning is slim, but one thing is for certain, Trevor can always find real freedom in the love he has for his soulmate-- Sarah. Will he ever break free of his cage and fly free?."]