Finite state automa for parallelization of time-expensive operations

Details Finite state automa for parallelization of time-expensive operations Finite state automa for parallelization of time-expensive operations

Jun 2008

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2008apsp.conf..753b&link_type=abstract

ASTROPARTICLE, PARTICLE AND SPACE PHYSICS, DETECTORS AND MEDICAL PHYSICS APPLICATIONS. Proceedings of the 10th Conference. Held

Physics

Medical Physics

Scientific paper

We describe a finite state automa simulator (FS), aimed at coordinating the symultaneous processing of many items. The automa was developed for improving the performances of the Data Transfer system for the AMS02 experiment, but its applications are generic. FS is programmed through a XML file, with an abstract language describing a finite state automa. FS implementation includes the logics needed to perform the operations in parallel threads, as soon as processing is required. FS allows to coordinate the execution of different time-consuming operation; moreover, it handles error conditions, and performs logging and book-keeping.

Affiliated with

Also associated with

No associations

Rating

Finite state automa for parallelization of time-expensive operations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite state automa for parallelization of time-expensive operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite state automa for parallelization of time-expensive operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1429833