• Title/Summary/Keyword: parallel machines

Search Result 208, Processing Time 0.026 seconds

Distributed Assumption-Based Truth Maintenance System for Scalable Reasoning (대용량 추론을 위한 분산환경에서의 가정기반진리관리시스템)

  • Jagvaral, Batselem;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.43 no.10
    • /
    • pp.1115-1123
    • /
    • 2016
  • Assumption-based truth maintenance system (ATMS) is a tool that maintains the reasoning process of inference engine. It also supports non-monotonic reasoning based on dependency-directed backtracking. Bookkeeping all the reasoning processes allows it to quickly check and retract beliefs and efficiently provide solutions for problems with large search space. However, the amount of data has been exponentially grown recently, making it impossible to use a single machine for solving large-scale problems. The maintaining process for solving such problems can lead to high computation cost due to large memory overhead. To overcome this drawback, this paper presents an approach towards incrementally maintaining the reasoning process of inference engine on cluster using Spark. It maintains data dependencies such as assumption, label, environment and justification on a cluster of machines in parallel and efficiently updates changes in a large amount of inferred datasets. We deployed the proposed ATMS on a cluster with 5 machines, conducted OWL/RDFS reasoning over University benchmark data (LUBM) and evaluated our system in terms of its performance and functionalities such as assertion, explanation and retraction. In our experiments, the proposed system performed the operations in a reasonably short period of time for over 80GB inferred LUBM2000 dataset.

A Task Scheduling Algorithm with Environment-specific Performance Enhancement Method (환경 특성에 맞는 성능 향상 기법을 사용하는 태스크 스케줄링 알고리즘)

  • Song, Inseong;Yoon, Dongsung;Park, Taeshin;Choi, Sangbang
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.5
    • /
    • pp.48-61
    • /
    • 2017
  • An IaaS service of a cloud computing environment makes itself attractive for running large scale parallel application thanks to its innate characteristics that a user can utilize a desired number of high performance virtual machines without maintenance cost. The total execution time of a parallel application on a high performance computing environment depends on a task scheduling algorithm. Most studies on task scheduling algorithms on cloud computing environment try to reduce a user cost, and studies on task scheduling algorithms that try to reduce total execution time are rarely carried out. In this paper, we propose a task scheduling algorithm called an HAGD and a performance enhancement method called a group task duplication method of which the HAGD utilizes. The group task duplication method simplifies previous task duplication method, and the HAGD uses the group task duplication method or a task insertion method according to the characteristics of a computing environment and an application. We found that the proposed algorithm provides superior performance regardless of the characteristics in terms of normalized total execution time through performance evaluations.

Development of an Imaging Based Gang Protection System

  • Grimm, M.;Pelz, M.
    • International Journal of Railway
    • /
    • v.1 no.4
    • /
    • pp.149-156
    • /
    • 2008
  • During maintenance or construction works in or at the tracks of railways, high risks for passengers and railway staff, especially for the workers on the construction site exist. The high risks result out of the movement of rail vehicles, like trains or construction vehicles, which must be faced by using any available technical and operational technologies for securing them against the environment. Therefore, it is necessary to evaluate the level of protection continuously and to identify new and innovative methods and technologies for the protection of the gang (construction worker, machines and material). Especially on construction sites at line sections with two or more parallel tracks but also with single tracks, there are still a lot of incidents and accidents mostly with seriously injured persons or fatalities. These were mainly gang members that breach the railway-loading gage. By using proper warning or protection systems, the avoidance of such accidents must be achieved. The latest developments. in gang protection systems concern on the one hand fixed barriers in the middle between the construction site and the operated track and on the other hand construction vehicles equipped with automatic warning systems. The disadvantage of such protection methods is that the gang can be warned against an approaching train but a monitoring of the gang members cannot be performed. Only one part of a potential dangerous situation will be detected. If the gang members will overhear the acoustic warning signal of the security staff and the workers will not leave the danger zone in the track, the driver of the approaching train had no chance to react to the dangerous situation. An accident is often inevitable. While the detection of acoustic warning signals by the gang members working on a construction site is very difficult, the acoustical planning of an automatic warning system has to be designed for an acoustic short range level of one meter besides the construction vehicle. The decision about the use of today's technical warning system (fixed systems, automatic warning systems, etc.) must be geared to the technical feasibility and the level of safety which is needed. Criteria for decision guidance to block a track should be developed by danger estimation and economical variables. To realize the actual jurisdiction and to minimize the hazards of railway operations by the use of construction vehicles near the tracks further developments are needed. This means, that the warning systems have to be enhanced to systems for protection, which monitor the realization of the warning signal as a precondition for giving a movement authority to a train. This method can protect against accidents caused by predictable wrongdoing. The actual state of the art technique of using a collective warning combined with additional security staff is no longer acceptable. Therefore, the Institute of Transportation System of the German Aerospace Center in Braunschweig (Germany) will develop a gang warning and protection system based upon imaging methods, with optical sensors such as video in visible and invisible ranges, radar, laser, and other. The advantage of such a system based on the possibility to monitor both the gang itself and the railway-loading gauge either of the parallel track or of the same track still in use. By monitoring both situations, the system will be able to generate a warning message for the approaching train, that there are obstacles in the track, so that the train can be stopped to prevent an accident. And also the gang workers will be warned, while they breach their area.

  • PDF

