Optimization of Parallel Execution of Numerical Programs in LuNA Fragmented Programming System

2010 ◽  
pp. 1-10 ◽  
Author(s):  
Victor Malyshkin ◽  
Vladislav Perepelkin
Keyword(s):  
Parallel Execution ◽  
Programming System

scholarly journals Towards Automatic Deductive Verification of C Programs with Sisal Loops Using the C-lightVer System

2021 ◽  
Vol 28 (4) ◽  
pp. 372-393
Author(s):  
Dmitry A. Kondratyev
Keyword(s):  
Automatic Parallelization ◽  
Parallel Execution ◽  
Programming System ◽  
Inference Rules ◽  
Deductive Verification ◽  
Recursive Functions ◽  
Axiomatic Semantics ◽  
Verification Conditions ◽  
Symbolic Method ◽  
Verification Condition

The C-lightVer system is developed in IIS SB RAS for C-program deductive verification. C-kernel is an intermediate verification language in this system. Cloud parallel programming system (CPPS) is also developed in IIS SB RAS. Cloud Sisal is an input language of CPPS. The main feature of CPPS is implicit parallel execution based on automatic parallelization of Cloud Sisal loops. Cloud-Sisal-kernel is an intermediate verification language in the CPPS system. Our goal is automatic parallelization of such a superset of C that allows implementing automatic verification. Our solution is such a superset of C-kernel as C-Sisal-kernel. The first result presented in this paper is an extension of C-kernel by Cloud-Sisal-kernel loops. We have obtained the C-Sisal-kernel language. The second result is an extension of C-kernel axiomatic semantics by inference rule for Cloud-Sisal-kernel loops. The paper also presents our approach to the problem of deductive verification automation in the case of finite iterations over data structures. This kind of loops is referred to as definite iterations. Our solution is a composition of symbolic method of verification of definite iterations, verification condition metageneration and mixed axiomatic semantics method. Symbolic method of verification of definite iterations allows defining inference rules for these loops without invariants. Symbolic replacement of definite iterations by recursive functions is the base of this method. Obtained verification conditions with applications of recursive functions correspond to logical base of ACL2 prover. We use ACL2 system based on computable recursive functions. Verification condition metageneration allows simplifying implementation of new inference rules in a verification system. The use of mixed axiomatic semantics results to simpler verification conditions in some cases.

FUNCTIONAL COORDINATION OF METHODS OF ORGANIZATION OF ADAPTIVE DATA COLLECTION PROCESSES AND METHODS OF SPATIAL SELF-ORGANIZATION OF MOBILE AGENTS

2017 ◽  
Vol 2 (1) ◽  
pp. 27-32
Author(s):  
Botchkaryov. A. ◽  
Keyword(s):  
Data Collection ◽  
Key Words ◽  
Motion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Parallel Execution ◽  
Self Organization ◽  
Data Collection Process ◽  
Speed Up ◽  
Adaptive Data Collection

The way of functional coordination of methods of organization adaptive data collection processes and methods of spatial self-organization of mobile agents by parallel execution of the corresponding data collection processes and the process of motion control of a mobile agent using the proposed protocol of their interaction and the algorithm of parallel execution planning is proposed. The method allows to speed up the calculations in the decision block of the mobile agent by an average of 40.6%. Key words: functional coordination, adaptive data collection process, spatial self-organization, mobile agents

The Design of General Off-Line Graphical Robot Programming System

2017 ◽  
Vol 9 (4) ◽  
pp. 343-352
Author(s):  
Zheng Zhang ◽  
Yonggang Peng ◽  
Yuhui Li
Keyword(s):  
Robot Programming ◽  
Programming System

Scale Evaluation and Eligibility Determination of a Field-Test Version of the Assessment, Evaluation, and Programming System Third Edition

2021 ◽  
pp. 027112142098171
Author(s):  
Michael D. Toland ◽  
Jennifer Grisham ◽  
Misti Waddell ◽  
Rebecca Crawford ◽  
David M. Dueber
Keyword(s):  
Field Test ◽  
Programming System ◽  
Eligibility Determination ◽  
Fit Statistics ◽  
Reliability Estimates ◽  
Test Version ◽  
Acceptable Model ◽  
Cutoff Scores ◽  
Area Classification

Rasch and classification analyses on a field-test version of the Assessment, Evaluation, and Programming System Test—Third Edition (AEPS-3), a curriculum-based assessment used to assess young children birth to age 6 years, were conducted. First, an evaluation of the psychometric properties of data from each developmental area of an AEPS-3 field-test version was conducted. Next, cutoff scores at 6-month age intervals were created and then the validity of the cutoff scores was evaluated. Results using Rasch modeling indicated acceptable model fit statistics with reasonable reliability estimates within each developmental area. Classification results showed cutoff scores accurately classified a high percentage of eligible children. Findings suggest that scores from a field-test version of the AEPS-3 are reliable within developmental areas. To the extent allowed by state criteria, early childhood interventionists could possibly use a new field-test version of the AEPS-3 to determine or corroborate eligibility for special education services.

scholarly journals New general mixed-integer linear programming model for mobile workforce management

2021 ◽  
Author(s):  
András Éles ◽  
István Heckl ◽  
Heriberto Cabezas
Keyword(s):  
Programming Model ◽  
Time Windows ◽  
Mutual Exclusion ◽  
Parallel Execution ◽  
Mixed Integer ◽  
Management Problem ◽  
Routing Problem ◽  
Workforce Management ◽  
Computational Performance ◽  
Wide Range

AbstractA mathematical model is introduced to solve a mobile workforce management problem. In such a problem there are a number of tasks to be executed at different locations by various teams. For example, when an electricity utility company has to deal with planned system upgrades and damages caused by storms. The aim is to determine the schedule of the teams in such a way that the overall cost is minimal. The mobile workforce management problem involves scheduling. The following questions should be answered: when to perform a task, how to route vehicles—the vehicle routing problem—and the order the sites should be visited and by which teams. These problems are already complex in themselves. This paper proposes an integrated mathematical programming model formulation, which, by the assignment of its binary variables, can be easily included in heuristic algorithmic frameworks. In the problem specification, a wide range of parameters can be set. This includes absolute and expected time windows for tasks, packing and unpacking in case of team movement, resource utilization, relations between tasks such as precedence, mutual exclusion or parallel execution, and team-dependent travelling and execution times and costs. To make the model able to solve larger problems, an algorithmic framework is also implemented which can be used to find heuristic solutions in acceptable time. This latter solution method can be used as an alternative. Computational performance is examined through a series of test cases in which the most important factors are scaled.

Extensions of Elementary Cause-Effect Structures

2021 ◽  
Vol 179 (2) ◽  
pp. 93-111
Author(s):  
Ludwik Czaja
Keyword(s):  
Characteristic Feature ◽  
Petri Nets ◽  
Algebraic System ◽  
Formal System ◽  
Parallel Execution

Cause-effect structures are objects of a formal system devised for modeling, testing and verifying properties of tasks, where parallel execution of actions is the most characteristic feature. This is an algebraic system called a quasi-semiring. In this paper elementary cause-effect structures, a system behaviourally equivalent to 1-safe Petri nets, are extended by the following features: weighted edges, multi-valued nodes having capacities (counterpart of place/transition Petri nets), inhibitors and a model of time. The extensions are accomplished by modifying the notion of state and semantics, but leaving unchanged structure of the quasi-semiring expressions.

Sign in / Sign up

Export Citation Format

Share Document