A gridRPC-based environment for grid computing

Cloud computing has become very popular in recent years. Various PaaS systems for collaborative software development and DaaS systems for developing software have been proposed. We also have proposed a PaaS system that delivers both a server-side development and server-side execution environment for character user interface applications that can be executed on the server machine and a server-side development and client-side execution environment for graphical user interface applications that can be executed on the client machine. Our previous system adapted a traditional Web-based interactive interface method that is implemented as internal file access. Therefore, the response time depends on disk access and the system. To improve the response time, we implemented input data flow with instantiation of process management and multithread processing. As a result, the average response time was 4.5 times faster than that for the previous system.

The problems of security computing are becoming increasingly relevant in connection with the integration of systems into a unified global Internet. Elbrus secure computing technology allows protecting the system from the internal program errors as well as external threats. The article describes the hardware and software components of a secure execution environment for critical applications in embedded systems based on computing means of the Elbrus family. The authors describe the basis of the Elbrus secure computing concept - the idea of a descriptor and external tags. They consider the revision of the main parts of the C language library and the kernel of the Linux operating system necessary for the implementation of this environment. The study investigates the issue of passing parameters to system calls from applications running in a secure environment. For such applications, the authors consider the process of dynamic binding of the modules loaded into memory. The method for detecting cases of the use of hung links due to the use of descriptors and external tags is presented in relation to the mechanism of orders and the release of dynamic memory. The authors suggest the container virtualization technology to detect memory leaks in a safe execution environment.

In education, we have noticed a significant gap between the ability of students to program in an educational visual programming environment and the ability to write code in a professional programming environment. The aim of our research was to verify the methodology of transition from visual programming of mobile applications in MIT App Inventor 2 to textual programming in the Android Studio using the Java Bridge tool as a mediator of knowledge transfer. We have examined the extent, to which students will be able to independently program own mobile applications after completing the transition from visual to textual programming using the mediator. To evaluate the performance of students, we have analysed qualitative data from teaching during 1 school year and determined the degree of achievement of educational goals according to Bloom’s taxonomy. The results suggest that students in the secondary education can acquire advanced skills in programming mobile applications in a professional programming environment, when they have knowledge of visual programming in an educational programming environment, and a suitable mediator is used to transfer such knowledge into a new context.

In the context of heterogeneous networks, like clusters of workstations, the design of programming and execution environments aims both to easily express parallelism and distribution of applications, at conception level, and to adapt automatically their execution to fluctuations that may appear in the evolution of applications or in resources availabilities. We present the ADAJ environment (adaptive distributed applications in Java), targeted towards Java applications, which addresses these aims, through conceptual tools offered by the programming environment and through a dynamic load balancing mechanism, integrated at the middleware level. At a conception level, the developer has the possibility of easily activating processing in a MIMD programming model, using library calls. At the execution level, the efficiency of execution in ADAJ exploits an observation mechanism, which allows to acquire information on processing behaviour in order to dynamically redistribute load, by object migrations.

Programming models and environments play the essential roles in high performance computing of enabling the conception, design, implementation and execution of science and engineering application codes. Programmer productivity is strongly influenced by the effectiveness of our programming models and environments, as is software sustainability since our codes have lifespans measured in decades, so the advent of new computing architectures, increased concurrency, concerns for resilience, and the increasing demands for high-fidelity, multi-physics, multi-scale and data-intensive computations mean that we have new challenges to address as part of our fundamental R&D requirements. Fortunately, we also have new tools and environments that make design, prototyping and delivery of new programming models easier than ever. The combination of new and challenging requirements and new, powerful toolsets enables significant synergies for the next generation of programming models and environments R&D. This report presents the topics discussed and results from the 2014 DOE Office of Science Advanced Scientific Computing Research (ASCR) Programming Models & Environments Summit, and subsequent discussions among the summit participants and contributors to topics in this report.

In ubiquitous stub network, it is a critical challenge to realize resource discovery and share under disconnected network topology. In this paper, a cluster-based resource discovery mechanism is proposed with resource registration, distribution and routing model. Firstly, we use resource directory index nodes to assist in resource management. Secondly, we use inter-cluster mobile terminals to support resource routing. In addition, we take the nodes contact probability into account and establish the minimum expectation delay routing standard to opportunistically route between terminals. At last, the simulation result shows this mechanism is better applied to support disconnected ubiquitous resource discovery.

