Aurora: a new model and architecture for data stream management

This paper describes the basic processing model and architecture of Aurora, a new system to manage data streams for monitoring applications. Monitoring applications differ substantially from conventional business data processing. The fact that a software system must process and react to continual inputs from many sources (e.g., sensors) rather than from human operators requires one to rethink the fundamental architecture of a DBMS for this application area. In this paper, we present Aurora, a new DBMS currently under construction at Brandeis University, Brown University, and M.I.T. We first provide an overview of the basic Aurora model and architecture and then describe in detail a stream-oriented set of operators.Received: 12 September 2002, Accepted: 26 March 2003, Published online: 21 July 2003Edited by Y. Ioannidis     

Resource allocation for multiple concurrent in-network stream-processing applications

This work investigates the operator mapping problem for in-network stream-processing. In a stream-processing application, a tree of operators is applied, in steady-state mode, to datasets that are continuously updated at different locations in the network. The goal is to generate updated final results at a desired rate. In in-network stream-processing, dataset updates and operator computations are performed by servers distributed in a network. We consider the problem of mapping operators to these servers in the case of multiple concurrent stream-processing applications. In this case, different operator trees corresponding to different applications may share common subtrees, so that intermediate results can be reused by different applications. This work provides complexity results for different versions of the operator mapping problem, which can be formulated as integer linear programs. Several polynomial-time heuristics are proposed for a particularly relevant version of the problem, which is NP-hard. These heuristics are compared and evaluated via simulation. The results demonstrate the importance of mapping the operators to appropriate processors, and the importance of sharing common sub-trees across operator trees.     

基于Aurora系统的持续型查询语言设计与实现

随着新型数据应用的不断出现,针对流形态数据的数据流管理系统已经成为数据管理领域研究的新热点。针对目前通用数据流管理系统只支持基于操作符流图的查询表达方式这一不足,设计了一种新的持续型数据流查询语言,并在通用数据流处理系统Aurora上进行了实现。为验证新语言的表达能力,该系统使用新语言定义了数据流基准测试Linear Road Benchmark的查询集,在Aurora系统上部署运行。测试结果表明针对Linear Road Benchmark的测试用例,新语言具有较完备的语义和良好的表达能力。     

流寄存器文件的实现及性能测评

FT64是一款自主研发的面向科学计算的64位流处理器。本文介绍了该处理器的微体系结构及其编程模型,重点讨论了片内流寄存器文件实现的关键技术;该流寄存器文件具有硬件代价低、支持多流虚拟并发访问等特性。测试结果表明,流寄存器文件满足某些类科学计算与工程应用的带宽需求。     

A novel ecological network‐based computation platform as a grid middleware system

Next‐generation grid systems where the emphasis shifts to distributed global collaboration, a service‐oriented approach, and information layer issues exhibit a strong sense of automation. Requirements for these systems resemble the self‐organizing and the self‐healing properties of natural ecosystems. Inspired by this resemblance, we introduce some key ecological concepts and mechanisms into the design for the third‐generation grid systems. In this article, a novel Ecological Network‐based Grid Middleware (ENGM), which is based on Ecological Network Computing Environment (ENCE), is proposed. First, we discuss how to design the ENCE by agent‐oriented approaches based on the key concepts and principles of ecosystems. ENCE provides a new computing and problem‐solving paradigm by combining natural ecosystem mechanisms with agent technologies. Then, we design the ENGM with built‐in mechanisms to support desirable requirements of new grid systems, namely scalability, adaptability, self‐organization, simplicity, and survivability. Based on Jeffery's conceptual model, we also present a corresponding grid‐computing prototype that embeds ENGM layers from the implementation point of view. The ENGM will be useful to address the challenges of the third‐generation grid systems. Finally, as a demonstration, we built an ENGM platform‐based commercial grid service environment and developed a prototype of enterprise supply chain management system. The experimental results demonstrate that the proposed ENGM satisfies the requirements of the next‐generation grid and is suitable for new generation grid applications. © 2004 Wiley Periodicals, Inc. Int J Int Syst 19: 859–884, 2004.     

