• Title/Summary/Keyword: 시간 제한

Search Result 3,442, Processing Time 0.032 seconds

Test Scheduling Algorithm of System-on-a-Chip Using Extended Tree Growing Graph (확장 나무성장 그래프를 이용한 시스템 온 칩의 테스트 스케줄링 알고리듬)

  • 박진성;이재민
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.3
    • /
    • pp.93-100
    • /
    • 2004
  • Test scheduling of SoC (System-on-a-chip) is very important because it is one of the prime methods to minimize the testing time under limited power consumption of SoC. In this paper, a heuristic algorithm, in which test resources are selected for groups and arranged based on the size of product of power dissipation and test time together with total power consumption in core-based SoC is proposed. We select test resource groups which has maximum power consumption but does not exceed the constrained power consumption and make the testing time slot of resources in the test resource group to be aligned at the initial position in test space to minimize the idling test time of test resources. The efficiency of proposed algorithm is confirmed by experiment using ITC02 benchmarks.

Automatic payload data dump for the LEO satellite (저궤도위성 탑재체 데이터 자동 전송)

  • Chae, Dong-Seok;Yang, Seung-Eun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.641-642
    • /
    • 2011
  • 저궤도 위성은 지상과의 접축시간이 극히 제한되어 있어 위성에서 생성된 원격측정 데이터들을 위성의 대용량 메모리에 저장하였다가 지상과의 접촉시간에 저장된 데이터를 지상으로 전송하는 방식으로 운영된다. 위성에 저장할 수 있는 전체 데이터 크기는 대용량 메모리의 크기와 지상과의 통신 가용시간에 따라 제한을 받게 된다. 대용량 메모리 저장용량과 다운링크 버짓을 만족해야 하므로 일반적으로 각 탑재체로부터 수신하여 위성에 저장되는 원격측정 데이터들은 종류별로 일정한 주기를 가지게 되고 그 크기도 고정되어 있다. 그리고 각 데이터 종류별로 저장여부를 지상명령으로 조절할 수 있도록 되어 있다. 그러나 생성되는 데이터가 일정하지 않고 비주기성을 갖는 경우 데이터량을 예측할 수 없으므로 지상명령으로 데이터 저장여부를 제어하는 것은 거의 불가능하다. 이러한 경우에 생성되는 데이터량을 모니터링하면서 데이터를 전송할 수 있는 자동화된 데이터 통신 방식이 요구된다. 본 논문은 저궤도 위성 탑재체에서 비주기적으로 생성되는 데이터를 자동으로 전송받기 위한 데이터 자동 전송기능과 시험 결과에 대해서 기술하였다.

A Robust Decorrelating Multiuser Detector for Asynchronous DS/CDMA Communication Systems (비동기 DS/CDMA 시스템을 위한 역상관 다중사용자 검출기)

  • Yoon, Seok-Hyun;Lee, Kyung-Ha;Hong, Kwang-Seok
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.6
    • /
    • pp.1-8
    • /
    • 1998
  • This paper presents an asynchronous DS/CDMA multiuser detector, which is a two stage, symbol-by-symbol scheme consisting of conventional detectors followed by linear decorrelating detectors. The conventional detector first makes temporal decisions and the detected symbols are delayed by one symbol period to be used for the selection of decorrelating bases in the subsequent decorrelaing detection stage. It also employs a bank of early-late correlators in place of a bank of single correlators taking the small offset of chip timing asynchronism into account. The proposed detector requires only the coarse knowledge of relative time delays of interfering users and is suitable for digital implementation. To verify the detector performance, the analytical BER performance will be given and compared with the simulation results for BPSK DS/CDMA signals in AWGN channel. While the performance of the proposed detector will be analyzed for time-limited signal, the simulation is carried out for both the time-limited and band-limited signals. As can be seen in the simulation results, the proposed scheme shows good results.

  • PDF

