• 전자공학회논문지B
• /
• 제32B권3호
• /
• pp.31-37
• /
• 1995

In this paper, we propose a programmable 16 bit DSP architecture using FIFO instruction memory. With this DSP architecture, System structure, BUS structure, instruction set ant and an assembler for system test are developed. The characteristic of this structure is that it simply fetches instructions not from RAM but from FIFO using shift operations. Accordingly, System can be designed regardless of RAM access time. One cycle is enough to execute an instruction, if instruction pipeline is operated. Another merit of this structure is that we can obtain the same effect as instruction pipelining without constructing a complex pipelined controller by decreasing the pipeline number.

• 산업경영시스템학회지
• /
• 제21권46호
• /
• pp.137-146
• /
• 1998

Most studies related to AS/RS are about operation policies or system designs. However, the studies on operation policy could not deal with various products using the single unit load system. In this paper, two different sized units are introduced and six different AS/RS operation policies are developed to process the different sized items. Computer simulation is used to evaluate AS/RS performances on various operation policies and to find the most effective operation policy for each case. The simulation model is developed using GPSS/PC and operation policies include COL-FIFO-SP, SIL-FIFO-SP, COL-RN-SP, COL-FIFO-LP, SIL-FIFO-LP and COL-RN-LP. The policies are evaluated based on the criteria of crane utilization, rack utilization, crane moving time, throughput and waiting time.

• 전기전자학회논문지
• /
• 제22권4호
• /
• pp.1214-1217
• /
• 2018

본 논문에서는 소형 $360^{\circ}$ 구강 스캐너 임베디드 보드의 개발을 제안한다. 제안하는 소형 $360^{\circ}$ 구강 스캐너 임베디드 보드은 이미지 레벨 및 전송방식 변경 부, FPGA 부, 메모리 부, FIFO to USB 전송부 등으로 구성된다. 이미지 레벨 및 전송방식 변경 부는 소형 $360^{\circ}$ 전방위 구강 렌즈와 이미지 센서를 통해 들어온 MIPI 형식의 구강 영상을 Low Power Signal Mode와 High Speed Signal Mode로 나누어 포트에 분산 입력하고 레벨 시프트를 하여 FPGA 부에 전송한다. FPGA 부에서는 $360^{\circ}$ 영상 왜곡 보정, 영상 보정, 영상 처리, 영상 압축 등의 기능 등을 수행한다. FIFO to USB 전송부에서는 FPGA 내부의 FIFO를 통해 전달되어진 RAW 데이터를 트랜시버 칩을 사용하여 USB 3.0, USB 3.1 등의 통신 규격으로 PC에 전송한다. 제안된 소형 $360^{\circ}$ 구강 스캐너 임베디드 보드의 효율을 판단하기 위하여 공인시험기관에서 실험한 결과, 보정 영상 후 초당 프레임은 60fps 이상, 데이터 전송률은 4.99Gb/s로서 높은 수준의 결과가 산출되어 그 효용성이 입증되었다.

• 한국멀티미디어학회논문지
• /
• 제7권10호
• /
• pp.1443-1451
• /
• 2004

본 논문에서는 무선 네트워크에서 모바일 호스트가 수신 호스트인 경우, 기지국에서 패킷을 전송할 때에 목적지 모바일 호스트까지의 링크 상태를 미리 예측한 후에 예측된 정보를 이용하여 전송 효율을 높일 수 있는 새로운 패킷전송 메커니즘을 제안한다. 제안된 패킷전송 메커니즘에서는 패킷을 전송하기 전에 미리 예측된 정보를 이용하여 패킷 스케줄링이 이루어지기 때문에 전체 패킷 전송 시간을 줄일 수 있는 장점을 가진다. 뿐 만 아니라 링크 상태가 좋지 않은 목적지 호스트로 향하는 패킷을 전송하지 않고 임시 FIFO 버퍼에 저장한 후에 나중에 전송함으로써, 기존의 방식에서 발생할 수 있는 HOL(Head Of Line) 블로킹 문제를 해결할 수 있다는 장점도 가진다.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1998년도 학술발표대회 논문집 제17권 2호
• /
• pp.223-226
• /
• 1998

