• 정보과학회 논문지
• /
• 제44권3호
• /
• pp.223-231
• /
• 2017

본 논문에서는 최근 광범위하게 사용되고 있는 멀티 코어 환경에서의 모바일 장치의 성능에 대하여 연구하였다. 이전에 연구되어왔던 멀티 코어의 성능에 대한 분석은, 대부분 데스크톱 PC에서의 분석이었고, heterogeneous 멀티 코어에 대한 분석방법이 충분하지 않았다. 이러한 문제점을 보완하고자 homogeneous 멀티 코어의 분석 방법을 응용한 heterogeneous 멀티 코어 환경에서 성능을 분석하는 방법을 제안하였다. 본 연구에서는 이를 분석하는 데 있어서 작업의 할당에는 Size Interval Task Allocation (SITA) 기법을 사용하였고, 코어에서의 처리 방법은 Shortest Remaining Processing Time (SRPT) 기법을 사용하였다. 이 중 SITA 기법에서 가장 중요한 분석인 cutoff point에 대한 새로운 계산 방법을 제안하였고, 이를 체류 시간을 계산하는 데 사용함으로써 계산의 용이성과 정확성을 높였다. 또한, ESESC 시뮬레이터에서의 측정을 통해 분석값과 측정값에 큰 차이가 없음을 확인하였다.

• 대한수학회지
• /
• 제32권4호
• /
• pp.725-737
• /
• 1995

Let $X_t = (X_t^(1), X_t^(2))', t \geqslant 0$, be a real stationary 2-dimensional Gaussian process with $EX_t^(1) = EX_t^(2) = 0$ and $$ EX_0 X'_t = (_{\rho(t) r(t)}^{r(t) \rho(t)}), $$ where $r(t) \sim $\mid$t$\mid$^-\alpha, 0 < \alpha < 1/2, \rho(t) = o(r(t)) as t \to \infty, r(0) = 1, and \rho(0) = \rho (0 \leqslant \rho < 1)$. For $t > 0, u > 0, and \upsilon > 0, let L_t (u, \upsilon)$ be the time spent by $X_s, 0 \leqslant s \leqslant t$, above the level $(u, \upsilon)$.

• ETRI Journal
• /
• 제25권4호
• /
• pp.238-246
• /
• 2003

This paper introduces the modeling and analysis of a discrete-time, two-phase queueing system for both exhaustive batch service and gated batch service. Packets arrive at the system according to a Bernoulli process and receive batch service in the first phase and individual services in the second phase. We derive the probability generating function (PGF) of the system size and show that it is decomposed into two PGFs, one of which is the PGF of the system size in the standard discrete-time Geo/G/1 queue without vacations. We also present the PGF of the sojourn time. Based on these PGFs, we present useful performance measures, such as the mean number of packets in the system and the mean sojourn time of a packet.

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.749-757
• /
• 2012

We consider the M/PH,G/1 queue with two classes of customers in which class-1 customers have deterministic impatience time and have preemptive priority over class-2 customers who are assumed to be infinitely patient. The service times of class-1 and class-2 customers have a phase-type distribution and a general distribution, respectively. We obtain performance measures of class-2 customers such as the queue length distribution, the waiting time distribution and the sojourn time distribution, by analyzing the busy period of class-1 customers. We also compute the moments of the queue length and the waiting and sojourn times.

• 대한산업공학회지
• /
• 제34권2호
• /
• pp.140-150
• /
• 2008

Point Coordination Function (PCF) of the IEEE 802.11 protocol providing a centrally-controlled polling-based multiple access to a wireless channel is very efficient in high load conditions. However, its performance degrades with increasing the number of terminals and decreasing the load, because of wastes related to unsuccessful polling attempts. To solve the problem, we propose and study analytically the generic dynamic polling policy using backoff concept. For this aim, we develop Markov models describing the network queues changes, what allows us to estimate such performance measures as the average MAC service time and the average MAC sojourn time, to show the dynamic polling efficiency and to tune optimally the backoff rule.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.514-514
• /
• 1994

• Management Science and Financial Engineering
• /
• 제2권1호
• /
• pp.123-145
• /
• 1996

We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.895-909
• /
• 2013

Distributed Denial-of-Service (DDoS) attacks towards name servers of the Domain Name System (DNS) have threaten to disrupt this critical service. This paper studies the vulnerability of the cache server to the flooding DNS query traffic. As the resolution service provided by cache server, the incoming DNS requests, even the massive attacking traffic, are maintained in the waiting queue. The sojourn of requests lasts until the corresponding responses are returned from the authoritative server or time out. The victim cache server is thus overloaded by the pounding traffic and thereafter goes down. The impact of such attacks is analyzed via the model of queuing process in both cache server and authoritative server. Some specific limits hold for this practical dual queuing process, such as the limited sojourn time in the queue of cache server and the independence of the two queuing processes. The analytical results are presented to evaluate the impact of DDoS attacks on cache server. Finally, numerical results are provided for further analysis.

• 한국ITS학회 논문지
• /
• 제8권2호
• /
• pp.100-107
• /
• 2009

이동 셀룰라 시스템에서 단말의 속도를 알아내는 것은 효율적인 시스템 운영을 위해 꼭 필요한 일이다. 그동안 여러 가지 이동체의 속도 추정 방안이 제안되어 왔는데, 이 논문에서는 적응형 어레이 안테나를 이용해 간단하게 속도를 추정하는 방안을 제안한다. 제안하는 방안은 이동체의 속도를 이동 거리 정보와 상주시간 정보를 이용해 추정한다. 이 방안은 추가적인 코스트 부담 없이 정확하게 속도를 추정할 수 있다. 제안하는 방안의 성능 분석을 위해 본 논문에서는 수학적 분석과 시뮬레이션을 수행하였고 그 결과 제안하는 방안이 만족할만한 성능을 보여주는 것을 알 수 있었다.

• 한국시뮬레이션학회논문지
• /
• 제13권1호
• /
• pp.1-9
• /
• 2004

In this paper some models for obtaining the distribution of a sojourn time in CDMA cellular systems are proposed. Knowledge on this is essential for reliable modeling of the soft handoff and for solving other related problems in the analysis of cellular system. The proposed model is based on random walk and can be adopted to different conditions. Analytical results can be obtained that lead to a quite complicated numerical scheme so simulation models are used for Monte Carlo experiments. Main assumptions include different kinds of mobile carriers (pedestrians and transport passengers) and round shape of a cell. The scheme for simulation experiments is presented along with the discussion of simulation results.