Semantic retrieval for the accurate identification of relational concepts in massive textbases
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
gluepy: A Simple Distributed Python Programming Framework for Complex Grid Environments
Languages and Compilers for Parallel Computing
GMount: An Ad Hoc and Locality-Aware Distributed File System by Using SSH and FUSE
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
GMount: Build your grid file system on the fly
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
ParaTrac: a fine-grained profiler for data-intensive workflows
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
A multi-level scalable startup for parallel applications
Proceedings of the 1st International Workshop on Runtime and Operating Systems for Supercomputers
Inferring appropriate eligibility criteria in clinical trial protocols without labeled data
Proceedings of the ACM sixth international workshop on Data and text mining in biomedical informatics
Design and implementation of GXP make - A workflow system based on make
Future Generation Computer Systems
| Hi-index | 0.00 |
We describe GXP, a shell for distributed multi-cluster environments. With GXP, users can quickly submit a command to many nodes simultaneously (approximately 600 milliseconds on over 300 nodes spread across five local-area networks). It therefore brings an interactive and instantaneous response to many cluster/network operations, such as trouble diagnosis, parallel program invocation, installation and deployment, testing and debugging, monitoring, and dead process cleanup. It features (1) a very fast parallel (simultaneous) command submission, (2) parallel pipes (pipes between local command and all parallel commands), and (3) a flexible and efficient method to interactively select a subset of nodes to execute subsequent commands on. It is very easy to start using GXP, because it is designed not to require cumbersome per-node setup and installation and to depend only on a very small number of pre-installed tools and nothing else. We describe how GXP achieves these features and demonstrate through examples how they make many otherwise boring and error-prone tasks simple, efficient, and fun.