An Efficient List Scheduling Algorithm in Distributed Heterogeneous Computing System (분산 이기종 컴퓨팅 시스템에서 효율적인 리스트 스케줄링 알고리즘)

  • Yoon, Wan-Oh;Yoon, Jung-Hee;Lee, Chang-Ho;Gim, Hyo-Gi;Choi, Sang-Bang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.86-95
    • /
    • 2009
  • Efficient DAG scheduling is critical for achieving high performance in heterogeneous computing environments. Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph(DAG) onto a set of heterogeneous machines is known to be an NP-complete problem. In this paper we propose a new list scheduling algorithm, called the Heterogeneous Rank-Path Scheduling(HRPS) algorithm, to exploit all of a program's available parallelism in distributed heterogeneous computing system. The primary goal of HRPS is to minimize the schedule length of applications. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling algorithm such as CPOP, HCPT and FLB in term of the schedule length. The comparison studies show that HRPS significantly outperform CPOP, HCPT and FLB in schedule length.

Present Status and Problems of Chemical Seed Treatment of Seedborne Diseases (종자소독의 현황과 문제점)

  • Lee Du Hyung
    • Korean journal of applied entomology
    • /
    • v.22 no.2 s.55
    • /
    • pp.130-137
    • /
    • 1983
  • A wide variety of pathogens are known io be seedborne, carried either as infectious mycelium internally or as contaminants on the seed coat. When seed is infected with a pathogen, the seed nay be rendered nonviable or it may remain viable but produce weak seedling. In some cases, the Infected seedling nay not be severely weakened, but nay serve as a source of primary inoculum within a community of plants. A recent problem nay be the dissemination of seedborne pathogens occurring as a result of the massive movements of seed, as a part of the 'Green revolution' Disease of great danger to agriculture may be introduced with seed from other parts of world. Seed treatment with organic mercury compounds in liquid form had become popular since about 1955. Organic mercury compounds contributed considerably to the increase in production of many crops and vegetables. In 1975, however, the use of organic mercury compound was forbidden because of doubts regarding their residual mammalian toxicity in agricultural products. Benomyl-thiram mixture, thiophanate methyl-;hiram mixture and TCMB have now been registered as seed disinfectants for the use of rice blast, brown spot and Bakanae disease. Oxathiinsthiram mixture has been registered as seed disinfectant for barley and wheat loose smut and leaf stripe of barley. Agricultural techniques have made such rapid progress that the nursery methods changed from the use of paddy nursery to box nursery designed for machine-transplanting. The spread of rice transplanting machines has caused increase of seedborne diseases. Among seedborne diseases, Bakanae disease has remarkably increased and causes much damage recently. In order to counter this trend, seed disinfectants must also be diversified. First, effective non-selective disinfectants need to be developed, and second, appropriate control methods always need to be prepared in parallel with the development of new techniques for cultivation.

  • PDF

Fusion of 3D Cardiac SPECT and 64-Channel-CT Angiography Using Personal Computer in Functionally Relevant Coronary Artery Stenosis (개인용 컴퓨터를 이용한 기능 유관성 관상동맥 협착증의 삼차원 심장스펙트 사진과 64채널 전산화 단층 혈관촬영사진과의 융합)

  • Bahk, Yong-Whee
    • Nuclear Medicine and Molecular Imaging
    • /
    • v.41 no.3
    • /
    • pp.252-254
    • /
    • 2007
  • Image fusion is fast catching attention as Wagner pointed out in his 2006 version of the recent progress and development presented at the annual meeting of Society of Nuclear Medicine. Prototypical fusion of bone scan and radiograph was already attempted at in 1961 when Fleming et al. published an article on strontium-85 bone scan. They simply superimposed dot scan on radiograph enabling simultaneous assessment of altered bone metabolism and local bone anatomy. Indeed the parallel reading of images of bone scan and radiography, CT, MRI or ultrasonography has been practiced in nuclear medicine long since. It is fortunate that recent development of computer science and technology along with the availability of refined CT and SPECT machines has permitted us to open a new avenue to digitally produce precise fusion image so that they can readily be read, exchanged and disseminated using internet. Ten years ago fusion was performed using Bresstrahlung SPECT/CT and it is now achievable by PET/CT and SPECT/CT software and SPECT/CT hardware. The merit of image fusion is its feasibility of reliable assessment of morphological and metabolic change. It is now applicable not only to stationary organs such as brain and skeleton but also to moving organs such as the heart, lung and stomach. Recently, we could create useful fusion image of cardiac SPECT and 64-channel CT angiograph. The former provided myocardial metabolic profile and the latter vascular narrowing in two patients with coronary artery stenosis and myocardial ischemia. Arterial stenosis was severe in Case 1 and mild in Case 2.

