scholarly journals UML profile for specifying user interfaces of business applications

2011 ◽  
Vol 8 (2) ◽  
pp. 405-426 ◽  
Author(s):  
Branko Perisic ◽  
Gordana Milosavljevic ◽  
Igor Dejanovic ◽  
Branko Milosavljevic
Keyword(s):  
User Interfaces ◽  
Code Generation ◽  
General Purpose ◽  
Coarse Grained ◽  
Domain Specific Language ◽  
Uml Profile ◽  
Domain Specific ◽  
Business Applications ◽  
Uml Modeling ◽  
Uml Extension

This paper presents an approach to automatic user interface code generation that is based on an internal HCI standard that defines layout and behaviour of coarse-grained objects for enterprise business applications. A domain-specific language (in the form of a UML profile) based on the concepts introduced by the HCI standard facilitates efficient modeling and generation of fully-functional UIs. Being a regular UML extension, this language can be used in any general-purpose UML modeling tool and can easily be integrated with other UML-based models of the application.

scholarly journals Comparing general-purpose and domain-specific languages: An empirical study

2010 ◽  
Vol 7 (2) ◽  
pp. 247-264 ◽  
Author(s):  
Tomaz Kosar ◽  
Nuno Oliveira ◽  
Marjan Mernik ◽  
Varanda Pereira ◽  
Matej Crepinsek ◽  
...  
Keyword(s):  
User Interfaces ◽  
General Purpose ◽  
Domain Specific Language ◽  
Problem Domain ◽  
Domain Specific Languages ◽  
Cognitive Dimension ◽  
Specific Language ◽  
Domain Specific ◽  
Implementation Approach ◽  
Open Issue

Many domain-specific languages, that try to bring feasible alternatives for existing solutions while simplifying programming work, have come up in recent years. Although, these little languages seem to be easy to use, there is an open issue whether they bring advantages in comparison to the application libraries, which are the most commonly used implementation approach. In this work, we present an experiment, which was carried out to compare such a domain-specific language with a comparable application library. The experiment was conducted with 36 programmers, who have answered a questionnaire on both implementation approaches. The questionnaire is more than 100 pages long. For a domain-specific language and the application library, the same problem domain has been used - construction of graphical user interfaces. In terms of a domain-specific language, XAML has been used and C# Forms for the application library. A cognitive dimension framework has been used for a comparison between XAML and C# Forms.

Code Refinement of Stencil Codes

2014 ◽  
Vol 24 (03) ◽  
pp. 1441003 ◽  
Author(s):  
Marcel Köster ◽  
Roland Leißa ◽  
Sebastian Hack ◽  
Richard Membarth ◽  
Philipp Slusallek
Keyword(s):  
Programming Language ◽  
General Purpose ◽  
Peak Performance ◽  
Domain Specific Language ◽  
Competitive Performance ◽  
Specific Language ◽  
Popular Method ◽  
Domain Specific ◽  
Stencil Codes ◽  
Target Platform

A straightforward implementation of an algorithm in a general-purpose programming language does usually not deliver peak performance: Compilers often fail to automatically tune the code for certain hardware peculiarities like memory hierarchy or vector execution units. Manually tuning the code is firstly error-prone as well as time-consuming and secondly taints the code by exposing those peculiarities to the implementation. A popular method to avoid these problems is to implement the algorithm in a Domain-Specific Language (DSL). A DSL compiler can then automatically tune the code for the target platform. In this article we show how to embed a DSL for stencil codes in another language. In contrast to prior approaches we only use a single language for this task which offers explicit control over code refinement. This is used to specialize stencils for particular scenarios. Our results show that our specialized programs achieve competitive performance compared to hand-tuned CUDA programs while maintaining a convenient coding experience.

scholarly journals Development in Vulkan: a domain-specific approach

2021 ◽  
Vol 33 (5) ◽  
pp. 181-204
Author(s):  
Vladimir Frolov ◽  
Vadim Sanzharov ◽  
Vladimir Galaktionov ◽  
Alexander Shcherbakov
Keyword(s):  
Image Processing ◽  
Ray Tracing ◽  
Code Generation ◽  
Source Code ◽  
General Purpose ◽  
Software Systems ◽  
Specific Class ◽  
Domain Specific ◽  
Architectural Patterns ◽  
C Program

