• Title/Summary/Keyword: Heterogeneous computing

Search Result 398, Processing Time 0.029 seconds

Spatio-temporal Query Processing Systems for Ubiquitous Environments

  • Kim, Jeong Joon;Kang, Jeong Jin;Rothwell, Edward J.;Lee, Ki Young
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.5 no.2
    • /
    • pp.1-4
    • /
    • 2013
  • With the recent development of the ubiquitous computing technology, there are increasing interest and research in technologies such as sensors and RFID related to information recognition and location positioning in various ubiquitous fields. Especially, RTLS (Real-Time Locating Services) dealing with spatio-temporal data is emerging as a promising technology. For these reasons, the ISO/IEC published RTLS standard specification for compatibility and interoperability in RTLS. Therefore, in this paper, we designed and implemented Spatio-temporal Query Processing Systems for efficiently managing and searching the incoming Spatio-temporal data stream of moving objects. Spatio-temporal Query Processing Systems's spatio-temporal middleware maintains interoperability among heterogeneous devices and guarantees data integrity in query processing through real time processing of unceasing spatio-temporal data streams and two way synchronization of spatio-temporal DBMSs. Web Server uses the SOAP(Simple Object Access Protocol) message between client and server for interoperability and translates client's SOAP message into CQL(Continuous Query Language) of the spatio-temporal middleware.

Genetic Risk Prediction for Normal-Karyotype Acute Myeloid Leukemia Using Whole-Exome Sequencing

  • Heo, Seong Gu;Hong, Eun Pyo;Park, Ji Wan
    • Genomics & Informatics
    • /
    • v.11 no.1
    • /
    • pp.46-51
    • /
    • 2013
  • Normal-karyotype acute myeloid leukemia (NK-AML) is a highly malignant and cytogenetically heterogeneous hematologic cancer. We searched for somatic mutations from 10 pairs of tumor and normal cells by using a highly efficient and reliable analysis workflow for whole-exome sequencing data and performed association tests between the NK-AML and somatic mutations. We identified 21 nonsynonymous single nucleotide variants (SNVs) located in a coding region of 18 genes. Among them, the SNVs of three leukemia-related genes (MUC4, CNTNAP2, and GNAS) reported in previous studies were replicated in this study. We conducted stepwise genetic risk score (GRS) models composed of the NK-AML susceptible variants and evaluated the prediction accuracy of each GRS model by computing the area under the receiver operating characteristic curve (AUC). The GRS model that was composed of five SNVs (rs75156964, rs56213454, rs6604516, rs10888338, and rs2443878) showed 100% prediction accuracy, and the combined effect of the three reported genes was validated in the current study (AUC, 0.98; 95% confidence interval, 0.92 to 1.00). Further study with large sample sizes is warranted to validate the combined effect of these somatic point mutations, and the discovery of novel markers may provide an opportunity to develop novel diagnostic and therapeutic targets for NK-AML.

A Face Tracking Algorithm for Multi-view Display System

  • Han, Chung-Shin;Go, Min Soo;Seo, Young-Ho;Kim, Dong-Wook;Yoo, Ji-Sang
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.1
    • /
    • pp.27-35
    • /
    • 2013
  • This paper proposes a face tracking algorithm for a viewpoint adaptive multi-view synthesis system. The original scene captured by a depth camera contains a texture image and 8 bit gray-scale depth map. From this original image, multi-view images that correspond to the viewer's position can be synthesized using geometrical transformations, such as rotation and translation. The proposed face tracking technique gives a motion parallax cue by different viewpoints and view angles. In the proposed algorithm, the viewer's dominant face, which is established initially from a camera, can be tracked using the statistical characteristics of face colors and deformable templates. As a result, a motion parallax cue can be provided by detecting the viewer's dominant face area and tracking it, even under a heterogeneous background, and synthesized sequences can be displayed successfully.

  • PDF

