• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.73-76
• /
• 2000

We investigate the stepwise parallel processing of the serial search which can success the co]1 search at low Ec/Io. The single path Rayleigh fading channel which is worst-case channel model is considered. The typical 3-step cell search is used. The probabilities of detection, miss and false alarm for each step are used in closed forms based on the statistics of CDMA noncoherent demodulator output. The optimal power allocation to each channel and The optimal number of post-detection integrations for each step is obtained. Also, the cumulative probability distribution of the average eel] search time for serial search methods are compared.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.157-162
• /
• 2005

Parallel implementation and performance assessment of the grid assembly in a structured chimera grid approach is studied. The grid assembly process, involving hole cutting and searching donor, is parallelized on the PC cluster. A message passing programming model based on the MPI library is implemented using the single program multiple data(SPMD) paradigm. The coarse-grained communication is optimized with the minimized memory allocation because that the parallel grid assembly can access the decomposed geometry data in other processors by only message passing in the distributed memory system such as a PC cluster. The grid assembly workload is based on the static load balancing tied to flow solver. A goal of this work is a development of parallelized grid assembly that is suited for handling multiple moving body problems with large grid size.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.4
• /
• pp.193-199
• /
• 2012

Virtualization allows multiple commodity operating systems to share on a single physical machine. Resource allocation among virtual machines is a key to determine virtual machine performance. To satisfy time-sensitive task on a domain, hypervisor needs to observe the resource requirements and allocates proper amount of CPU resources in a timely manner. In this paper, we propose a realtime credit scheduler for latency sensitive application on virtual machines. The key idea is to register a time event in the Xen hypervisor. Experiment result shows that the proposed scheme is superior to Credit scheduler.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.731-742
• /
• 2010

We propose an incremental relaying protocol in conjunction with opportunistic communication for differential modulation with an aim to make efficient use of the degrees of freedom of the channels by exploiting a imited feedback signal from the destination. In particular, whenever the direct link from the source to the destination is not favorable to decoding, the destination will request the help from the opportunistic relay (if any). The performance of the proposed system is derived in terms of average bit error probability and achievable spectral efficiency. The analytic results show that the system assisted by the opportunistic relaying can achieve full diversity at low SNR regime and exhibits a 30㏈ gain relative to direct transmission, assuming single-antenna terminals. We also determine the effect of power allocation on the bit error probability BEP) performance of our relaying scheme. We conclude with a discussion on the relationship between the given thresholds and channel resource savings. Monte-Carlo simulations are performed to verify the analysis.

• ETRI Journal
• /
• v.39 no.2
• /
• pp.255-263
• /
• 2017

This paper proposes a graph-theatrical approach to optimize spatial reuse by adopting a technique that quantizes the channel information into single bit sub-messages. First, we introduce an interference graph to model the network topology. Based on the interference graph, the computational requirements of the algorithm that computes the optimal spatial reuse factor of each user are reduced to quasilinear time complexity, ideal for practical implementation. We perform a resource allocation procedure that can maximize the efficiency of spatial reuse. The proposed spatial reuse scheme provides advantages in beamforming systems, where in the interference with neighbor nodes can be mitigated by using directional beams. Based on results of system level measurements performed to illustrate the physical interference from practical millimeter wave wireless links, we conclude that the potential of the proposed algorithm is both feasible and promising.

• Management & Information Systems Review
• /
• v.13
• /
• pp.127-140
• /
• 2003

Although there have been continual researches in the project scheduling problems since 1960s, the main interest has been how to improve the efficiency of a single project. The minimization problem of the project completion time given a preassigned budget might be an example. This kind of the problem is important, but estimating of the proper budget for a project may also be very important. This research deals with the budget allocation problem for the multiple project. This research is unique in that the project scheduling techniques are used for the budgeting problem. Therefore, this research may be used as a strategic decision model for the multiple large projects in public sector.

• Proceedings of the Korean Reliability Society Conference
• /
• 2000.11a
• /
• pp.399-404
• /
• 2000

Redundancy allocation problems have been considered at single-level systems and it may be the best policy in some specific situations, but not in general. With regards to reliability, it is most effective to allocate the lowest objects, because parallel-series systems are more reliable than series-parallel systems. However, the smaller and tower in the system an object is, the more time and accuracy are needed for duplicating it, and so, the cost can be decreased by using modular redundancy. Therefore, providing redundancy at high levels like as modules or subsystems, can be more economical than providing redundancy at low levels or duplicating components. In this paper, the problem in which redundancy is allocated at all level in a series system is addressed, a mixed integer nonlinear programming model is presented and genetic algorithm is proposed. An example illustrates the procedure.

• Journal of the Korean Statistical Society
• /
• v.6 no.1
• /
• pp.65-76
• /
• 1977

The relative importance of single-shot kill probabilities, rates of fire, weapon allocation strategies, and the size of initial force in warfare between two force with heterogeneous multiple weapon systems are considered by examining their effect on a natural measure of effectiveness, the expected number of survivors. Attrition equations are derived via stochastic formulation to represent the mean course of battle having an underlying probability distribution. It is assumed that each side uses indirect area fires. Level of intelligence activities are reflected in the availability of spontaneous information on the current enemy status. Depending on the availability of the information on the current enemy status, each participatory unit may follow 1) a prescribed attack pattern (fraction of the available units assigned to various enemy targets) or 2) an adaptive attack pattern depending on the enemy status at that time. Conditions for possible stalemate are discussed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.607-609
• /
• 2001

셀룰러 기반의 이동 컴퓨팅환경에서는 이동 호스트(MH)의 위치와 상태관리를 위하여 디폴트 서버기법이 널리 사용되는데, 이동 호스트로 전송되는 데이터는 먼저 디폴트 서버에 문의하여 해당 삠 가 위치하는 로컬 서버로 전송된다. 디폴트 서버기법에 기반을 둔 SDN(single Default Notification)기법에서는 클라이언트가 MH 와의 연결요청을 하면 쿼리 서버를 통해 해당 디폴트 서버에 MH의 위치 및 상태를 문의한 후 통신이 이루어진다. 그러나 쿼리횟수가 많고 디폴트 서버와의 거리가 멀거나 기지국외 수가 많을 경우 디폴트 서버와의 통신 오버헤드가 커지며, 디폴트 서버에 결함이 발생할 경우 해당 MH 와의 연결이 불가능해진다. 디폴트 서버를 여러 개로 중복 시킬 경우 위와 같은 문제점을 경감시키고 디폴트 서버와의 통신 비용을 줄일 수 있다. 본 논문에서는 통신 환경에 따른 디폴트 서버의 최적의 중복 개수와 중복 위치를 구하는 방법을 제시하였고, 시뮬레이션을 통하여 수학적 방법이 유용함을 보였다.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.489-499
• /
• 2009

We describe the fundamental issue of scheduling the allocation of wireless network resources and provide several formulations of the associated problems. The emphasis is on scheduling transmission attempts. We place this problem in the context of existing approaches, like information theoretic and traditional network theoretic ones, as well as novel avenues that open up the possibility of addressing this issue for non-stationary and non-ergodic environments. We summarize concrete recent results for specific special cases that include unicast and multicast traffic, different objective functions, and reduced complexity versions of the problem. We conclude with some thoughts for future work. We identify and single out the cross-layer nature of the problem and include a simple physical-layer criterion in what is mostly a medium access control (MAC) problem.