TITLE

Optimization methods of parallel execution of numerical programs in the LuNA fragmented programming system

AUTHOR(S)
Malyshkin, Victor; Perepelkin, Vladislav
PUB. DATE
July 2012
SOURCE
Journal of Supercomputing;Jul2012, Vol. 61 Issue 1, p235
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The organization of high-performance execution of a fragmented program has encountered with the problem of choosing of an acceptable way of its execution. The potentialities of optimizing the execution at the stages of fragmented program development, compilation and execution are considered. The methods and algorithms of such an optimization are proposed to be included into the LuNA fragmented programming language, compiler, generator and run-time system.
ACCESSION #
76373455

 

Related Articles

  • The Seven Sins of Perl OO Programming. Chromatic // Perl Review;Winter2005, Vol. 2 Issue 1, p10 

    The article presents information on several sins Perl OO coders occasionally commit. It states that some coders use the methods isa () and can () as if they were functions. Meanwhile, others copy and paste a test code in their test suite and then change it. The author says that there are good...

  • The Definition Mechanism for Standard PL/I. Marcotty, Michael; Sayward, Frederick G. // IEEE Transactions on Software Engineering;Nov77, Vol. 3 Issue 6, p416 

    The mechanism used to define the programming language PL/I in the recently adopted American National Standard is presented. This method provides a rigorous though semiformal specification of the language. If uses the model of translation of programs into an abstract form to define the...

  • Data Grows No Moss. Yager, Tom // InfoWorld;9/26/2005, Vol. 27 Issue 39, p20 

    Comments on the efforts of programming language architect Anders Hejlsberg to remodel language-integrated query (LINQ). Benefit of LINQ to commercial developers; Function of LINQ; Core to the design of LINQ.

  • College Program Designing Course Based on Computational Thinking. Yizhen Liu; Yanming Wang; Zhanwen Liu // Applied Mechanics & Materials;2014, Issue 556-562, p6527 

    The development of computational thinking ability is an important part of college computer education domestically and overseas. It is a new direction and goal of college computer language teaching reform and construction. Based on computational thinking combined with teaching experience, this...

  • Testing for refinement in Circus. Cavalcanti, Ana; Gaudel, Marie-Claude // Acta Informatica;Mar2011, Vol. 48 Issue 2, p97 

    Circus combines constructs to define complex data operations and interactions; it integrates Z and CSP, and, distinctively, it is a language for refinement that can describe programs as well as specification and design models. The semantics is based on the unifying theories of programming (UTP)....

  • Create CAPTCHAs in PHP. Nixon, Robin // APC (Bauer Media Group);Apr2008, Vol. 28 Issue 4, p110 

    The article offers suggestions on how one should create CAPTCHAs in computer program language. Various techniques have evolved to try and separate bots from humans, such as asking a simple question that only a person would be able to understand and give the answer to. But by using the CAPTCHA...

  • Application of advanced programming concepts in metamodelling. Berg, Henning; Møller.-Pedersen, Birger; Krogdahl, Stein // Norsk Informatikkonferanse;2011, Issue 21-23, p207 

    Programming languages provide users with a rich palette of advanced mechanisms. Languages for metamodelling, on the other hand, usually provide simple mechanisms for making class models, i.e. classes with relations like specialisation, composition and associations. A metamodel defines the syntax...

  • Enhancing Functional and Irregular Parallelism: Stateful Functions and their Semantics. Attali, Isabelle; Caromel, Denis; Chen, Yung-Syau; Gaudiot, Jean-Luc; Wendelborn, Andrew L. // International Journal of Parallel Programming;Aug2001, Vol. 29 Issue 4, p433 

    We describe an approach in which stateful computations can be expressed within the framework of a functional language. We consider algorithms with nondeterministic intermediate results and a deterministic final result which is obtained for any series of intermediate values of some variable...

  • Derived types in semantic association discovery. J�msen, Janne; Niemi, Timo; J�rvelin, Kalervo // Journal of Intelligent Information Systems;Oct2010, Vol. 35 Issue 2, p213 

    Semantic associations are direct or indirect linkages between two entities that are construed from existing associations among entities. In this paper we extend our previous query language approach for discovering semantic associations with an ability to retrieve semantic associations that,...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics