scholarly journals From Interpreter to Compiler and Virtual Machine: A Functional Derivation

2003 ◽  
Vol 10 (14) ◽  
Author(s):  
Mads Sig Ager ◽  
Dariusz Biernacki ◽  
Olivier Danvy ◽  
Jan Midtgaard
Keyword(s):  
Virtual Machine ◽  
Virtual Machines ◽  
Evaluation Function ◽  
Abstract Machine ◽  
Strong Normalization ◽  
Secd Machine ◽  
Evaluation Functions ◽  
Evaluation Order ◽  
Normalization Function

We show how to derive a compiler and a virtual machine from a compositional interpreter. We first illustrate the derivation with two evaluation functions and two normalization functions. We obtain Krivine's machine, Felleisen et al.'s CEK machine, and a generalization of these machines performing strong normalization, which is new. We observe that several existing compilers and virtual machines--e.g., the Categorical Abstract Machine (CAM), Schmidt's VEC machine, and Leroy's Zinc abstract machine--are already in derived form and we present the corresponding interpreter for the CAM and the VEC machine. We also consider Hannan and Miller's CLS machine and Landin's SECD machine.<br /> <br />We derived Krivine's machine via a call-by-name CPS transformation and the CEK machine via a call-by-value CPS transformation. These two derivations hold both for an evaluation function and for a normalization function. They provide a non-trivial illustration of Reynolds's warning about the evaluation order of a meta-language.

scholarly journals A Rational Deconstruction of Landin's J Operator

2006 ◽  
Vol 13 (17) ◽  
Author(s):  
Olivier Danvy ◽  
Kevin Millikin
Keyword(s):  
Expressive Power ◽  
Functional Languages ◽  
Abstract Machine ◽  
Control Operator ◽  
Syntactic Theory ◽  
Secd Machine ◽  
Evaluation Functions ◽  
Explicit Substitutions ◽  
Control Operators

Landin's J operator was the first control operator for functional languages. It was specified with an extension of the SECD machine, which was the first abstract machine for functional languages. We present a family of compositional evaluation functions corresponding to this extension of the SECD machine, using a series of elementary transformations (transformation into continuation-passing style (CPS) and defunctionalization, chiefly) and their left inverses (transformation into direct style and refunctionalization). To this end, we modernize the SECD machine into a bisimilar one that operates in lock step with the original one but that (1) does not use a data stack and (2) uses the caller-save rather than the callee-save convention for environments. We then characterize the J operator in terms of CPS and in terms of delimited-control operators in the CPS hierarchy. As a byproduct, we also present a reduction semantics for applicative expressions with the J operator, based on Curien's original calculus of explicit substitutions. This reduction semantics mechanically corresponds to the modernized version of the SECD machine and to the best of our knowledge, it provides the first syntactic theory of applicative expressions with the J operator.<br /> <br />The present work is concluded by a motivated wish to see Landin's name added to the list of co-discoverers of continuations. Methodologically, however, it mainly illustrates the value of Reynolds's defunctionalization and of refunctionalization as well as the expressive power of the CPS hierarchy (a) to account for the first control operator and the first abstract machine for functional languages and (b) to connect them to their successors.

scholarly journals A Functional Correspondence between Evaluators and Abstract Machines

2003 ◽  
Vol 10 (13) ◽  
Author(s):  
Mads Sig Ager ◽  
Dariusz Biernacki ◽  
Olivier Danvy ◽  
Jan Midtgaard
Keyword(s):  
Degrees Of Freedom ◽  
Virtual Machines ◽  
Lambda Calculus ◽  
Instruction Set ◽  
Abstract Machine ◽  
Secd Machine ◽  
Abstract Machines ◽  
Closure Conversion