In this paper we propose a high-level approach to developing GPU applications based on the Vulkan API. The purpose of the work is to reduce the complexity of developing and debugging applications that implement complex algorithms on the GPU using Vulkan. The proposed approach uses the technology of code generation by translating a C++ program into an optimized implementation in Vulkan, which includes automatic shader generation, resource binding, and the use of synchronization mechanisms (Vulkan barriers). The proposed solution is not a general-purpose programming technology, but specializes in specific tasks. At the same time, it has extensibility, which allows to adapt the solution to new problems. For single input C++ program, we can generate several implementations for different cases (via translator options) or different hardware. For example, a call to virtual functions can be implemented either through a switch construct in a kernel, or through sorting threads and an indirect dispatching via different kernels, or through the so-called callable shaders in Vulkan. Instead of creating a universal programming technology for building various software systems, we offer an extensible technology that can be customized for a specific class of applications. Unlike, for example, Halide, we do not use a domain-specific language, and the necessary knowledge is extracted from ordinary C++ code. Therefore, we do not extend with any new language constructs or directives and the input source code is assumed to be normal C++ source code (albeit with some restrictions) that can be compiled by any C++ compiler. We use pattern matching to find specific patterns (or patterns) in C++ code and convert them to GPU efficient code using Vulkan. Pattern are expressed through classes, member functions, and the relationship between them. Thus, the proposed technology makes it possible to ensure a cross-platform solution by generating different implementations of the same algorithm for different GPUs. At the same time, due to this, it allows you to provide access to specific hardware functionality required in computer graphics applications. Patterns are divided into architectural and algorithmic. The architectural pattern defines the domain and behavior of the translator as a whole (for example, image processing, ray tracing, neural networks, computational fluid dynamics and etc.). Algorithmic pattern express knowledge of data flow and control and define a narrower class of algorithms that can be efficiently implemented in hardware. Algorithmic patterns can occur within architectural patterns. For example, parallel reduction, compaction (parallel append), sorting, prefix sum, histogram calculation, map-reduce, etc. The proposed generator works on the principle of code morphing. The essence of this approach is that, having a certain class in the program and transformation rules, one can automatically generate another class with the desired properties (for example, the implementation of the algorithm on the GPU). The generated class inherits from the input class and thus has access to all data and functions of the input class. Overriding virtual functions in generated class helps user to carefully connect generated code to the other Vulkan code written by hand. Shaders can be generated in two variants: OpenCL shaders for google “clspv” compiler and GLSL shaders for an arbitrary GLSL compiler. Clspv variant is better for code which intensively uses pointers and the GLSL generator is better if specific HW features are used (like hardware ray tracing acceleration). We have demonstrated our technology on several examples related to image processing and ray tracing on which we get 30-100 times acceleration over multithreaded CPU implementation.

scholarly journals Application of the CHARM++ software model as a target platform for a domain-specific language compiler for the analysis of static graphs

2017 ◽  
pp. 103-114
Author(s):  
А.С. Фролов
Keyword(s):  
Code Generation ◽  
Programming Model ◽  
Graph Representation ◽  
Connected Components ◽  
Domain Specific Language ◽  
Specific Language ◽  
Domain Specific ◽  
Software Model ◽  
Execution Model ◽  
Target Platform