In the Input Buffer Switch using the intial stage FIFO memory structure, It has pointed the Throughput limitation to the percent of 58.6 due to HOL(Head of Line) blocking in the DBP(Dedicated Buffer with Pointer) method, During that time, To overcome these problems, The prior papers have proposed the complicated Arbitration algorithms and Non-FIFO memory structures. and These showed the improved Throughput. But, Now, To design high speed ATM Switch which need to the tens of Giga bit/s or the tens of Tera bit/s. It has more difficulty in proceeding the priority of majority and the complicated Cell Scheduling, because of the problem in operating the control speed of the ratio of N to scanning each port and scheduling the Cell. In this paper, To overcome these problems, We could show more the improved performance than the existing DBP Window policy to design high speed ATM Switch.

• 대한교통학회지
• /
• 제20권1호
• /
• pp.101-110
• /
• 2002

본 연구는 통행배분 모형과 네트워크 로딩의 일반적인 원리 및 그 관계를 규명하고. 시간을 고려한 네트워크 로딩방법 즉, 동적네트워크 로딩 방법을 소개한다. 우선 본 연구에서는, 동적 네트워크 로딩을 올바로 구현하기 위해 인과성 (causality), FIFO(First-In-First-Out), 교통량전파(flow propagation), 교통류보존(flow conservation) 등의 조건이 만족되어야 함을 제기한다. 그리고, 구체적인 동적 네트워크 로딩 방법을 알고리즘 형식으로 설명하였으며, 이후 링크 비용함수로써 결정적 대기행렬모형을 도입하여 가상 네트워크 속에서 동적 네트워크 로딩이 어떻게 이루어지는지를 수치적으로 보여준다.

• 대한수학회지
• /
• 제38권4호
• /
• pp.807-842
• /
• 2001

This paper summarizes recent development of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 pradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.118-126
• /
• 2009

This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.

• 산업경영시스템학회지
• /
• 제13권21호
• /
• pp.133-141
• /
• 1990

Human blood is a perishable product : it has a legal lifetime of 21 days from collection, during which it can be used for transfusion to a Patient of the same type, and after which it has to be discarded. Therefore, blood must be supplied safely and effectively because it is one of the medical resources which keep humanlife. In this study, the effects of blood issuing policies on average inventory levels and average age of blood at transfusion are determined by simulation applied the theory of absorbing Markov chains. And as a practical study, the daily demand distribution of blood is estimated by using the data of B General Hospital. The distribution estimated follows poisson distribution and the estimator of parameter estimated from the poisson distribution is 0.762. Simulation is done by using the parameter. The most important problem when control blood is the amount of outdata. So we compared random policy with Modified LIFO and Modified FIFO by using outdata. As a results it is shown that Modified LIFO and Modified FIFO by using outdata. As a results it Is shown that Modified LIFO and Modified FIFO present better issuing policy than Random Policy.

• Industrial Engineering and Management Systems
• /
• 제7권1호
• /
• pp.23-33
• /
• 2008

This paper proposes an approach to monitoring and scheduling methods for repetitive MIMO-FIFO DESs. We use max-plus algebra for modeling and formulation, known as an effective approach for controller design for this type of system. Because a certain type of linear equations in max-plus algebra can represent the system's behavior, the principal concerns in past researches were how to solve the equations. However, the researches focused mainly on analyses of the relation between inputs and outputs of the system, which implies that the changes or the slacks of internal states were not clarified well. We first examine several properties of the corresponding state variables, which contribute to finding and tracing the float times in each process. Moreover, we provide a rescheduling method that can take into account delays or changes of the internal states. These methods would be useful in schedule control or progress management.