Generic windowing support for extensible stream processing systems

Stream processing applications process high volume, continuous feeds from live data sources, employ data‐in‐motion analytics to analyze these feeds, and produce near real‐time insights with low latency. One of the fundamental characteristics of such applications is the on‐the‐fly nature of the computation, which does not require access to disk resident data. Stream processing applications store the most recent history of streams in memory and use it to perform the necessary modeling and analysis tasks. This recent history is often managed using windows. All data stream management systems provide some form of windowing functionality. Windowing makes it possible to implement streaming versions of the traditionally blocking relational operators, such as streaming aggregations, joins, and sorts, as well as any other analytic operator that requires keeping the most recent tuples as state, such as time series analysis operators and signal processing operators. In this paper, we provide a categorization of different window types and policies employed in stream processing applications and give detailed operational semantics for various window configurations. We describe an extensibility mechanism that makes it possible to integrate windowing support into user‐defined operators, enabling consistent syntax and semantics across system‐provided and third‐party toolkits of streaming operators. We describe the design and implementation of a runtime windowing library that significantly simplifies the construction of window‐based operators by decoupling the handling of window policies and operator logic from each other. We present our experience using the windowing library to implement a relational operators toolkit and compare the efficacy of the solution to an earlier implementation that did not employ a common windowing library. Copyright © 2013 John Wiley & Sons, Ltd.     

The BEA streaming XQuery processor

This paper describes the design, implementation, and performance characteristics of a commercial XQuery processing engine, the BEA streaming XQuery processor. This XQuery engine was designed to provide high performance for message-processing applications, i.e., for transforming XML data streams. The engine is a central component of the 8.1 release of BEAs WebLogic Integration (WLI) product. The BEA XQuery engine is fully compliant with the August 2002 draft of the W3C XML Query Language specification and we are currently porting it to the latest version of the XQuery language (July 2004). A goal of this paper is to describe how a fully compliant yet efficient XQuery engine has been built from a few relatively simple components and well-understood technologies.Received: 12 January 2004, Accepted: 29 March 2004, Published online: 12 August 2004Edited by: J.-C. Freytag     

Experience with distributed Smalltalk

Distributed Smalltalk (DS) is an implementation of Smalltalk that supports the interaction of many Smalltalk users on many machines. It provides communication and interaction among remote Smalltalk users, direct access to remote objects, and a degree of object sharing among users. The distributed aspects of the system are largely user transparent. Many of the major design issues and implementation decisions associated with Distributed Smalltalk have previously been reported. This paper concentrates on the impact of those decisions and describes how DS is used to build distributed applications. Three example applications are described: remote file access, animated distributed objects, and offloading a compute-intensive task to a non-Smalltalk host. Based on our experience with DS, we present an evaluation of its design and implementation.     

Tuning space mapping: The state of the art

The electromagnetic (EM)‐simulator‐based tuning process for rapid microwave design can combine EM accuracy with circuit‐design speed. Our own approach is based on the intuitive engineering idea of “space mapping.” In this article, we explain the art of microwave design optimization through “tuning space mapping” procedures. We list various appropriate types of models (called “surrogates”). We demonstrate the implementation of these surrogates through a simple bandstop filter. We provide application examples using commercial simulation software. Our purpose is to help microwave engineers understand the tuning space mapping methodology and to inspire new implementations and applications. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE 22: 639–651, 2012.     

The architecture of an event correlation service for adaptive middleware-based applications

Loosely coupled component communication driven by events is a key mechanism for building middleware-based applications that must achieve reliable qualities of service in an adaptive manner. In such a system, events that encapsulate state snapshots of a running system are generated by monitoring components. Hence, an event correlation service is necessary for correlating monitored events from multiple sources. The requirements for the event correlation raise two challenges: to seamlessly integrate event correlation services with other services and applications; and to provide reliable event management with minimal delay. This paper describes our experience in the design and implementation of an event correlation service. The design encompasses an event correlator and an event proxy that are integrated with an architecture for adaptive middleware components. The implementation utilizes the common-based event (CBE) specification and stateful Web service technologies to support the deployment of the event correlation service in a distributed architecture. We evaluate the performance of the overall solution in a test bed and present the results in terms of the trade-off between the flexibility and the performance overhead of the architecture.     

