• 한국멀티미디어학회논문지
• /
• 제5권3호
• /
• pp.316-322
• /
• 2002

본 논문에서는 파일 데이터의 실시간 재생 서비스를 제공하기 위한 UNIX파일 시스템의 연속 블록 할당에 대하여 다루고 있다. 설계된 블록 할당 방식은 사용자가 저장 데이터와 함께 지정한 소비 전송율을 지원할 수 있도록 적절한 디스크 위치에 데이터를 배치하여 실시간 재생 서비스를 지원할 수 있도록 하고 있다. 이를 위하여 데이터 전송율에 영향을 미치는 요소 중에서 가변적인 특성인 연속 블록 수와 저장 데이터들의 실린더 간격과의 관계를 분석하여 특정 실린더 간격 별로 연속 블록을 저장하는 방식을 채택하였다. UNIX시스템의 블록 할당 방식은 임의의 실린더 위치에서 연속 블록을 찾는 것이 비효율적 이기 때문에 새로운 형태의 비트맵 방식의 유휴 블록 기법을 사용하였다. 비트맵 방식의 블록 관리 기법은 파일 시스템 블록들을 비트 단위로 사용/비사용 여부를 표시하여 임의의 실린더 위치에 존재하는 블록이 사용 가능한지를 효율적으로 검색할 수 있도록 하였다.

• 한국CDE학회논문집
• /
• 제17권6호
• /
• pp.409-416
• /
• 2012

Most of the shipbuilding scheduling researches so far have been conducted with stress on the dock plan. That is due to the fact that the dock is the least extendable resource in shipyards and its overloading is difficult to resolve. However, once the dock scheduling is completed, it is also important to make a plan that make the best use of the rest of the resources in the shipyard, so that any additional cost is minimized. This study automates block allocation process by analyzing the existing manual process that designates production bays for the blocks during the midterm planning. Also, a planning scenario validation method is suggested, where block allocation scenarios based on diagrams are edited and simulated.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• pp.286-289
• /
• 2001

This paper deals with the procedures of effective mid-term Operation Planning establishment for painting shop in shipbuilding. and develop prototype system. In general, the block painting process consists of two stages such as blasting operation for surface preparation and painting operation for paint application for blocks. Weather condition is a potent Influence on those operations. The procedures consists of four steps, Load analysis, Generate alternative simulation plan. Implementation of Allocation automation module and Compare result of each simulation plan. Explain of each step. as follows, 1.step, Load analysis measure amount of assigned workload and manhour. 2.step, simulation scheme include alterable control variable such as overtime, weather. Auto allocating module carry out feasibility of simulation plan. 3.step, Allocation automation module are composed of three algorithms, as followings: - the block allocation algorithm that determines the number of blocks to be processed each day, - the team allocation algorithm that allocates blocks to worker groups. - the block arrangement algorithm that arrange blocks in blasting and painting cells. Since the block arrangement algorithm is conducted simultaneously with the team allocation algorithm, the total structure of the operating algorithms is considered to have two phases: first, daily load balancing with capacity limit and second, team allocation considering arrangement each day 4 step, Comparing result of each simulation plan. and select best simulation plan.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.355-357
• /
• 2014

임베디드 시스템에 많이 사용되는 리눅스 환경에는 Ext2, FAT, NTFS 등 다양한 파일 시스템이 사용된다. 임베디드 시스템에 탑재된 파일 시스템은 미니 하드 디스크 또는 플래시 메모리를 미디어로 채택하고 있다. 이러한 장치에 구현되는 파일 시스템의 종류는 응용 프로그램의 성능에 많은 영향을 미친다. 동일한 미디어에서 파일시스템의 성능 요인은 블록 할당과 블록 해제 오버헤드이다. 이 중에서 블록 해제 성능은 파일시스템에 따라 큰 차이를 보이지 않는다. 이 논문에서는 임베디드 시스템의 Ext2, FAT, 그리고 NTFS 파일 시스템에서 블록 할당 성능을 비교 분석한다. 그래서 어떤 경우에 어느 파일 시스템이 우수한지에 대하여 고찰한다.

• 전자공학회논문지B
• /
• 제30B권4호
• /
• pp.130-137
• /
• 1993

In this paper, A progressive coding of mean difference pyramid by Hadamard transform of the difference between two successive pyramid levels has been studied. A block adaptive bit allocation method based on ac energy of each sub-block has been proposed, which efficiently reduces the final distortion in the progressive transmission of image parameters. In our scheme, the dc energy equals the sum of the quantization errors of the Hadamard transform coefficients at previous level. Therefore proposed allocation method includes the estimation of dc energy at each pyramid level. Computer simulation results show some improvements in terms of MSE and picture quality over the conventional fixed allocation scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5234-5251
• /
• 2018

