MARC details
000 -LEADER |
fixed length control field |
07623cam a22001694a 4500 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9781439803677 (hardcover : alk. paper) |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
1439803676 (hardcover : alk. paper) |
040 ## - CATALOGING SOURCE |
Transcribing agency |
CUS |
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
004.36 |
Item number |
MAG/F |
245 00 - TITLE STATEMENT |
Title |
Fundamentals of grid computing: theory, algorithms and technologies / |
Statement of responsibility, etc. |
edited by Frédéric Magoulès. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication, distribution, etc. |
Boca Raton : |
Name of publisher, distributor, etc. |
CRC Press, |
Date of publication, distribution, etc. |
c2010. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xxi, 298 p. |
Dimensions |
25 cm. |
500 ## - GENERAL NOTE |
General note |
"A Chapman & Hall book." |
505 ## - FORMATTED CONTENTS NOTE |
Formatted contents note |
Grid computing overview<br/>Frederic Magoules, Thi-Mai-Huong Nguyen, and Lei Yu<br/>1.1 Introduction<br/>1.2 Definitions<br/>1.3 Classifying grid systems<br/>1.4 Grid applications<br/>1.5 Grid architecture<br/>1.6 Grid computing projects<br/>1.6.1 Grid middleware (core services)<br/>1.6.2 Grid resource brokers and schedulers<br/>1.6.3 Grid systems<br/>1.6.4 Grid programming environments<br/>1.6.5 Grid portals<br/>1.7 Grid evolution<br/>1.8 Concluding remarks<br/>1.9 References<br/>Synchronization protocols for sharing resources in grid envi<br/>ronments<br/>Julien Sopena, Luciana Arantes, Fabrice Legend-Aubry, and Pierre Sens<br/>2.1 Introduction<br/>2.2 Token-based mutual exclusion algorithms<br/>2.2.1 Martin's algorithm<br/>2.2.2 Naimi-Trehel's algorithm<br/>2.2.3 Suzuki-Kasami's algorithm<br/>2.3 Mutual exclusion algorithms for large configurations<br/>2.3.1 Priority-based approach<br/>2.3.2 Composition-based approach<br/>2.4 Composition approach to mutual exclusion algorithms<br/>2.4.1 Coordinator processes<br/>2.5 Composition properties and its natural effects<br/>2.5.1 Filtering and aggregation<br/>2.5.2 Preemption and structural effects<br/>2.5.3 Natural effects of composition<br/>2.6 Performance evaluation<br/>2.6.1 Experiment parameters<br/>2.6.2 Performance results: composition study<br/>2.6.3 The impact of the grid architecture<br/>2.7 Concluding remarks<br/>2.8 References<br/>Data replication in grid environments<br/>Thi-Mai-Huong Nguyen and Frederic Magoules<br/>3.1 Introduction<br/>3.2 Data replication<br/>3.2.1 Replication in databases<br/>3.2.2 Replication in peer-to-peer systems<br/>3.2.3 Replication in web environments .<br/>3.2.4 Replication in data grids<br/>3.3 System architecture<br/>3.4 Selective-rank model for a replication system .<br/>3.4.1 Model assumptions<br/>3.4.2 Estimating the availability of files<br/>3.4.3 Problem definition<br/>3.5 Selective-rank replication algorithm<br/>3.5.1 Popularity of files .<br/>3.5.2 Correlation of files<br/>3.5.3 MaxDAR optimizer algorithm<br/>3.6 Evaluation<br/>3.6.1 Grid configuration<br/>3.6.2 Experimental results<br/>3.7 Concluding remarks<br/>3.8 References<br/>Data management in grids<br/>Jean-Marc Pierson<br/>4.1 Introduction<br/>4.2 Prom data sources to databases ... to data sources<br/>4.3 Positioning the data management in grids within distributed<br/>systems<br/>4.4 Links with the other services of the middleware<br/>4.5 Problems and some solutions<br/>4.5.1 Data identification, indexing, metadata<br/>4.5.2 Data access, interoperability, query processing, transac<br/>tions ,<br/>4.5.3 Transport<br/>4.5.4 Placement, replication, caching<br/>4.5.5 Security: transport, authentication, access control, en<br/>cryption<br/>4.5.6 Consistency<br/>4.6 Toward pervasive, autonomic and on-demand data manage<br/>ment<br/>4.7 Concluding remarks<br/>4.8 References<br/>5 Future of grids resources management<br/>Fei Teng and Frederic Magoules<br/>5.1 Introduction<br/>5.2 Several computing paradigms<br/>5.2.1 Utility computing<br/>5.2.2 Grid computing<br/>5.2.3 Autonomic computing<br/>5.2.4 Cloud computing<br/>5.3 Definition of cloud computing<br/>5.3.1 One definition<br/>5.3.2 Architecture<br/>5.4 -Cloud services<br/>5.4.1 Three-level services . .<br/>5.4.2 Service characters . .<br/>5.5 Cloud resource management<br/>5.5.1 Comparison with grid systems<br/>5.5.2 Resource model .<br/>5.5.3 Economy-oriented model<br/>5.6 Future direction of resource scheduling<br/>5.6.1 Scalable and dynamic<br/>5.6.2 Secure and trustable .<br/>5.6.3 Virtual machines-based<br/>5.7 Concluding remarks<br/>5.8 References<br/>6 Fault-tolerance and availability awareness in computational<br/>grids 143<br/>Xavier Besseron, Mohamed'Slim Bouguerra, Thierry Gautier, Erik Saule,<br/>and Denis Trystram<br/>6.1 Introduction<br/>6.2 Background and definitions<br/>6.2.1 Grid architecture and execution model<br/>6.2.2 Faults models<br/>6.2.3 Consistent system states<br/>6.3 Multi-objective scheduling for safety<br/>6.3.1 Generalities . .<br/>6.3.2 No duplication<br/>6.3.3 Using duplication<br/>6.4 Stable memory-based protocols<br/>6.4.1 Log-based rollback recovery<br/>6.4.2 Checkpoint-based rollback recovery .<br/>6.5 Stochastic checkpoint model analysis issues<br/>6.5.1 Completion time without fault tolerance<br/>6.5.2 Impact of checkpointing on the completion time<br/>6.6 Implementations<br/>6.6.1 Single process snapshot<br/>6.6.2 Fault-tolerance protocol implementations<br/>6.6.3 Implementation comparison<br/>6.7 Concluding remarks<br/>6.8 References<br/>7 Fault tolerance for distributed scheduling in grids<br/>Lei Yu and Frederic Magoules<br/>7.1 Introduction<br/>7.2 Fault tolerance in distributed systems<br/>7.3 Distributed scheduling model<br/>7.3.1 MMS fault tolerance .<br/>7.3.2 LMS/SMS fault tolerance<br/>7.3.3 CR fault tolerance<br/>7.4 Fault detection and repairing in the tree structure<br/>7.4.1 Notations<br/>7.4.2 Algorithms description<br/>7.4.3 Messages treatment analysis<br/>7.5 Distributed scheduling algorithm<br/>7.5.1 Distributed dynamic scheduling algorithm with fault<br/>tolerance (DDFT)<br/>7.5.2 Algorithm fault tolerance issues<br/>7.6 SimGrid and simulation design<br/>7.7 Evaluation<br/>7.7.1 Simulation setup<br/>7.7.2 Comparison with centralized scheduling<br/>7.7.3 Fault tolerance experiments<br/>7.7.4 Workload analysis<br/>7.8 Related work<br/>7.9 Concluding remarks<br/>7.10 References<br/>8 Broadcasting for grids<br/>Christophe Cerin, Luiz-Angelo Steffenel, and Hazem Fkaier<br/>8.1 Introduction .<br/>8.2 Broadcastings<br/>8.3 Heuristics for broadcasting<br/>8.3.1 Basic approaches for broadcasting in homogeneous en<br/>vironments<br/>8.3.2 Advanced approaches for heterogeneous clusters<br/>8.3.3 Grid aware heuristics .<br/>8.3.4 New approach for broadcasting in clusters and hyper<br/>clusters<br/>8.4 Related work and related methods<br/>8.4.1 Broadcasting and dynamic programming<br/>8.4.2 Multi-criteria approach<br/>8.4.3 Broadcast for clusters<br/>8.4.4 Broadcast and heterogeneous systems .<br/>8.5 Concluding remarks<br/>8.6 References<br/>9 Load balancing algorithms for dynamic networks<br/>Jacques M. Bahiy Raphael Couturier, and Abderrahmane Sider<br/>9.1 Introduction<br/>9.2 A taxonomy for load balancing<br/>9.3 Distributed load balancing algorithms for static networks<br/>9.3.1 Network model and performance measures<br/>9.3.2 Diffusion<br/>9.3.3 Dimension exchange . .<br/>9.3.4 ODE<br/>9.3.5 Second order algorithms<br/>9.4 Distributed load balancing algorithms for dynamic networks<br/>9.4.1 Adaption to dynamic networks<br/>9.4.2 Generalized adaptive exchange (CAE)<br/>9.4.3 Illustrating the generalized adaptive exchange most to<br/>least loaded policy on a dynamic network<br/>9.5 Implementation<br/>9.5.1 On synchronous and asynchronous approaches<br/>9.5.2 How to define the load for some applications .<br/>9.5.3 Implementation of static algorithms<br/>9.5.4 Implementation of dynamic algorithms<br/>9.6 A practical example: the advection diffusion application<br/>9.6.1 Load balancing and the application<br/>9.6.2 Load balancing in a dynamic network<br/>9.7 Concluding remarks<br/>9.8 References<br/>Implementation of the replication strategies in OptorSim<br/>Thi-Mai-Huong Nguyen and FYediric Magoules<br/>A.l Introduction<br/>A.2 Download<br/>A.3 Implementation<br/>A.3.1 OptorSim implementation<br/>A.3.2 MaxDAR implementation<br/>A.4 How to execute the simulation<br/>Implementation of the simulator for the distributed schedul<br/>ing model<br/>Lei Yu and Frederic Magoules<br/>B.l Introduction<br/>B.2 Download<br/>B.3 Implementation<br/>B.3.1 Data structures .<br/>B.3.2 Functions<br/>B.4 How to execute the simulation |
650 #0 - SUBJECT |
Keyword |
Computational grids (Computer systems) |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Koha item type |
General Books |