A Study on Distributed Parallel SWRL Inference in an In-Memory-Based Cluster Environment (인메모리 기반의 클러스터 환경에서 분산 병렬 SWRL 추론에 대한 연구)

  • Lee, Wan-Gon;Bae, Seok-Hyun;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.45 no.3
    • /
    • pp.224-233
    • /
    • 2018
  • Recently, there are many of studies on SWRL reasoning engine based on user-defined rules in a distributed environment using a large-scale ontology. Unlike the schema based axiom rules, efficient inference orders cannot be defined in SWRL rules. There is also a large volumet of network shuffled data produced by unnecessary iterative processes. To solve these problems, in this study, we propose a method that uses Map-Reduce algorithm and distributed in-memory framework to deduce multiple rules simultaneously and minimizes the volume data shuffling occurring between distributed machines in the cluster. For the experiment, we use WiseKB ontology composed of 200 million triples and 36 user-defined rules. We found that the proposed reasoner makes inferences in 16 minutes and is 2.7 times faster than previous reasoning systems that used LUBM benchmark dataset.

Fixed Homography-Based Real-Time SW/HW Image Stitching Engine for Motor Vehicles

  • Suk, Jung-Hee;Lyuh, Chun-Gi;Yoon, Sanghoon;Roh, Tae Moon
    • ETRI Journal
    • /
    • v.37 no.6
    • /
    • pp.1143-1153
    • /
    • 2015
  • In this paper, we propose an efficient architecture for a real-time image stitching engine for vision SoCs found in motor vehicles. To enlarge the obstacle-detection distance and area for safety, we adopt panoramic images from multiple telegraphic cameras. We propose a stitching method based on a fixed homography that is educed from the initial frame of a video sequence and is used to warp all input images without regeneration. Because the fixed homography is generated only once at the initial state, we can calculate it using SW to reduce HW costs. The proposed warping HW engine is based on a linear transform of the pixel positions of warped images and can reduce the computational complexity by 90% or more as compared to a conventional method. A dual-core SW/HW image stitching engine is applied to stitching input frames in parallel to improve the performance by 70% or more as compared to a single-core engine operation. In addition, a dual-core structure is used to detect a failure in state machines using rock-step logic to satisfy the ISO26262 standard. The dual-core SW/HW image stitching engine is fabricated in SoC with 254,968 gate counts using Global Foundry's 65 nm CMOS process. The single-core engine can make panoramic images from three YCbCr 4:2:0 formatted VGA images at 44 frames per second and frequency of 200 MHz without an LCD display.

Conditions of Applications, Situations and Functions Applicable to Gesture Interface

  • Ryu, Tae-Beum;Lee, Jae-Hong;Song, Joo-Bong;Yun, Myung-Hwan
    • Journal of the Ergonomics Society of Korea
    • /
    • v.31 no.4
    • /
    • pp.507-513
    • /
    • 2012
  • Objective: This study developed a hierarchy of conditions of applications(devices), situations and functions which are applicable to gesture interface. Background: Gesture interface is one of the promising interfaces for our natural and intuitive interaction with intelligent machines and environments. Although there were many studies related to developing new gesture-based devices and gesture interfaces, it was little known which applications, situations and functions are applicable to gesture interface. Method: This study searched about 120 papers relevant to designing and applying gesture interfaces and vocabulary to find the gesture applicable conditions of applications, situations and functions. The conditions which were extracted from 16 closely-related papers were rearranged, and a hierarchy of them was developed to evaluate the applicability of applications, situations and functions to gesture interface. Results: This study summarized 10, 10 and 6 conditions of applications, situations and functions, respectively. In addition, the gesture applicable condition hierarchy of applications, situation and functions were developed based on the semantic similarity, ordering and serial or parallel relationship among them. Conclusion: This study collected gesture applicable conditions of application, situation and functions, and a hierarchy of them was developed to evaluate the applicability of gesture interface. Application: The gesture applicable conditions and hierarchy can be used in developing a framework and detailed criteria to evaluate applicability of applications situations and functions. Moreover, it can enable for designers of gesture interface and vocabulary to determine applications, situations and functions which are applicable to gesture interface.

The Study on the Deadlock Avoidance using the DAPN and the Adjacency Matrix (DAPN과 인접행렬을 이용한 교착상태 회피에 대한 연구)

  • Song, Yu-Jin;Lee, Jong-Kun
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.1
    • /
    • pp.1-10
    • /
    • 2006
  • The Flexible Management System (FMS) consists of parallel and concurrent machines, pieces of equipment, and carrying systems classified as buffers, tools, and routers, respectively. The concurrent flow of multiple productions in a system is competed with one another for resources and this resulting competition can cause a deadlock in FMS. Since a deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop, it is very important to detect and prevent a deadlock. Herein a new algorithm has been studied in order to detect and prevent deadlocks, after defining a relationship between the general places and resource share places in Petri nets like as DAPN: Deadlock Avoidance Petri Net. For presenting the results, the suggested algorithms were also adapted to the models that demonstrated FMS features.

  • PDF