Normalization and lossless join decomposition of similarity‐based fuzzy relational databases

Fuzzy relational database models generalize the classical relational database model by allowing uncertain and imprecise information to be represented and manipulated. In this article, we introduce fuzzy extensions of the normal forms for the similarity‐based fuzzy relational database model. Within this framework of fuzzy data representation, similarity, conformance of tuples, the concept of fuzzy functional dependencies, and partial fuzzy functional dependencies are utilized to define the fuzzy key notion, transitive closures, and the fuzzy normal forms. Algorithms for dependency preserving and lossless join decompositions of fuzzy relations are also given. We include examples to show how normalization, dependency preserving, and lossless join decomposition based on the fuzzy functional dependencies of fuzzy relation are done and applied to some real‐life applications. © 2004 Wiley Periodicals, Inc. Int J Int Syst 19: 885–917, 2004.     

基于ARCGIS SERVER和FLEX的城市服务信息系统研究与设计

当前基于页面的瘦客户端Web GIS开发技术无法满足用户复杂的交互应用。提出以Flex技术和ArcGIS Server Flex API构建基于RIA的Web GIS模型,并结合J2EE开发平台实现了一个城市服务信息查询的原型系统,包括软件构架设计和关键流程实现。     

应用Xen虚拟技术和新型渲染技术实现ZPMC第四代组态软件

信息化、智能化的时代迫切需要功能更强大、更灵活的工业监控，自主研发的组态软件能够提升码头监控系统的运作效率、满足集团公司的定制化需求、提升振华重工软件研发的核心实力.文章研究了振华重工新一代组态软件的整体设计架构、关键实现技术和实施效果，新架构的组态软件具有良好的系统交互式界面设计，通过虚拟化的Web及移动应用，实现集中部署，便于随时随地掌握生产运营、设备状态信息，首创多屏多画面映射技术，实现了屏幕与画面的动态配置，能够一机全景展示码头监控中的关键内容.新架构基础上的组态软件能够显著提高实时监控系统的效率，优化用户体验，对国内组态软件的研发与设计具有非常重要的借鉴价值.     

基于B/S结构的日程管理系统的设计与实现

结合参与开发PLM项目的一个子系统——日程管理系统,论述如何运用基于J2EE架构的Weblogic8.1服务器以及JSP Jav-aBean技术实现一个功能完备的B/S模式的Web应用系统。     

Design and implementation of a high‐performance CCA event service

Event services based on publish–subscribe architectures are well‐established components of distributed computing applications. Recently, an event service has been proposed as part of the common component architecture (CCA) for high‐performance computing (HPC) applications. In this paper we describe our implementation, experimental evaluation, and initial experience with a high‐performance CCA event service that exploits efficient communications mechanisms commonly used on HPC platforms. We describe the CCA event service model and briefly discuss the possible implementation strategies of the model. We then present the design and implementation of the event service using the aggregate remote memory copy interface as an underlying communication layer for this mechanism. Two alternative implementations are presented and evaluated on a Cray XD‐1 platform. The performance results demonstrate that event delivery latencies are low and that the event service is able to achieve high‐throughput levels. Finally, we describe the use of the event service in an application for high‐speed processing of data from a mass spectrometer and conclude by discussing some possible extensions to the event service for other HPC applications. Published in 2009 by John Wiley & Sons, Ltd.     

Real-time multi-scale brain data acquisition, assembly, and analysis using an end-to-end OptIPuter

