Multilingualization Based on RPC for Job-level Parallel Script Language, Xcrypt
スポンサーリンク
概要
- 論文の詳細を見る
We are developing a job level parallel scripting language called Xcrypt, which helps us run a single program a number of times with different parameter values under computing environments where jobs are managed by a batch scheduler, such as supercomputers. Because Xcrypt is implemented as an extension to Perl, Xcrypt users are required to write Perl-based scripts. This becomes a barrier for programmers of other scripting languages when using Xcrypt. To solve this problem, we developed a framework that enables us to implement interfaces for using Xcrypt functionalities in other languages at a reasonable cost. To reuse existing Xcrypt implementations, we designed an RPC protocol between Perl and other languages. This protocol supports remote references to objects in another process, as well as callback functions. We can use Xcrypt APIs in any language by invoking Perl functions using RPCs. In our framework, Xcrypt extension modules, which Xcrypt users can implement as class extensions based on object oriented programming in Perl, can also be defined and used in any supported language. This paper also describes an example of a performance tuning of an electromagnetic field analysis simulation program performed with a Ruby-based parallel script that uses an extension module implemented in Lisp.
- 一般社団法人情報処理学会の論文
- 2013-08-29
著者
-
Nagamochi Hiroshi
Kyoto Univ.
-
Hiroshi Nakashima
ACCMS, Kyoto University
-
Takeshi Iwashita
Accms Kyoto University
-
Tasuku Hiraishi
Academic Center for Computing and Media Studies, Kyoto University
-
Tasuku Hiraishi
Academic Center For Computing And Media Studies Kyoto University
-
Motoharu Hibino
Graduate School of Informatics, Kyoto University|Presently with Toyota Technical Development Corp.
-
Masaru Ueno
Graduate School of Informatics, Kyoto University|Presently with Fujitsu Laboratories Ltd.
-
Takeshi Iwashita
Academic Center for Computing and Media Studies, Kyoto University
-
Hiroshi Nakashima
Academic Center for Computing and Media Studies, Kyoto University
関連論文
- Constant Time Generation of Trees with Degree Bounds
- A Memory-Efficient Algorithm and Its Implementation of Variable-Size All-to-All Communication
- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
- Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously
- Enumerating Colored and Rooted Outerplanar Graphs
- BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(the 50th Anniversary of the Operations Research Society of Japan)
- APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(the 50th Anniversary of the Operations Research Society of Japan)
- An Efficient Vector Transfer for Sparse Matrix-Vector Multiplication on Distributed Memory Systems
- Orthogonal Drawings for Plane Graphs with Specified Face Areas
- Efficient Representation of Constraints and Propagation of Variable-Value Symmetries in Distributed Constraint Reasoning
- Symmetry Breaking by Dominance Detection in Distributed Environments
- Around the Constructive Orbit Problem in Distributed Constraint Programming
- The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
- FOREWORD (Special Section on Discrete Mathematics and Its Applications)
- Parallel Graph Traversals using Work-Stealing Frameworks for Many-core Platforms
- GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(Network Design, Control and Optimization)
- Accelerating A* algorithms by sweeping out small-degree nodes
- CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS
- A Simulation-Based Analysis for Worst Case Delay of Single and Multiple Interruptions
- Multilingualization Based on RPC for Job-level Parallel Script Language, Xcrypt
- Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
- Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
- CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS
- Parallelization of Extracting Connected Subgraphs with Common Itemsets