A Boundness Analysis of Performance on the Nested Queueing Network with Population Constraint (용량제한을 갖는 중첩형 대기행렬 네트워크의 성능 범위분석)

  • Rhee, Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.4
    • /
    • pp.239-246
    • /
    • 2009
  • In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.

Time-lapse Inversion of 2D Resistivity Monitoring Data (2차원 전기비저항 모니터링 자료의 시간경과 역산)

  • Kim, Ki-Ju;Cho, In-Ky;Jeoung, Jae-Hyeung
    • Geophysics and Geophysical Exploration
    • /
    • v.11 no.4
    • /
    • pp.326-334
    • /
    • 2008
  • The resistivity method has been used to image the electrical properties of the subsurface. Especially, this method has become suitable for monitoring since data could be rapidly and automatically acquired. In this study, we developed a time-lapse inversion algorithm for the interpretation of resistivity monitoring data. The developed inversion algorithm imposes a big penalty on the model parameter with small change, while a minimal penalty on the model parameter with large change compared to the reference model. Through the numerical experiments, we can ensure that the time-lapse inversion result shows more accurate and focused image where model parameters have changed. Also, applying the timelapse inversion method to the leakage detection of an embankment dam, we can confirm that there are three major leakage zones, but they have not changed over time.

Techniques to Guarantee Real-Time Fault Recovery in Spark Streaming Based Cloud System (Spark Streaming 기반 클라우드 시스템에서 실시간 고장 복구를 지원하기 위한 기법들)

  • Kim, Jungho;Park, Daedong;Kim, Sangwook;Moon, Yongshik;Hong, Seongsoo
    • Journal of KIISE
    • /
    • v.44 no.5
    • /
    • pp.460-468
    • /
    • 2017
  • In a real-time cloud environment, the data analysis framework plays a pivotal role. Spark Streaming meets most real-time requirements among existing frameworks. However, the framework does not meet the second scale real-time fault recovery requirement. Spark Streaming fault recovery time increases in proportion to the transformation history length called lineage. This is because it recovers the last state data based on the cumulative lineage recorded during normal operation. Therefore, fault recovery time is not bounded within a limited time. In addition, it is impossible to achieve a second-scale fault recovery time because it costs tens of seconds to read initial state data from fault-tolerant storage. In this paper, we propose two techniques to solve the problems mentioned above. We apply the proposed techniques to Spark Streaming 1.6.2. Experimental results show that the fault recovery time is bounded and the average fault recovery time is reduced by up to 41.57%.

The Effects of Time Monitoring and Goal Orientation on Persuasion (시간 모니터링과 목표지향이 설득에 미치는 영향)

  • Min, Dongwon
    • Journal of Digital Convergence
    • /
    • v.18 no.8
    • /
    • pp.103-109
    • /
    • 2020
  • The aim of this research is to investigate the effect of how individuals monitor the time in their life on persuasion and the moderating role of goal orientation and types of persuasive message in the relationship between time monitoring and persuasion. By controlling participants' time horizon perspectives (THPs), an experiment using a 2 (THP: limited vs. expansive) × 3 (goal orientation: approach vs. avoidance vs. control) × 2 (message type: emotional vs. knowledge-related) between-subjects design was conducted.. Results showed that when participants with limited THP, those who oriented avoidance goals were more favorable to knowledge-related messages, whereas those who oriented approach goals preferred emotional messages. Participants with expansive THP were more persuaded by knowledge-related messages, regardless of pursuing goal types.