At iGrid 2005 we demonstrated the transparent operation of a biology experiment on a test-bed of globally distributed visualization, storage, computational, and network resources. These resources were bundled into a unified platform by utilizing dynamic lambda allocation, high bandwidth protocols for optical networks, a Distributed Virtual Computer (DVC) [N. Taesombut, A. Chien, Distributed Virtual Computer (DVC): Simplifying the development of high performance grid applications, in: Proceedings of the Workshop on Grids and Advanced Networks, GAN 04, Chicago, IL, April 2004 (held in conjunction with the IEEE Cluster Computing and the Grid (CCGrid2004) Conference)], and applications running over the Scalable Adaptive Graphics Environment (SAGE) [L. Renambot, A. Rao, R. Singh, B. Jeong, N. Krishnaprasad, V. Vishwanath, V. Chandrasekhar, N. Schwarz, A. Spale, C. Zhang, G. Goldman, J. Leigh, A. Johnson, SAGE: The Scalable Adaptive Graphics Environment, in: Proceedings of WACE 2004, 23–24 September 2004, Nice, France, 2004]. Using these layered technologies we ran a multi-scale correlated microscopy experiment [M.E. Maryann, T.J. Deerinck, N. Yamada, E. Bushong, H. Ellisman Mark, Correlated 3D light and electron microscopy: Use of high voltage electron microscopy and electron tomography for imaging large biological structures, Journal of Histotechnology 23 (3) (2000) 261–270], where biologists imaged samples with scales ranging from 20X to 5000X in progressively increasing magnification. This allows the scientists to zoom in from entire complex systems such as a rat cerebellum to individual spiny dendrites. The images used spanned multiple modalities of imaging and specimen preparation, thus providing context at every level and allowing the scientists to better understand the biological structures. This demonstration attempts to define an infrastructure based on OptIPuter components which would aid the development and design of collaborative scientific experiments, applications and test-beds and allow the biologists to effectively use the high resolution real estate of tiled displays.     

User transparency: a fully sequential programming model for efficient data parallel image processing

Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high‐performance computing on a daily basis. Essentially, this is due to the fact that no parallelization tools exist that truly match the image processing researcher's frame of reference. As it is unrealistic to expect imaging researchers to become experts in parallel computing, tools must be provided to allow them to develop high‐performance applications in a highly familiar manner. In an attempt to provide such a tool, we have designed a software architecture that allows transparent (i.e. sequential) implementation of data parallel imaging applications for execution on homogeneous distributed memory MIMD‐style multicomputers. This paper presents an extensive overview of the design rationale behind the software architecture, and gives an assessment of the architecture's effectiveness in providing significant performance gains. In particular, we describe the implementation and automatic parallelization of three well‐known example applications that contain many fundamental imaging operations: (1) template matching; (2) multi‐baseline stereo vision; and (3) line detection. Based on experimental results we conclude that our software architecture constitutes a powerful and user‐friendly tool for obtaining high performance in many important image processing research areas. Copyright © 2004 John Wiley & Sons, Ltd.     

结合AJAX与J2EE技术的WEB信息检索系统的设计与实现

AJAX是最新出现的网络应用客户端构建技术,它面向异步消息通讯机制。可以在B/S构架下实现富客户端网络应用,具有跨平台特性。给出了AJAX的概念、特点及实现条件,介绍了其中的关键技术,列举了目前AJAX技术尚中存在的问题和缺陷。定义了XMLAssemblyFactoryServlet,提出了使用XMLAssemblyFactoryServlet将AJAX与J2EE技术结合运用的一种方法。同时给出了结合运用AJAX与J2EE技术构建的计算机监控系统Web查询模块的设计与实现举例。     

Designing and implementing multi-user applications: A case study

We have developed a new multi-user application that integrates and extends the concepts in a variety of current multi-user applications. It allows multiple users to store, retrieve and browse through information, communicate information both synchronously and asynchronously, create ‘pipes’ of consistent, editable and persistent views, and interactively specify handlers for events. It has been implemented using the experimental technologies of distributed objects and multi-user editor generation. Our work on this application suggests a new and practical model for designing and implementing multi-user applications. In this paper, we describe the user interface and implementation of the application, give the rationale for our design choices, describe our experience with the tools and techniques used in the implementation, and present conclusions and directions for future work.