• Title/Summary/Keyword: Graph theory

Search Result 391, Processing Time 0.025 seconds

A Novel Processor Allocation Policy for List Scheduling in Distributed Heterogeneous Computing System (분산 이기종 시스템에서 리스트 스케줄링 알고리즘을 위한 새로운 프로세서 할당 정책)

  • Yoon, Wan-Oh;Song, In-Seong;Yoon, Jun-Chol;Choi, Sang-Bang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.2
    • /
    • pp.76-89
    • /
    • 2010
  • The performance of Distributed Heterogeneous Computing System depends on the algorithm which schedules input DAG graph. Among various scheduling algorithms, list scheduling algorithm provides superior performance with low complexity. List scheduling consists of task prioritizing phase and processor allocation phase, but most studies only focus on task prioritizing phase. In this paper, we propose LIP policy which has the same complexity with traditional allocation policies but has superior performance. The performance of LIP has been observed by applying them to task prioritizing phase of traditional list scheduling algorithms, HCPT, HEFT, GCA, and PETS. The results show that LIP has better performance than insertion-based policy and non-insertion-based policy, which are traditional processor allocation policies.

A Method to Evaluate Distance Efficiency of Seoul Metropolitan Subway by Estimating Subway Detour Factor (지하철 우회계수 산정을 통한 수도권 지하철의 거리 효율 평가 모형)

  • LEE, Jae Min;KIM, Nam Seok
    • Journal of Korean Society of Transportation
    • /
    • v.33 no.3
    • /
    • pp.304-314
    • /
    • 2015
  • Detour of metro (subway) in metropolitan area has been regarded as one of inherent elements that make entire metro system less competitive than passenger cars. However, factors affecting detour of metro line is not specified clearly when a new subway system is planned or an existing system is improved. Previous detour-related studies was reviewed for developing 'distance efficeincy evaluation model' for metro as well as its counterpart (i.e. road). Metro line 3 (orange line) of Seoul metropolitan area was applied as a case study. As a results, the most detoured OD segment is Daechi - Apgujeong and its detour factor is 1.93 which means that the distance of the metro is 1.93 times longer distance compared to the distance of the road. The metro line 3 has averagely 20% longer distance compared to road for the identical O/D pairs.

System-Level Fault Diagnosis using Graph Partitioning (그래프 분할을 이용한 시스템 레벨 결함 진단 기법)

  • Jeon, Gwang-Il;Jo, Yu-Geun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.12
    • /
    • pp.1447-1457
    • /
    • 1999
  • 본 논문에서는 일반적인 네트워크에서 적응력 있는(adaptive) 분산형 시스템 레벨 결함 진단을 위한 분할 기법을 제안한다. 적응력 있는 분산형 시스템 레벨 결함 진단 기법에서는 시스템의 형상이 변경될 때마다 시험 할당 알고리즘이 수행되므로 적응력 없는 결함 진단 기법에 비하여 결함 감지를 위한 시험의 갯수를 줄일 수 있다. 기존의 시험 할당 알고리즘들은 전체 시스템을 대상으로 하는 비분할(non-partitioning) 방식을 이용하였는데, 이 기법은 불필요한 과다한 메시지를 생성한다. 본 논문에서는 전체 시스템을 이중 연결 요소(biconnected component) 단위로 분할한 후, 시험 할당은 각 이중 연결 요소 내에서 수행한다. 이중 연결 요소의 관절점(articulation point)의 특성을 이용하여 각 시험 할당에 필요한 노드의 수를 줄임으로서, 비분할 기법들에 비해 초기 시험 할당에 필요한 메시지의 수를 감소시켰다. 또한 결함이 발생한 경우나 복구가 완료된 경우의 시험 재 할당은 직접 영향을 받는 이중 연결 요소내로 국지화(localize) 시켰다. 본 논문의 시스템 레벨 결함 진단 기법의 정확성을 증명하였으며, 기존 비분할 방식의 시스템 레벨 결함 진단 기법과의 성능 분석을 수행하였다.Abstract We propose an adaptive distributed system-level diagnosis using partitioning method in arbitrary network topologies. In an adaptive distributed system-level diagnosis, testing assignment algorithm is performed whenever the system configuration is changed to reduce the number of tests in the system. Existing testing assignment algorithms adopt a non-partitioning approach covering the whole system, so they incur unnecessary extra message traffic and time. In our method, the whole system is partitioned into biconnected components, and testing assignment is performed within each biconnected component. By exploiting the property of an articulation point of a biconnected component, initial testing assignment of our method performs better than non-partitioning approach by reducing the number of nodes involved in testing assignment. It also localizes the testing reassignment caused by system reconfiguration within the related biconnected components. We show that our system-level diagnosis method is correct and analyze the performance of our method compared with the previous non-partitioning ones.

Progressive Reconstruction of 3D Objects from a Single Freehand Line Drawing (Free-Hand 선화로부터 점진적 3차원 물체 복원)

  • 오범수;김창헌
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.3_4
    • /
    • pp.168-185
    • /
    • 2003
  • This paper presents a progressive algorithm that not only can narrow down the search domain in the course of face identification but also can fast reconstruct various 3D objects from a sketch drawing. The sketch drawing, edge-vertex graph without hidden line removal, which serves as input for reconstruction process, is obtained from an inaccurate freehand sketch of a 3D wireframe object. The algorithm is executed in two stages. In the face identification stage, we generate and classify potential faces into implausible, basis, and minimal faces by using geometrical and topological constraints to reduce search space. The proposed algorithm searches the space of minimal faces only to identify actual faces of an object fast. In the object reconstruction stage, we progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order of faces. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. Furthermore, it allows the designer to change viewpoint during sketching. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

