Book Image

IBM WebSphere eXtreme Scale 6

By : Anthony Chaves
Book Image

IBM WebSphere eXtreme Scale 6

By: Anthony Chaves

Overview of this book

A data grid is a means of combining computing resources. Data grids provide a way to distribute object storage and add capacity on demand in the form of CPU, memory, and network resources from additional servers. All three resource types play an important role in how fast data can be processed, and how much data can be processed at once. WebSphere eXtreme Scale provides a solution to scalability issues through caching and grid technology. Working with a data grid requires new approaches to writing highly scalable software; this book covers both the practical eXtreme Scale libraries and design patterns that will help you build scalable software. Starting with a blank slate, this book assumes you don't have experience with IBM WebSphere eXtreme Scale. It is a tutorial-style guide detailing the installation of WebSphere eXtreme Scale right through to using the developer libraries. It covers installation and configuration, and discusses the reasons why a data grid is a viable middleware layer. It also covers many different ways of interacting with objects in eXtreme Scale. It will also show you how to use eXtreme Scale in new projects, and integrate it with relational databases and existing applications. This book covers the ObjectMap, Entity, and Query APIs for interacting with objects in the grid. It shows client/server configurations and interactions, as well as the powerful DataGrid API. DataGrid allows us to send code into the grid, which can be run where the data lives. Equally important are the design patterns that go alongside using a data grid. This book covers the major concepts you need to know that prevent your client application from becoming a performance bottleneck. By the end of the book, you'll be able to write software using the eXtreme Scale APIs, and take advantage of a linearly scalable middleware layer.
Table of Contents (15 chapters)
IBM WebSphere eXtreme Scale 6
Credits
About the Author
About the Reviewers
Preface

FIFO queues


BackingMaps can act as FIFO (first-in, first-out) queues thanks to the getNextKey(int timeout) method. This method retrieves the next key in the map determined by its insertion order. When this method is called, a lock on the object is obtained so that next call to getNextKey(int timeout) does not return the same object. In order to iterate over an entire BackingMap, the application must explicitly remove the object with that key when the thread or process is finished with it. Otherwise, the key remains at the front of the queue and the next call to getNextKey(int timeout) returns a key that we have already operated upon. Without removing the key, a call to getNextKey(int timeout) will return the same key whenever the lock on that object is released. The getNextKey(int timeout) method takes a number of milliseconds to wait for an object to become available in the BackingMap. If this timeout is exceeded, then the method gives up and returns null.

We can use the getNextKey(int...