Cluster Computing and the Grid, IEEE International Symposium on (2012)
May 13, 2012 to May 16, 2012
DIRAC (Distributed Infrastructure with Remote Agent Control) is the grid solution designed to support production activities as well as user data analysis for the Large Hadron Collider "beauty" experiment. It consists of cooperating distributed services and a plethora of light-weight agents delivering the workload to the grid resources. Services accept requests from agents and running jobs, while agents actively fulfill specific goals. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, or requests for data transfer. Agents continuously check for changes in the service states, and react to these accordingly. The logic of each agent is rather simple, the main source of complexity lies in their cooperation. These agents run concurrently, and communicate using the services' databases as a shared memory for synchronizing the state transitions. Despite the effort invested in making DIRAC reliable, entities occasionally get into inconsistent states. Tracing and fixing such behaviors is difficult, given the inherent parallelism among the distributed components and the size of the implementation. In this paper we present an analysis of DIRAC with mCRL2, process algebra with data. We have reverse engineered two critical and related DIRAC subsystems, and subsequently modeled their behavior with the mCRL2 toolset. This enabled us to easily locate race conditions and live locks which were confirmed to occur in the real system. We further formalized and verified several behavioral properties of the two modeled subsystems.
DIRAC, service-oriented architecture, stager, mCRL2, model checking, process algebra, LHCb, formal methods
T. A. Willemse, W. Fokkink, J. Templon, K. Verstoep, H. Bal and D. Remenska, "Using Model Checking to Analyze the System Behavior of the LHC Production Grid," Cluster Computing and the Grid, IEEE International Symposium on(CCGRID), Ottawa, Canada, 2012, pp. 335-343.