A Study of Routing based on Adjacency Matrix in Ad hoc Networks (애드 혹 네트워크에서 인접 행렬 기반의 라우팅 연구)

  • Lee, Sung-Soo;Kim, Jeong-Mi;Park, Hee-Joo;Kim, Chong-Gun
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.531-538
    • /
    • 2008
  • With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.

A Period Assignment Algorithm for Real-Time System Design (실시간 시스템 설계를 위한 주기 할당 알고리즘)

  • Ryu, Min-Soo;Hong, Seong-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.1
    • /
    • pp.61-67
    • /
    • 2000
  • Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [1]. Given a task graph design allowing producer/consumer relationships among tasks [2], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a ploynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.

  • PDF

Differences in Large-scale and Sliding-window-based Functional Networks of Reappraisal and Suppression

  • Jun, Suhnyoung;Lee, Seung-Koo;Han, Sanghoon
    • Science of Emotion and Sensibility
    • /
    • v.21 no.3
    • /
    • pp.83-102
    • /
    • 2018
  • The process model of emotion regulation suggests that cognitive reappraisal and expressive suppression engage at different time points in the regulation process. Although multiple brain regions and networks have been identified for each strategy, no articles have explored changes in network characteristics or network connectivity over time. The present study examined (a) the whole-brain network and six other resting-state networks, (b) their modularity and global efficiency, which is an index of the efficiency of information exchange across the network, (c) the degree and betweenness centrality for 160 brain regions to identify the hub nodes with the most control over the entire network, and (d) the intra-network and inter-network functional connectivity (FC). Such investigations were performed using a traditional large-scale FC analysis and a relatively recent sliding window correlation analysis. The results showed that the right inferior orbitofrontal cortex was the hub region of the whole-brain network for both strategies. The present findings of temporally altering functional activity of the networks revealed that the default mode network (DMN) activated at the early stage of reappraisal, followed by the task-positive networks (cingulo-opercular network and fronto-parietal network), emotion-processing networks (the cerebellar network and DMN), and sensorimotor network (SMN) that activated at the early stage of suppression, followed by the greater recruitment of task-positive networks and their functional connection with the emotional response-related networks (SMN and occipital network). This is the first study that provides neuroimaging evidence supporting the process model of emotion regulation by revealing the temporally varying network efficiency and intra- and inter-network functional connections of reappraisal and suppression.

Modeling and Implementation of the Affordance-based Human-Machine Collaborative System (어포던스 기반의 인간-기계 협업 모델을 이용한 제조 시스템 구현 연구)

  • Oh, Yeong Gwang;Ju, Ikchan;Lee, Wooyeol;Kim, Namhun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.1
    • /
    • pp.34-42
    • /
    • 2015
  • Modeling and control of human-involved manufacturing systems poses a huge challenge on how to model all possible interactions among system components within the time and space dimensions. As the manufacturing environment are getting complicated, the importance of human in the manufacturing system is getting more and more spotlighted to incorporate the manufacturing flexibility. This paper presents a formal modeling methodology of affordance-based MPSG (Message-based Part State Graph) for a human-machine collaboration system incorporating supervisory control scheme for flexible manufacturing systems in automotive industry. Basically, we intend to extend the existing model of affordance-based MPSG to the real industrial application of humanmachine cooperative environments. The suggested extension with the real industrial example is illustrated in three steps; first, the manufacturing process and relevant data are analyzed in perspectives of MABA-MABA and the supervisory control; second, the manufacturing processes and task allocation between human and machine are mapped onto the concept of MABA-MABA; and the last, the affordance-based MPSG of humanmachine collaboration for the manufacturing process is presented with UMLs for verification.

Line Drawings from 2D Images (이차원 영상의 라인 드로잉)

  • Son, Min-Jung;Lee, Seung-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.12
    • /
    • pp.665-682
    • /
    • 2007
  • Line drawing is a widely used style in non-photorealistic rendering because it generates expressive descriptions of object shapes with a set of strokes. Although various techniques for line drawing of 3D objects have been developed, line drawing of 2D images has attracted little attention despite interesting applications, such as image stylization. This paper presents a robust and effective technique for generating line drawings from 2D images. The algorithm consists of three parts; filtering, linking, and stylization. In the filtering process, it constructs a likelihood function that estimates possible positions of lines in an image. In the linking process, line strokes are extracted from the likelihood function using clustering and graph search algorithms. In the stylization process, it generates various kinds of line drawings by applying curve fitting and texture mapping to the extracted line strokes. Experimental results demonstrate that the proposed technique can be applied to the various kinds of line drawings from 2D images with detail control.

Semantics Aware Packet Scheduling for Optimal Quality Scalable Video Streaming (다계층 멀티미디어 스트리밍을 위한 의미기반 패킷 스케줄링)

  • Won, Yo-Jip;Jeon, Yeong-Gyun;Park, Dong-Ju;Jeong, Je-Chang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.722-733
    • /
    • 2006
  • In scalable streaming application, there are two important knobs to tune to effectively exploit the underlying network resource and to maximize the user perceivable quality of service(QoS): layer selection and packet scheduling. In this work, we propose Semantics Aware Packet Scheduling (SAPS) algorithm to address these issues. Using packet dependency graph, SAPS algorithm selects a layer to maximize QoS. We aim at minimizing distortion in selecting layers. In inter-frame coded video streaming, minimizing packet loss does not imply maximizing QoS. In determining the packet transmission schedule, we exploit the fact that significance of each packet loss is different dependent upon its frame type and the position within group of picture(GOP). In SAPS algorithm, each packet is assigned a weight called QoS Impact Factor Transmission schedule is derived based upon weighted smoothing. In simulation experiment, we observed that QOS actually improves when packet loss becomes worse. The simulation results show that the SAPS not only maximizes user perceivable QoS but also minimizes resource requirements.