Seamless and Secure Mobility Management with Location-Aware Service (LAS) Broker for Future Mobile Interworking Networks

  • Lee Minsoo;Kim Gwanyeon;Park Sehyun
    • Journal of Communications and Networks
    • /
    • v.7 no.2
    • /
    • pp.207-221
    • /
    • 2005
  • The proliferation of wireless local area networks (WLANs) offering high data rate in hot spot area have spurred the demand for possible WLANs and third-generation (3G) cellular network integration solutions as the initiative step towards 4G systems. This paper provides a novel architecture for seamless location-aware integration of WLANs into 3G cellular networks and also an analysis for the efficient handover techniques. We introduce location as a key context in secure roaming mechanism for context-aware interworking in 4G systems. The fast secure roaming with location-aware authentication is implemented at an entity called location-aware service (LAS) broker that utilizes the concepts of direction of user and pre-warming zone. The location-ware interworking architecture supports seamless roaming services among heterogeneous wireless networks including WLANs, wireless metropolitan area networks (WMANs), and 3G cellular networks. This paper also includes a description of procedures needed to implement efficient mobility and location management. We show how the LAS broker with pre-warming and context transfer can obtain significant lower latency in the vertical handover.

iPOJO-based Middleware Solutions for Self-Reconfiguration and Self-Optimization

  • Bellavista, Paolo;Corradi, Antonio;Fontana, Damiano;Monti, Stefano
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.8
    • /
    • pp.1368-1387
    • /
    • 2011
  • In recent years, ubiquitous and pervasive scenarios have emerged as a complex ecosystem where differentiated software/hardware components interoperate wirelessly and seamlessly. The goal is to enable users to continuously access services and contents, and to always get the best out of their current environment and available resources. In such dynamic and flexible scenarios, the need emerges for flexible and general solutions for continuous runtime self-reconfiguration and self-optimization of ubiquitous support software systems. This paper proposes a fully reconfigurable middleware approach that aims at reconfiguring complex software systems made up of heterogeneous off-the-shelf components from both functional and non-functional perspectives. Our middleware can also extend already existing and non-reconfigurable middleware/applications in an easy and flexible way, with no need to re-design them. The proposed design principles have been practically applied to the implementation of a runtime self-reconfigurable middleware called Off-The-Shelf Ready To Go (OTS-RTG), implemented on top of iPOJO. The reported experimental results both exhibit a limited overhead and show the wide applicability of the proposed solution to many application scenarios, including complex, industrial, Enterprise Service Bus-based ones.

Methods to System Integration in Distributed Heterogeneous Environments (분산 이기종 환경에서의 메시지미들웨어(MOM) 시스템 통합방안 연구)

  • Kim Jong-Bae;Song Jae-Young;Rhew Sung-Yul
    • Journal of Digital Contents Society
    • /
    • v.6 no.3
    • /
    • pp.163-168
    • /
    • 2005
  • Computing infrastructures and technologies are moving into the distributed environments. Due to increase of M&A, and outsourcing processes, or increase or development of various system in an organizations, there are various problems resing such as difficulties in maintenance and repairment, repetition or inconsistency of data, and lacks of interconnection between different of difficulties in financing and selecting an adequate solutionas. This study presents a method to integrate systems adopting massage middleware as an efficient alternative for integration of applications and data between different models under distributed system environments. We expect that the integration method presented in this study, adopting massage middleware between system, will be an efficient alternative to build up interface between small system in terms of expense and efficiency.

  • PDF

Performance Improvement of the Sensor Registry System based on Sensor Metadata Reusability and Scoping (센서 메타데이터 영역화 및 재사용성 기반 센서 레지스트리 시스템 성능 향상 방법)

  • Jeong, Dongwon
    • The Journal of Korean Association of Computer Education
    • /
    • v.15 no.6
    • /
    • pp.75-82
    • /
    • 2012
  • The sensor registry system has been proposed to interpret and process semantics of sensor data independently of heterogeneous sensor networks. However, the existing sensor registry system provides the static processing method. In other words, the existing system reduces the overall performance because it executes unnecessary operations and does not consider data scope to be used. To resolve the problem of the existing sensor registry system, this paper proposes a performance enhancement model based on sensor metadata reusability and scoping. The proposed model in this paper provides a function that can decide a proper scope of sensor metadata from the sensor registry system. The proposed model improves the overall performance by providing reusability of sensor metadata. This paper also shows the advantages of the proposed model through the comparative performance evaluation.

  • PDF