It is well-known that virtualization technology can bring many benefits not only to users but also to service providers. From the view of system security and resource utility, higher resource sharing degree and higher system reliability can be obtained by the introduction of virtualization technology in distributed cloud. The small size time-sharing multiplexing technology which is based on virtual machine in distributed cloud platform can enhance the resource utilization effectively by server consolidation. In this paper, the concept of memory block and user satisfaction is redefined combined with user requirements. According to the unbalanced memory resource states and user preference requirements in multi-virtual machine environments, a model of proper memory resource allocation is proposed combined with memory block and user satisfaction, and at the same time a memory optimization allocation algorithm is proposed which is based on virtual memory block, makespan and user satisfaction under the premise of an orderly physical nodes states also. In the algorithm, a memory optimal problem can be transformed into a resource workload balance problem. All the virtual machine tasks are simulated in Cloudsim platform. And the experimental results show that the problem of virtual machine memory resource allocation can be solved flexibly and efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.204-226
• /
• 2018

Big data processing applications have been migrated into cloud gradually, due to the advantages of cloud computing. Hadoop Distributed File System (HDFS) is one of the fundamental support systems for big data processing on MapReduce-like frameworks, such as Hadoop and Spark. Since HDFS is not aware of the co-location of virtual machines in the cloud, the default scheme of block allocation in HDFS does not fit well in the cloud environments behaving in two aspects: data reliability loss and performance degradation. In this paper, we present a novel location-aware data block allocation strategy (LDBAS). LDBAS jointly optimizes data reliability and performance for upper-layer applications by allocating data blocks according to the locations and different processing capacities of virtual nodes in the cloud. We apply LDBAS to two stages of data allocation of HDFS in the cloud (the initial data allocation and data recovery), and design the corresponding algorithms. Finally, we implement LDBAS into an actual Hadoop cluster and evaluate the performance with the benchmark suite BigDataBench. The experimental results show that LDBAS can guarantee the designed data reliability while reducing the job execution time of the I/O-intensive applications in Hadoop by 8.9% on average and up to 11.2% compared with the original Hadoop in the cloud.

• 한국통신학회논문지
• /
• 제22권4호
• /
• pp.675-684
• /
• 1997

The bit rate control algorithm which is capable of handing scene change is proposed. In MPEG-2 TM5, block variance is used to measure block activity. But block variance is not consistent with human visual system and does not differenciate the distribution of pixel values within the block. In target bit allocation process of TM5, global complexity, obtained by results of previous coded pictures, is used. Since I pictures are spaced relatively far apart, their complexity estimate is not very accurate. In the proposed algorithm local variance is used to measure block activity and detect scene change. Local variance, using deviation from the mean of neighboring pixels, well represents the distribution of pixel values within the block. If scene change is detected, the local variance information is used for target bit allocation process. Allocating target bits for I picture, the average local variance difference between previous and current I picture is considered. The experimental results show that the proposed algorithm can detect scene change very precisely and gives better picture quality and higher PSNR values than MPEG-2 TM5.

• 한국정보과학회논문지:시스템및이론
• /
• 제34권11호
• /
• pp.599-609
• /
• 2007

플래시 메모리는 덮어 쓰기 제약이나, 쓰기와 삭제 연산의 단위가 다르다는 등의 특징을 가지고 있다. 따라서 플래시 메모리를 저장장치로 사용하는 파일 시스템은 블록 클리닝을 필요로 하며 이는 파일 시스템의 주된 병목으로 작용한다. 이에 따라 본 논문에서는 플래시 메모리 기반 파일 시스템의 병목 요소인 블록 클리닝에 따른 성능향상에 대해 연구한다. 우선 블록 클리닝에 영향을 끼치는 성능 인자로서 이용률, 무효율, 순수도를 정의하였다. 이 세 가지 인자를 통해 블록 클리닝 비용을 분석한 결과, 파일 시스템 수준에서 제어 가능한 인자인 순수도가 블록 클리닝 비용에 많은 영향을 끼침을 확인할 수 있었다. 따라서 순수도를 높게 유지하여 블록 클리닝 비용을 최소화함으로서 파일시스템의 성능을 향상 시킬 수 있는 MODA 할당 정책(modification-aware)을 설계하였고, 이를 내장형 보드와 YAFFS(Yet Another Flash File System)상에 구현하였다. 실험 결과 MODA는 YAFFS의 순차 할당 기법에 비해 블록 클리닝 시간을 평균 123% 단축 시켰다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권3호
• /
• pp.924-944
• /
• 2014

This paper investigates the power allocation and outage performance of MIMO full-duplex relaying (MFDR), based on orthogonal space-time block codes (OSTBC), in cognitive radio systems. OSTBC transmission is used as a simple means to achieve multi-antenna diversity gain. Cognitive MFDR systems not only have the advantage of increasing spectral efficiency through spectrum sharing, but they can also extend coverage through the use of relays. In cognitive MFDR systems, the primary user experiences interference from the secondary source and relay simultaneously, owing to full duplexing. It is therefore necessary to optimize the transmission powers at the secondary source and relay. In this paper, we propose an optimal power allocation (OPA) scheme based on minimizing the outage probability in cognitive MFDR systems. We also analyse the outage probability of the secondary user in noise-limited and interference-limited environments in Nakagami-m fading channels. Simulation results show that the proposed schemes achieve performance improvements in terms of reducing outage probability.