We bridge the gap between functional evaluators and abstract machines for the lambda-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations.<br /> <br />We illustrate this bridge by deriving Krivine's abstract machine from an ordinary call-by-name evaluator and by deriving an ordinary call-by-value evaluator from Felleisen et al.'s CEK machine. The first derivation is strikingly simpler than what can be found in the literature. The second one is new. Together, they show that Krivine's abstract machine and the CEK machine correspond to the call-by-name and call-by-value facets of an ordinary evaluator for the lambda-calculus.<br /> <br /> We then reveal the denotational content of Hannan and Miller's CLS machine and of Landin's SECD machine. We formally compare the corresponding evaluators and we illustrate some relative degrees of freedom in the design spaces of evaluators and of abstract machines for the lambda-calculus with computational effects.<br /> <br />For the purpose of this work, we distinguish between virtual machines, which have an instruction set, and abstract machines, which do not. The Categorical Abstract Machine, for example, has an instruction set, but Krivine's machine, the CEK machine, the CLS machine, and the SECD machine do not; they directly operate on lambda-terms instead. We present the abstract machine that corresponds to the Categorical Abstract Machine.

scholarly journals A Rational Deconstruction of Landin's SECD Machine

2003 ◽  
Vol 10 (33) ◽  
Author(s):  
Olivier Danvy
Keyword(s):  
Programming Languages ◽  
Subsequent Development ◽  
Reconstruction Method ◽  
Evaluation Function ◽  
Program Transformations ◽  
Abstract Machine ◽  
Functional Programming Languages ◽  
Secd Machine ◽  
Abstract Machines ◽  
Environment Control

Landin's SECD machine was the first abstract machine for the lambda-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an idealized implementation, it has set the tone for the subsequent development of abstract machines for functional programming languages. However, and even though variants of the SECD machine have been presented, derived, and invented, the precise rationale for its architecture and modus operandi has remained elusive. In this article, we deconstruct the SECD machine into a lambda-interpreter, i.e., an evaluation function, and we reconstruct lambda-interpreters into a variety of SECD-like machines. The deconstruction and reconstructions are transformational: they are based on equational reasoning and on a combination of simple program transformations--mainly closure conversion, transformation into continuation-passing style, and defunctionalization.<br /> <br />The evaluation function underlying the SECD machine provides a precise rationale for its architecture: it is an environment-based eval-apply evaluator with a callee-save strategy for the environment, a data stack of intermediate results, and a control delimiter. Each of the components of the SECD machine (stack, environment, control, and dump) is therefore rationalized and so are its transitions.<br /> <br />The deconstruction and reconstruction method also applies to other abstract machines and other evaluation functions. It makes it possible to systematically extract the denotational content of an abstract machine in the form of a compositional evaluation function, and the (small-step) operational content of an evaluation function in the form of an abstract machine.

scholarly journals A Lambda-Revelation of the SECD Machine

2002 ◽  
Vol 9 (53) ◽  
Author(s):  
Olivier Danvy
Keyword(s):  
Data Structure ◽  
Lambda Calculus ◽  
The Body ◽  
Abstract Machine ◽  
First Order ◽  
Secd Machine ◽  
Evaluation Functions ◽  
Transition Functions ◽  
Abstract Machines ◽  
Intermediate Results

We present a simple inter-derivation between lambda-interpreters, i.e., evaluation functions for lambda-terms, and abstract reduction machines for the lambda-calculus, i.e., transition functions. The two key derivation steps are the CPS transformation and Reynolds's defunctionalization. By transforming the interpreter into continuation-passing style (CPS), its flow of control is made manifest as a continuation. By defunctionalizing this continuation, the flow of control is materialized as a first-order data structure.<br /> <br />The derivation applies not merely to connect independently known lambda-interpreters and abstract machines, it also applies to construct the abstract machine corresponding to a lambda-interpreter and to construct the lambda-interpreter corresponding to an abstract machine. In this article, we treat in detail the canonical example of Landin's SECD machine and we reveal its denotational content: the meaning of an expression is a partial endo-function from a stack of intermediate results and an environment to a new stack of intermediate results and an environment. The corresponding lambda-interpreter is unconventional because (1) it uses a control delimiter to evaluate the body of each lambda-abstraction and (2) it assumes the environment to be managed in a callee-save fashion instead of in the usual caller-save fashion.