Resource discovery in disconnected delay-tolerant mobile social networks (MSNs) continues to be a challenging issue. Nowadays, the resource discovery mechanisms for MSNs are classified into three categories: social connectivity-based, movement pattern-based and content similarity-based resource discovery mechanisms. The first two categories have some advantages, such as low transmission delay and management overhead, the deficiency of the two mechanisms is that the poorer searching efficiency without considering the content similarity. The third category facilitates the higher searching efficiency. Yet, it leads to higher traffic cost due to not considering the physical location information of nodes. Furthermore, the current methods are designed in Cartesian coordinates, which is not suitable for real physical network environments. In this paper, we propose a novel resource discovery mechanism in 3-dimensional Cartesian coordinate system. Our scheme fully utilizes the content similarity, the movement pattern and the location awareness to achieve the higher searching efficiency and reduce the system overhead for MSNs. We simulated our method on the platform of the opportunistic network environment simulator. Simulations results show that our proposed scheme outperforms the state-of-the-art resource discovery schemes in terms of the searching efficiency and the average delay.

Highly predictable execution support for critical applications with HARETICK kernel

Web services run in a highly dynamic environment (the Internet) which makes the composite service will face multiple exceptions in its execution. Thus, it needs to take effective actions to deal with the errors causing the exceptions. Then, by such actions, composite service can adapt to the dynamics and complexity of its execution environment. Since accurately identifying the error source which causes the exception is important, the problem of diagnosis for composite service becomes one of the key issues in the adaptive service composition. This paper proposes an approach for diagnosing composite service based on error propagation degree. After analyzing the error propagation relation between the services, the uncertain casual relation between the exception and the service is formed by the way of computing the error propagation degree. And then the diagnosis algorithm which is based on the error dependent matrix is established. The diagnosis can be achieved by fuzzy reasoning. This approach can preserve the efficiency and accuracy of the diagnosis for composite service under the uncertain environment by the computation of the error propagation degree and fuzzy reasoning, which can support the self-adaptation of the composite service effectively.

The design of a comprehensive neurocomputing system is discussed. This system comprises two distinct neural network environments: programming and execution. The programming environment is Pygmalion. An execution environment is proposed that extends Pygmalion by providing a range of target hardware, from conventional machines to parallel neurocomputers and specialized chips generated by silicon compilation. The authors present their view of the neurocomputing system in three stages. First, they describe the Pygmalion programming environment, then the integrated system, and finally the neurocomputer architecture. They discuss the design of neural chips for the neurocomputer, introducing their basic architectures and presenting the system's silicon compiler. >

The Smalltalk-80 system is an interactive graphical programming and applications environment. In the system the language, graphical display, editors, programming tools, operating system features, and application programs are integrated by treating each in a consistent object-oriented manner. The object-orientation of the Smalltalk-80 language, in which all information structure is in the form of objects and all processing is in the form of message-sending, greatly facilitates this consistency of the system.

Grid is the next generation information infrastructure of Internet and software running support platform. At present, there are many resource discovery mechanisms in Grid, which can find probably useful resources, including software component. Furthermore, this paper solves the problem of searching trusty component by providing a trust evaluation and component selection mechanism. The simulation experiment denotes the mechanism is rational, valid and reliable.

Harmonic Control: A Symbolic Language Aided Engineering Control Program

The requirement of semantic technology has been augmented day by day in IT related applications due to various features including interoperability. Effective development and organization of semantic knowledge are essential for maximum throughput in any application. We extend and develop two sub-domain computer resource ontologies and utilize them in a resource discovery process of a Grid computing environment to reduce the job rejection rate. Grid computing aggregates distributed computing resources to execute computationally complex jobs. The selection of resources in a Grid system involves finding and locating resources based on users' requirements. Identifying an appropriate resource selection mechanism for Grid jobs is a major concern because overall performance of a Grid depends on it and it also helps to schedule and allocate resources. We compute semantic similarity threshold values and employ both extended ontolgies in a decentralized resource discovery model of Grid Computing. The simulation is carried out using GridSim and PlanetSim to evaluate the effectiveness of a semantic resource discovery model. The results show improved success probability for complex jobs and reduce communication overheads compared to the non semantic resource discovery model.

This paper presents the design and implementation of an integrated application program called ArcFVS that links the Forest Vegetation Simulator (FVS) and a Geographic Information System (GIS) to realize spatial selection of input files and graphic display of modeling output. Data for testing and running the model came from the U.S. Forest Service’s Forest Inventory and Analysis (FIA) Database and were also collected in field surveys in north-central Indiana. ArcFVS 1.0 is designed using the ArcGIS software from the Environmental Systems Research Institute (ESRI) and the Visual Basic for Applications (VBA) programming environment to manipulate ESRI’s ArcObjects. The resulting product offers custom functions as commands in a new menu or as tools on a new toolbar. They are used to: select spatially or by attribute the forest plots to be projected by FVS, create the FVS input files for the selected plots and display in a geospatial environment different types of FVS output (text output files, tables with variables of interest and visualization image files). Advantages of ArcFVS 1.0 include the new GIS capabilities, enhanced format translation functions and the standardized programming environment.