A Novel Memory Hierarchy for Flash Memory Based Storage Systems

  • Yim, Keno-Soo
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.5 no.4
    • /
    • pp.262-269
    • /
    • 2005
  • Semiconductor scientists and engineers ideally desire the faster but the cheaper non-volatile memory devices. In practice, no single device satisfies this desire because a faster device is expensive and a cheaper is slow. Therefore, in this paper, we use heterogeneous non-volatile memories and construct an efficient hierarchy for them. First, a small RAM device (e.g., MRAM, FRAM, and PRAM) is used as a write buffer of flash memory devices. Since the buffer is faster and does not have an erase operation, write can be done quickly in the buffer, making the write latency short. Also, if a write is requested to a data stored in the buffer, the write is directly processed in the buffer, reducing one write operation to flash storages. Second, we use many types of flash memories (e.g., SLC and MLC flash memories) in order to reduce the overall storage cost. Specifically, write requests are classified into two types, hot and cold, where hot data is vulnerable to be modified in the near future. Only hot data is stored in the faster SLC flash, while the cold is kept in slower MLC flash or NOR flash. The evaluation results show that the proposed hierarchy is effective at improving the access time of flash memory storages in a cost-effective manner thanks to the locality in memory accesses.

Algorithmic GPGPU Memory Optimization

  • Jang, Byunghyun;Choi, Minsu;Kim, Kyung Ki
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.14 no.4
    • /
    • pp.391-406
    • /
    • 2014
  • The performance of General-Purpose computation on Graphics Processing Units (GPGPU) is heavily dependent on the memory access behavior. This sensitivity is due to a combination of the underlying Massively Parallel Processing (MPP) execution model present on GPUs and the lack of architectural support to handle irregular memory access patterns. Application performance can be significantly improved by applying memory-access-pattern-aware optimizations that can exploit knowledge of the characteristics of each access pattern. In this paper, we present an algorithmic methodology to semi-automatically find the best mapping of memory accesses present in serial loop nest to underlying data-parallel architectures based on a comprehensive static memory access pattern analysis. To that end we present a simple, yet powerful, mathematical model that captures all memory access pattern information present in serial data-parallel loop nests. We then show how this model is used in practice to select the most appropriate memory space for data and to search for an appropriate thread mapping and work group size from a large design space. To evaluate the effectiveness of our methodology, we report on execution speedup using selected benchmark kernels that cover a wide range of memory access patterns commonly found in GPGPU workloads. Our experimental results are reported using the industry standard heterogeneous programming language, OpenCL, targeting the NVIDIA GT200 architecture.

Context Information and Active Proxy for Mobile GIS Web Service (모바일 GIS 웹 서비스를 위한 컨텍스트 정보와 액티브 프록시)

  • Lee, Hun;Yoo, Sang-Bong
    • The Journal of Society for e-Business Studies
    • /
    • v.12 no.2
    • /
    • pp.1-16
    • /
    • 2007
  • Recently the computing environment has been moved to open architectures that include Web technologies. Web Service is one of import component of the new paradigm. This paper presents a design and implementation of GIS Web Service for mobile devices. As many mobile devices are equipped with GPS (Global Positioning System), it is required to handle the position information more effectively. We have extended the proxy program in the client device to actively send the context information to the server. Based on the context information the server determines the optimal service mode to a particular client. A working example of location?based GIS Web Service is also presented. By using Web Service standards and XML messages we can achieve the maximal interoperability for heterogeneous mobile devices.

  • PDF