Представлена реализация модуля генерации параллельного программного кода на Charm++ в компиляторе проблемно-ориентированного языка программирования Green-Marl, предназначенного для разработки параллельных алгоритмов анализа статических графов. Приводится описание представления графа в генерируемом коде и способов отображения основных конструкций языка Green-Marl в параллельный код на Charm++. Проведенное оценочное тестирование с использованием типовых графовых задач (поиск кратчайших путей от заданной вершины до остальных вершин графа (SSSP), поиск связных компонент (CC) и вычисление рангов вершин с использованием алгоритма PageRank) показало, что производительность программ на Green-Marl, странслированных в Charm++, находится на одном уровне с реализациями на Charm++, разработанными вручную. The implementation of a code generation mechanism in the domain-specific language (DSL) Green-Marl compiler targeted in the Charm++ framework is presented. Green-Marl is used for the parallel static graph analysis and adopts an imperative shared memory programming model, whereas Charm++ implements a message-driven execution model. The graph representation in the generated Charm++ code and the translation of the basic Green-Marl constructs to Charm++ are described. The evaluation of the typical graph algorithms: Single-Source Shortest Path (SSSP), Connected Components (CC), and PageRank shows that the performance of Green-Marl programs translated to Charm++ is the same as for native Charm++ implementations.

scholarly journals Using Affiliation Rules-based Data Mining Technique in Referral System

2020 ◽  
pp. 3084-3092
Author(s):  
Tola John Odule ◽  
Ademola Olusola Adesina ◽  
Adebisi Khadijat-Kubrat Abdullah ◽  
Peter Ibikunle Ogunyinka
Keyword(s):  
Architectural Design ◽  
Dimensional Space ◽  
Motion Pictures ◽  
General Purpose ◽  
Two Dimensional ◽  
Data Mining Technique ◽  
Domain Specific ◽  
Mining Technique ◽  
Business Applications ◽  
Internet Business

Referral techniques are normally employed in internet business applications. Existing frameworks prescribe things to a particular client according to client inclinations and former high evaluations. Quite a number of methods, such as cooperative filtering and content-based methodologies, dominate the architectural design of referral frameworks. Many referral schemes are domain-specific and cannot be deployed in a general-purpose setting. This study proposes a two-dimensional (User × Item)-space multimode referral scheme, having an enormous client base but few articles on offer. Additionally, the design of the referral scheme is anchored on the  and  articles, as expressed by a particular client, and is a combination of affiliation rules mining and the content-based method. The experiments used the dataset of MovieLens, consisting of 100,000 motion pictures appraisals on a size of 1-5, from 943 clients on 1,682 motion pictures. It utilised a five-overlap cross appraisal on a (User × Item)-rating matrix with 12 articles evaluated by a minimum of 320 clients. A total of 16 rules were generated for both  and  articles, at 35% minimum support and 80% confidence for the  articles and 50% similitude for the . Experimental results showed that the anticipated appraisals in denary give a better rating than other measures of exactness. In conclusion, the proposed algorithm works well and fits on two dimensional -space with articles that are significantly fewer than users, thus making it applicable and effective in a variety of uses and scenarios as a general-purpose utility.

Model-Driven Engineering of Composite Service Oriented Applications

2011 ◽  
Vol 4 (1) ◽  
pp. 23-37
Author(s):  
Bill Karakostas ◽  
Yannis Zorgios
Keyword(s):  
User Interfaces ◽  
Code Generation ◽  
Business Processes ◽  
Composite Service ◽  
Model Driven ◽  
Business Applications ◽  
Data User ◽  
Technology Heterogeneity ◽  
Service Oriented ◽  
High Level

Composite applications integrate web services with other business applications and components to implement business processes. Model-driven approaches tackle the complexity of composite applications caused by domain and technology heterogeneity and integration requirements. The method and framework described in this paper generate all artefacts (workflow, data, user interfaces, etc.), required for a composite application from high level service oriented descriptions of the composite application, using model transformation and code generation techniques.

MUIT: A Domain-Specific Language and its Middleware for Adaptive Mobile Web-Based User Interfaces in WS-BPEL

2019 ◽  
Vol 12 (6) ◽  
pp. 955-969 ◽  
Author(s):  
Xuazhe Liu ◽  
Mengwei Xu ◽  
Teng Teng ◽  
Gang Huang ◽  
Hong Mei
Keyword(s):  
User Interfaces ◽  
Domain Specific Language ◽  
Web Based ◽  
Mobile Web ◽  
Specific Language ◽  
Domain Specific
Sign in / Sign up

Export Citation Format

Share Document