JASAG: a gridification tool for agricultural simulation applications

The Grid Computing paradigm aims to create a ‘virtual’ and powerful single computer with many distributed resources to solve resource intensive problems. The term ‘gridification’ involves the process of transforming a conventional application to run in a Grid environment. In that sense, the more automatic this process is, the easier is for developers with low expertise in parallel and distributed computing to take advantage of these resources. To date, many semiautomatic gridifiers were built to support different gridification approaches and application code structures or anatomies. Furthermore, agricultural simulation applications have a particular common anatomy based on biophysical entities, such as animals, crops, and pastures, which are updated by actions, such as growing animals, growing crops, and growing pastures, along simulation execution. However, this anatomy is not fully supported by any of the existing gridifiers. Thus, this paper presents Agricultural Simulation Applications Gridifier (ASAG), a method for easy gridification of agricultural simulation applications, and its Java implementation, named Java ASAG (JASAG). The main design drivers of JASAG are middleware independence, separation of business logic and Grid behavior, and performance increase. An experimental evaluation showing the feasibility of the gridification method and its implementation is also reported, which resulted in speedups of up to 25 by using a real agricultural simulation application. Copyright © 2014 John Wiley & Sons, Ltd.     

关于支持发育计算的网程结构的若干注记

比较了生物学中的细胞、操作系统中的进程和织女星网格的网程，传统的操作系统进程对应于低等生物(如细菌)中的细胞，为了支持人机社会和网格的动态、开放特征，更有效地应对复杂性，网格应该学习更高级的生物体，提供增殖、分化和选择功能，这意味着两种新的计算模式：发育计算和自然计算，这两种模式都能够提升网格系统的自主性，有利于实现自主计算，从计算机操作系统角度分析细胞的创建过程，指出进程与细胞的差距，从而提出发育计算的思想，以及支持发育计算所需要的网程结构。     

Aqueous Computing: A Survey with an Invitation to Participate

The concept of aqueous computing is presented here,first infull generality,and afterward,using an implementation in a specific enzymatic technology.Aqueous computing arose in the context of biomoloecular (DNA) computing,but the concept is independent of the specifics of its biochemical origin.Alternate technologies for realizing aqueous computing are being considered for future implementation.A solution of an instance of the Boolean satisfiability problem,(SAT),is reported here that provides a new example of an aqueous computation that has been carried out successfully.This small instance of the SAT problem is sufficiently complex to allow our current enzymatic technology to be illustrated in detail.The reader is invited to participate in the rich interdisciplinary activity required by wet lab computing.A project is suggested to the reader for determining the three-colorings of a graph.The basic operations required for this project are exhibited in the solution of the SAT example reported here.     

A Survey on Wireless Grid Computing

Wireless Grid computing extends the traditional Grid computing paradigm to include a diverse collection of mobile devices enabled to communicate using radio frequency, infrared, optical and other wireless mechanisms. Among the devices coming into use in wireless grid implementations are tiny sensors, Radio Frequency Identification tags (RFID). Personal Digital Assistants (PDAs) and paging devices, cellular phones, hand-held or wearable computers, laptop computers and special purpose computers embedded into many modern appliances [8, 26, 29]. Though many of these devices were initially developed to serve a specific, autonomous purpose, their potential for cooperation through the sharing of resources and capabilities, and the massive amounts of resources available due to their numbers, is quickly leading to applications resembling traditional Grid computing. This paper presents a survey of the current state of wireless grid computing. This includes a discussion of the cooperation between wired and wireless grids including ways in which wireless grids extend the capabilities of existing wired grids. It also discusses many of the new capabilities and resources available to wireless grid devices and a sampling of several applications of these new resources. It provides a sampling of many current research endeavors in the wireless grid arena and an examination of a number of the potential challenges resulting from the unique characteristics of wireless grid devices.     

一种构造自愿计算网络的新方法

虽然Peer-to-Peer结构的可扩展性已经成为普遍的共识,但如何简单、有效地构造具有良好特性的P2P计算网络仍然是一个开放问题。本文提出了一个自组织的Peer-to-Peer重叠计算网络的构造方法以及基于该网络的计算任务调度算法。仿真结果说明,本文构造的计算网络表现出明显的自组织特性,具有较好的可扩展性和自组织能力,能较好地为计算资源的调度提供支持。     

A survey of mathematical models,simulation approaches and testbeds used for research in cloud computing