Synthesis of Asynchronous Circuits from Free-Choice Signal Transition Graphs with Timing Constraints (시간 제한 조건을 가진 자유 선택 신호 전이 그래프로부터 비동기 회로의 합성)

  • Jeong, Seong-Tae;Jeong, Seok-Tae
    • The KIPS Transactions:PartA
    • /
    • v.9A no.1
    • /
    • pp.61-74
    • /
    • 2002
  • This paper presents a method which synthesizes asynchronous circuits from free-choice Signal Transition Graphs (STGs) with timing constraints. The proposed method synthesizes asynchronous circuits by analyzing: the relations between signal transitions directly from the STGs without generating state graphs. The synthesis procedure decomposes a free-choice STG into deterministic STGs which do not have choice behavior. Then, a timing analysis extracts the timed concurrency and tamed causality relations between any two signal transitions for each deterministic STG. The synthesis procedure synthesizes circuits for each deterministic STG and synthesizes the final circuit by merging the circuits for each deterministic STG. The experimental results show that our method achieves significant reductions in synthesis time for the circuits which have a large state space, and generates circuits that have nearly the same area as compared to previous methods.

Radiological Consequence of LOCA for a 900MWe French PWR (프랑스형 900 MWe PWR 에서 냉각재상실사고의 방사선학적 영향)

  • Moon, Kwang-Nam;Yook, Chong-Chul
    • Journal of Radiation Protection and Research
    • /
    • v.12 no.1
    • /
    • pp.40-47
    • /
    • 1987
  • The amount of the radionuclide release to the environment during a LOCA and its radiological consequence are assessed, for a 900MWe French PWR which is similar to the KNU 9/10, according to RFS V.1.a, in which the source term has been revised more conservatively after the TMI accident. The assessed result shows that the whole body and thyroid doses at the site boundary(500m) for 2 hours after the release are 66 mrem and 13.5 rem, respectively, and are within the corresponding limits. It is expected, however, that the thyroid dose would exceed the limit if the fraction of the organic iodine is over 10% of the iodine inventory.

  • PDF

Development of OWL Scheduler (OWL 스케줄러 개발)

  • Im, Hong-Seo;Park, Seon-Yeop;Kim, Jae-Hyeok;Choe, Jin;Jo, Jung-Hyeon;Lee, Jeong-Ho;Jin, Ho;Geum, Gang-Hun;Park, Yeong-Sik;Bae, Yeong-Ho;Choe, Yeong-Jun;Mun, Hong-Gyu;Park, Jang-Hyeon
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.37 no.2
    • /
    • pp.221.2-221.2
    • /
    • 2012
  • 우주물체 전자광학 감시체계(OWL: Optical Wide-field Patrol)는 관측소들의 자동운영을 통한 인공위성의 궤도정보추출이 목적이다. 이를 위해 각각의 관측소에서 매일 밤 운영되어야 하는 관측명령을 자동으로 생성하는 스케줄러를 개발하였다. 스케줄러는 OWL 본부가 설치될 한국천문연구원의 NOS(Network Operating System) 서버에 설치 운영된다. 스케줄러는 사용자가 정한 관측대상 인공위성의 관측우선순위와 OC(Orbit Calculation) 서브시스템이 제공한 위성궤도정보를 바탕으로, 시간에 따른 관측수행내용을 기록한 관측명령서(OCF: Observation Command File)를 작성한다. 작성된 OCF는 각 관측소가 관측을 시작하기 전까지 해당 관측소로 전달되며, 관측소는 OCF를 바탕으로 관측을 수행하게 된다. 스케줄러는 "제한조건반영" 및 "OCF작성" 등 2부분으로 구성된다. "제한조건반영"은 관측시스템의 특징을 스케줄러에 반영하는 단계로써 시야각 등 광학계의 특징, 필터 등 주변 장비의 특징, CCD 카메라의 노출대기시간 등 검출기의 특징 등이 이에 포함된다. 사용자는 장비의 교체 및 개선 등 관측시스템 변경이 발생하는 경우 "제한조건반영"에 이를 적용함으로써 스케줄러가 새로운 시스템에 쉽게 적용할 수 있다. "OCF작성"은 "제한조건반영"의 내용을 바탕으로 관측대상위성을 선정하는 , 위성 관측 구간 중 최대한 많은 노출 횟수를 산출하는 , 한 장의 영상에서 최대한 많은 궤도 정보를 획득하기 위한 등 3개의 알고리즘에 의해 OCF를 작성한다.

  • PDF