Distance Aware VM allocation process to minimize energy consumption in cloud computing

2019 ◽  
Vol 12 ◽  
Author(s):  
Gurpreet Singh ◽  
Manish Mahajan ◽  
Rajni Mohana
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Energy Consumption ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Research Work ◽  
Service Level Agreement ◽  
Service Level ◽  
Physical Machine ◽  
Allocation Process

BACKGROUND: Cloud computing is considered as an on-demand service resource with the applications towards data center on pay per user basis. For allocating the resources appropriately for the satisfaction of user needs, an effective and reliable resource allocation method is required. Because of the enhanced user demand, the allocation of resources has now considered as a complex and challenging task when a physical machine is overloaded, Virtual Machines share its load by utilizing the physical machine resources. Previous studies lack in energy consumption and time management while keeping the Virtual Machine at the different server in turned on state. AIM AND OBJECTIVE: The main aim of this research work is to propose an effective resource allocation scheme for allocating the Virtual Machine from an ad hoc sub server with Virtual Machines. EXECUTION MODEL: The execution of the research has been carried out into two sections, initially, the location of Virtual Machines and Physical Machine with the server has been taken place and subsequently, the cross-validation of allocation is addressed. For the sorting of Virtual Machines, Modified Best Fit Decreasing algorithm is used and Multi-Machine Job Scheduling is used while the placement process of jobs to an appropriate host. Artificial Neural Network as a classifier, has allocated jobs to the hosts. Measures, viz. Service Level Agreement violation and energy consumption are considered and fruitful results have been obtained with a 37.7 of reduction in energy consumption and 15% improvement in Service Level Agreement violation.

A Defense Mechanism Based on Improved Allocation Strategy of VMs Co-Resident Attack in Power Cloud Platform

2020 ◽  
Vol 13 ◽  
Author(s):  
Yuancheng Li ◽  
Pan Zhang ◽  
Daoxing Li ◽  
Jing Zeng
Keyword(s):  
Virtual Machine ◽  
Simulation Experiment ◽  
Virtual Machines ◽  
Defense Mechanism ◽  
Security Threats ◽  
Allocation Strategy ◽  
Cloud Platform ◽  
Deployment Strategy ◽  
Dbscan Algorithm ◽  
Maximum Minimum

Background: Cloud platform is widely used in electric power field. Virtual machine co-resident attack is one of the major security threats to the existing power cloud platform. Objective: This paper proposes a mechanism to defend virtual machine co-resident attack on power cloud platform. Method: Our defense mechanism uses the DBSCAN algorithm to classify and output the classification results through the random forest and uses improved virtual machine deployment strategy which combines the advantages of random round robin strategy and maximum/minimum resource strategy to deploy virtual machines. Results: we made a simulation experiment on power cloud platform of State Grid and verified the effectiveness of proposed defense deployment strategy. Conclusion: After the virtual machine deployment strategy is improved, the coverage of the virtual machine is remarkably reduced which proves that our defense mechanism achieves some effect of defending the virtual machine from virtual machine co-resident attack.

Evaluation functions for integral mapping

2017 ◽  
Vol 921 (3) ◽  
pp. 24-29 ◽  
Author(s):  
S.I. Lesnykh ◽  
A.K. Cherkashin
Keyword(s):  
Principal Component Analysis ◽  
Environmental Factors ◽  
Principal Components ◽  
Principal Component ◽  
Evaluation Function ◽  
Final Value ◽  
Evaluation Functions ◽  
Geographical Environment ◽  
Environmental Background ◽  
Integral Mapping

The proposed procedure of integral mapping is based on calculation of evaluation functions on the integral indicators (II) taking into account the feature of the local geographical environment, when geosystems in the same states in the different environs have various estimates. Calculation of II is realized with application of a Principal Component Analysis for processing of the forest database, allowing to consider in II the weight of each indicator (attribute). The final value of II is equal to a difference of the first (condition of geosystem) and the second (condition of environmental background) principal components. The evaluation functions are calculated on this value for various problems of integral mapping. The environmental factors of variability is excluded from final value of II, therefore there is an opportunity to find the invariant evaluation function and to determine coefficients of this function. Concepts and functions of the theory of reliability for making the evaluation maps of the hazard of functioning and stability of geosystems are used.