The first hurdle for carrying out research on cloud computing is the development of a suitable research platform. While cloud computing is primarily commercially-driven and commercial clouds are naturally realistic as research platforms, they do not provide to the scientist enough control for dependable experiments. On the other hand, research carried out using simulation, mathematical modelling or small prototypes may not necessarily be applicable in real clouds of larger scale. Previous surveys on cloud performance and energy-efficiency have focused on the technical mechanisms proposed to address these issues. Researchers of various disciplines and expertise can use them to identify areas where they can contribute with innovative technical solutions. This paper is meant to be complementary to these surveys. By providing the landscape of research platforms for cloud systems, our aim is to help researchers identify a suitable approach for modelling, simulation or prototype implementation on which they can develop and evaluate their technical solutions.     

网格技术及其在远程教学中的应用

介绍了网格的概念、体系结构和各层功能特点,并对网格计算的应用和目前所存在的问题做了分析,提出了教育网格系统的构成。     

无服务器计算技术研究综述

随着云计算的发展以及传统行业的转型,不断提高的技术要求与日益旺盛的市场需求使传统的应用软件开发模式面临挑战。同时,人们正在探索新一代的更经济、更有潜力的云服务模式。无服务器计算依托容器技术,提供了高并发、高兼容的特性,为开发者隐藏了底层服务器的细节,同时采取了更经济的按调用次数或时间计费的服务运营模式,引起了广泛的关注。首先,介绍无服务器计算的概念,并介绍其系统架构与技术特性。然后,介绍无服务器计算在科研、开源社区与工业届的研究现状。随后,列举无服务器计算在众多应用领域的实施案例。最后,阐述无服务器计算技术当前面临的挑战。     

Puzzle: A mobile application development environment using a jigsaw metaphor

ObjectiveCreate a visual mobile end user development framework, named Puzzle, which allows end users without IT background to create, modify and execute applications, and provides support for interaction with smart things, phone functions and web services.MethodsDesign of an intuitive visual metaphor and associated interaction techniques for supporting end user development in mobile devices with iterative empirical validation.ResultsOur results show that the jigsaw is an intuitive metaphor for development in a mobile environment and our interaction techniques required a limited cognitive effort to use and learn the framework. Integration of different modalities and usage of smart things was relevant for users.ConclusionPuzzle has addressed the main objective. The framework further contributes to the research on mobile end user development in order to create an incentive for users to go beyond consuming content and applications to start creating their own applications.PracticeUsage of a mobile end user development environment has the potential to create a shift from the conventional few-to-many distribution model of software to a many-to-many distribution model. Users will be able to create applications that fit their requirements and share their achievements with peers.ImplicationsThis study has indicated that the Puzzle visual environment has the potential to enable users to easily create applications and stimulate exploration of innovative scenarios through smartphones.     

A survey of approaches to automatic schema matching

Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous research papers have proposed many techniques to achieve a partial automation of the match operation for specific application domains. We present a taxonomy that covers many of these existing approaches, and we describe the approaches in some detail. In particular, we distinguish between schema-level and instance-level, element-level and structure-level, and language-based and constraint-based matchers. Based on our classification we review some previous match implementations thereby indicating which part of the solution space they cover. We intend our taxonomy and review of past work to be useful when comparing different approaches to schema matching, when developing a new match algorithm, and when implementing a schema matching component. Received: 5 February 2001 / Accepted: 6 September 2001 Published online: 21 November 2001     

ISENGARD: an infrastructure for supporting e‐science and grid application development

Grid computing facilitates the aggregation and coordination of resources that are distributed across multiple administrative domains for large‐scale and complex e‐Science experiments. Writing, deploying, and testing grid applications over highly heterogeneous and distributed resources are complex and challenging. The process requires grid‐enabled programming tools that can handle the complexity and scale of the infrastructure. However, while a large amount of research has been undertaken into grid middleware, little work has been directed specifically at the area of grid application development tools. This paper presents the design and implementation of ISENGARD, an infrastructure for supporting e‐Science and grid application development. ISENGARD provides services, tools, and APIs that simplify grid software development. Copyright © 2010 John Wiley & Sons, Ltd.     

A survey on approaches for reliability-based optimization

