000 03970nam a22003735i 4500
001 291222
003 MX-SnUAN
005 20160429154837.0
007 cr nn 008mamaa
008 150903s2009 xxk| o |||| 0|eng d
020 _a9781848823105
_99781848823105
024 7 _a10.1007/9781848823105
_2doi
035 _avtls000344411
039 9 _a201509030403
_bVLOAD
_c201405050306
_dVLOAD
_y201402061256
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.76.O63
100 1 _aDrozdowski, Maciej.
_eautor
_9322418
245 1 0 _aScheduling for Parallel Processing /
_cby Maciej Drozdowski.
264 1 _aLondon :
_bSpringer London,
_c2009.
300 _axiii, 386 páginas 200 ilustraciones, 100 ilustraciones en color.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aComputer Communications and Networks,
_x1617-7975
500 _aSpringer eBooks
505 0 _aBasics -- Vision of Scheduling in Parallel Systems -- Classic Scheduling Theory -- Parallel Tasks -- Scheduling with Communication Delays -- Divisible Loads -- Back to Scheduling Models.
520 _aTo take full advantage of high performance computing, parallel applications must be carefully managed to guarantee quality of service and fairness in using shared resources. Scheduling for parallel computing is an interdisciplinary subject joining many fields, and the broadness of research yields an immense number and diversity of models for understanding scheduling problems. This focused and useful book presents scheduling models for parallel processing, problems defined on the grounds of certain scheduling models, and algorithms solving the scheduling problems. As most of the scheduling problems are combinatorial in nature, the methodology of computational complexity theory is examined. Four examples of scheduling models are presented, along with problems and algorithms, before drawing conclusions on their mutual relationships. The book also provides helpful generalizations about scheduling models, their problems and algorithms. Topics and features: Introduces the fundamental scheduling concepts and clarifies the relation between scheduling models, problems, algorithms, and schedules Discusses the technological aspects of scheduling for parallel processing, demonstrating how highly abstract scheduling policies are determined by the underlying hardware and software Presents the notions, concepts, and algorithms that are most immediately applicable in parallel processing, including relevant aspects of classic scheduling theory Examines the parallel task model, analyzing rigid, moldable, malleable tasks, and tasks with shape Outlines the methodology of computational complexity theory and introduces the basic metrics of parallel application performance Explores scheduling with communication delays, taking into account the costs of delays Examines scheduling divisible loads in systems with limited memory, various interconnection types, and cost of usage Includes detailed illustrations, a comprehensive bibliography, and a helpful notation section This unique text will be a valuable resource for researchers in parallel computing, operating systems, management science, and applied mathematics. In addition, lecturers and advanced students needing a solid foundation about scheduling for parallel computing will find the book a critical teaching tool and reference.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9781848823099
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-84882-310-5
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c291222
_d291222