Virtual Machines Scheduling Algorithm Based on Multi-Objective Optimization in Cloud Computing

2014 ◽  
Vol 1046 ◽  
pp. 508-511
Author(s):  
Jian Rong Zhu ◽  
Yi Zhuang ◽  
Jing Li ◽  
Wei Zhu
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Machine Scheduling ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Virtual Machine Scheduling ◽  
Set Up

How to reduce energy consumption while improving utility of datacenter is one of the key technologies in the cloud computing environment. In this paper, we use energy consumption and utility of data center as objective functions to set up a virtual machine scheduling model based on multi-objective optimization VMSA-MOP, and design a virtual machine scheduling algorithm based on NSGA-2 to solve the model. Experimental results show that compared with other virtual machine scheduling algorithms, our algorithm can obtain relatively optimal scheduling results.

scholarly journals Virtual Disks Performance Analysis Using Flexible I/O and Powerstat

2021 ◽  
Vol 9 (10) ◽  
pp. 267-296
Author(s):  
Pritam Patange
Keyword(s):  
Cloud Computing ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Disk File ◽  
Virtual Machine Monitor ◽  
Image File ◽  
File Formats ◽  
Physical Infrastructure ◽  
Disk Image ◽  
The Impact

Abstract: Cloud computing has experienced significant growth in the recent years owing to the various advantages it provides such as 24/7 availability, quick provisioning of resources, easy scalability to name a few. Virtualization is the backbone of cloud computing. Virtual Machines (VMs) are created and executed by a software called Virtual Machine Monitor (VMM) or the hypervisor. It separates compute environments from the actual physical infrastructure. A disk image file representing a single virtual machine is created on the hypervisor’s file system. In this paper, we analysed the runtime performance of multiple different disk image file formats. The analysis comprises of four different parameters of performance namely- bandwidth, latency, input-output operations performed per second (IOPS) and power consumption. The impact of the hypervisor’s block and file sizes is also analysed for the different file formats. The paper aims to act as a reference for the reader in choosing the most appropriate disk file image format for their use case based on the performance comparisons made between different disk image file formats on two different hypervisors – KVM and VirtualBox. Keywords: Virtualization, Virtual disk formats, Cloud computing, fio, KVM, virt-manager, powerstat, VirtualBox.

scholarly journals Virtual Machine Selection Algorithm Based on User Requirements in Mobile Cloud Computing Environment

2018 ◽  
Vol 17 (2) ◽  
pp. 7335-7349
Author(s):  
Rashid Alakbarov
Keyword(s):  
Cloud Computing ◽  
Virtual Machine ◽  
Mobile Cloud Computing ◽  
Virtual Machines ◽  
Mobile User ◽  
Base Stations ◽  
Mobile Cloud ◽  
Software Applications ◽  
Wireless Metropolitan Area Networks ◽  
Cloud Technologies

The article analyzes the advantages of mobile cloud technologies and problems emerging during the use of those. The network infrastructure created based on cloudlets at the second level of mobile cloud computing with hierarchical structure is analyzed. At the same time, the article explores the issues of satisfaction of demand of mobile equipment for computing and memory resources by using these technologies. The article presents one solution for the allocation of mobile user requests in virtual machines created in cloudlets located near base stations of wireless metropolitan area networks (WMAN) in a balanced way by considering the technical capacity of those. Alongside, the article considers the solution of user problem during designated time and the issue of determining virtual machines satisfying other requirements. For this purpose, different characteristics of the stated problem, virtual machines, as well as communication channels between a user and virtual machines are considered. By using possible values determining the importance of cloudlets, conditions for loading software applications of a user to a virtual machine are explored and an appropriate method is proposed.

Sign in / Sign up

Export Citation Format

Share Document