Reliability-based Optimization is a most appropriate and advantageous methodology for structural design. Its main feature is that it allows determining the best design solution (with respect to prescribed criteria) while explicitly considering the unavoidable effects of uncertainty. In general, the application of this methodology is numerically involved, as it implies the simultaneous solution of an optimization problem and also the use of specialized algorithms for quantifying the effects of uncertainties. In view of this fact, several approaches have been developed in the literature for applying this methodology in problems of practical interest. This contribution provides a survey on approaches for performing Reliability-based Optimization, with emphasis on the theoretical foundations and the main assumptions involved. Early approaches as well as the most recently developed methods are covered. In addition, a qualitative comparison is performed in order to provide some general guidelines on the range of applicability on the different approaches discussed in this contribution.     

计算作业网格执行环境的分析、设计与应用*

针对网格环境下科学计算遗产程序执行涉及到的关键问题进行了分析和设计,提出了一个基于固有计算执行环境+网格运行支持扩展的计算作业网格执行环境,以支持在网格环境下调用执行科学程序,并将其应用到了科学计算遗产程序包装成的网格服务运行中。计算作业网格执行环境很好地满足了传统科学计算遗产程序在网格环境下共享后的运行管理的需要,具有广泛的适用性和参考价值。     

A scalable blackbox-oriented e-learning system based on desktop grid over private cloud

Traditional web-based e-learning system suffers from unstable workloads and security risks of incorporating external executable objects to servers. This paper addresses these issues with emerging technologies, as desktop grid and cloud computing. Learning users are motivated to be volunteers by hosting the virtual machines equipped with e-learning desktop grid applications. We develop components to integrate the e-learning system and desktop grid into the circumstance in which each user serves not only a task producer, but also a volunteer that solves tasks. In order to enhance the responsiveness between the passive desktop grid server and e-learning system, we have also developed asynchronous processes to enable the server and volunteer workers to cooperate in a tightly coupled manner. The system achieves the scalability by maintaining the ratio between the number of volunteers and the number of online users beyond certain threshold.     

网格体系结构研究

通过对国内外网格体系结构的深入研究,揭示了网格体系结构的发展历程,使读者对网格体系结构有一个清晰整体的认识。描述了3个最具代表性的网格体系结构,对网格计算的进一步发展有一定的指导意义。     

A survey of computational approaches to three-dimensional layout problems

The component layout or packaging problem requires efficient search of large, discontinuous spaces. This survey paper reviews the state-of-the-art in product layout algorithms. The focus on optimization and geometric interference calculation strategies addresses the common aspects of the layout problem for all applications.     

Computational approaches to predicting essential proteins: A survey

Essential proteins are indispensable to support cellular life. Identifying essential proteins can help us understand the minimal requirements for cell survival, which plays a significant role in the emerging field of synthetic biology. Moreover, essential proteins also serve as candidates of drug targets for developing novel therapy of diseases, such as cancer or infectious disease caused by emerging pathogens. However, it is expensive and time consuming to experimentally identify essential proteins. With accumulation of sequenced genomes, the gap between genome-wide essential protein data and sequence data become increasingly wide. Thus, computational approaches for detecting essential proteins are useful complements to limited experimental methods. There are many features related to protein essentiality. By taking advantage of these features, many computational approaches have been proposed to identify essential proteins. In this paper, we review the state-of-the-art techniques for computational detection of essential proteins, and discuss some challenges for future research in this field.     

Parallel approaches to machine learning—A comprehensive survey

Literature has always witnessed efforts that make use of parallel algorithms / parallel architecture to improve performance; machine learning space is no exception. In fact, a considerable effort has gone into this area in the past fifteen years. Our report attempts to bring together and consolidate such attempts. It tracks the development in this area since the inception of the idea in 1995, identifies different phases during the time period 1995–2011 and marks important achievements. When it comes to performance enhancement, GPU platforms have carved a special niche for themselves. The strength of these platforms comes from the capability to speed up computations exponentially by way of parallel architecture / programming methods. While it is evident that computationally complex processes like image processing, gaming etc. stand to gain much from parallel architectures; studies suggest that general purpose tasks such as machine learning, graph traversal, and finite state machines are also identified as the parallel applications of the future. Map reduce is another important technique that has evolved during this period and as the literature has it, it has been proved to be an important aid in delivering performance of machine learning algorithms on GPUs. The report summarily presents the path of developments.     

一个基于服务的网格计算模型

文中提出一个基于服务的网格计算模型,该模型强调了一个网格就是一个特殊的计算系统。通过这个模型与传统计算系统模型的比较,分析了它们的相似点和不同点,这对于网格的研究是很重要的。文中所提出的模型对网格计算的研究也是非常有用的。它不仅为开发一个网格系统提供了一定的帮助,而且为网格理论上的研究提供了一个框架。