Efficiently using the computational power made available through desktop grids based distributed systems is a complicated and many-sided problem, caused by the intermittent resource availability. In this paper a novel...
详细信息
ISBN:
(纸本)9781424435692
Efficiently using the computational power made available through desktop grids based distributed systems is a complicated and many-sided problem, caused by the intermittent resource availability. In this paper a novel solution is presented for predicting the runtimes of parameter sweep jobs. These jobs are characterized by their lack of inter-dependence and suitability for runtime prediction by modeling. This makes them ideal candidates for deployment on volatile grid configurations using prediction based techniques. The parameter sweep prediction framework used to make the predictions is referred to as GIPSy (grid information prediction system). Previous research involving GIPSy has focused on results obtained during simulation were it is necessary to make some basic assumptions. By combining GIPSy with PGS (prediction based grid scheduling), an actual grid implementation, real results can be obtained. A detailed comparison between the expected results, based on simulation analysis, and the final results is given. Discrepancies are highlighted and possible causes are identified, solutions are proposed and implemented. By comparing the results for different model building configurations an optimal configuration is found that produces reliable result independent of the chosen job type. Results are presented for a quantum physics problem and two simulated workloads represented by sleep jobs.
The problem of automatic control of elastic computing granularity can be solved based on self-similar (fractal) network patterns. These patterns can control the level of granularity and ensure quick and efficient resp...
The problem of automatic control of elastic computing granularity can be solved based on self-similar (fractal) network patterns. These patterns can control the level of granularity and ensure quick and efficient response to user demand, leading to optimal performance and minimized resource usage. For controlling and programming elastic computing granularity, the Fractal Abstract Machine (FAM) is proposed. It is also a theoretical framework for designing and modeling elastic computer systems, as well as for simulated elastic granularity, in order to solve optimization problems. Currently, FAM is investigating how to regulate an elastic network model while allocating containers and scheduling tasks in distribution networks. The correspondent example is considered. The idea of fractal computing, which controls elastic computing granularity, is explored.
We consider the problem of comparison of scalar products in real linear spaces. Such problem arise during synthesis and optimal choosing of discrete and continuous measurement systems and combinatorial systems. Beside...
详细信息
We consider the problem of comparison of scalar products in real linear spaces. Such problem arise during synthesis and optimal choosing of discrete and continuous measurement systems and combinatorial systems. Besides, they are also typical for general theory of partial differential equations, including local multipoint problems, whose solutions describe various oscillations and other natural processes. We specify necessary and sufficient conditions for such comparison, which are easy to check. We use special transformations of sums and series, which arise in respective scalar products, for finite- and infinite-dimensional cases.
This paper provides an overview of the generalized problem of optimization of mechanical quencher, considered specific problem - investigated the frequency response of a cylindrical pendulum and quencher mechanical vi...
详细信息
ISBN:
(纸本)9781509050468
This paper provides an overview of the generalized problem of optimization of mechanical quencher, considered specific problem - investigated the frequency response of a cylindrical pendulum and quencher mechanical vibrations calculated the resonant frequency quencher and calculation of mechanical parameters quencher for a given resonant frequency. The analytical value used to optimize the mechanical parameters quencher mechanical vibrations.
In this paper, a new multipurpose Lightweight Grid (LWG) system is introduced, under the acronym computational Basic Reprogrammable Adaptive (CoBRA) grid. It provides the functionality grid users require, and offers g...
详细信息
Decompilation is reconstruction of a program in a high-level language from a program in a low-level language. In most cases static decompilation is unable to completely reconstruct high-level data types due to loss of...
详细信息
Decompilation is reconstruction of a program in a high-level language from a program in a low-level language. In most cases static decompilation is unable to completely reconstruct high-level data types due to loss of typing information during compilation. We present several profile-based techniques that help to recover high-level types. The techniques include pointer/integer determination by value profiling and composite type identification by heap profiling.
In the work the mathematical model and method of system analysis for the qualitative and quantitative description of compound systems with random structure is proposed. The proposed scheme of investigation is applied ...
详细信息
This paper presents an algorithm for automatic type reconstruction from target assembly code compiled by a C compiler. The primitive language types are recovered by an iterative algorithm, which operates over the latt...
详细信息
ISBN:
(纸本)9780769534299;0769534295
This paper presents an algorithm for automatic type reconstruction from target assembly code compiled by a C compiler. The primitive language types are recovered by an iterative algorithm, which operates over the lattice of primitive types' properties. Layout of composite types is reconstructed by building set of accessible offsets for each composite type. The algorithm is the essential part of a tool for program decompilation being developed by the authors.
This paper presents a method for automatic reconstruction of polymorphic class hierarchies from the assembly code obtained by compiling a C++ program. If the program is compiled with run-time type information (RTTI), ...
详细信息
This paper presents a method for automatic reconstruction of polymorphic class hierarchies from the assembly code obtained by compiling a C++ program. If the program is compiled with run-time type information (RTTI), class hierarchy is reconstructed via analysis of RTTI structures. In case RTTI structures are missing in the assembly, a technique based on the analysis of virtual function tables, constructors and destructors is used. A tool for automatic reconstruction of polymorphic class hierarchies that implements the described technique is presented. This tool is implemented as a plug in for IDA Pro Interactive Disassembler. Experimental study of the tool is provided.
In the work the system approach to the description of complex and compound systems is proposed. It is based on the synthesis of the classical mathematical modeling approach of coupled processes of different physical n...
详细信息
暂无评论