• JSTS:Journal of Semiconductor Technology and Science
• /
• 제11권1호
• /
• pp.51-58
• /
• 2011

Extensible processors provide an efficient mechanism to boost the performance of the whole system without losing much flexibility. However, due to the intense demand of low cost and power consumption, customizing an embedded system has been more difficult than ever. In this paper, we present a framework for custom instruction generation considering both area constraints and resource sharing. We also present how we can speed up the process through pruning and library-based design space exploration.

• ETRI Journal
• /
• 제26권6호
• /
• pp.545-554
• /
• 2004

In this paper, we propose an efficient design method for area optimization in a digital filter. The conventional methods to reduce the number of adders in a filter have the problem of a long critical path delay caused by the deep logic depth of the filter due to adder sharing. Furthermore, there is such a disadvantage that they use the transposed direct form (TDF) filter which needs more registers than those of the direct form (DF) filter. In this paper, we present a hybrid structure of a TDF and DF based on the flattened coefficients method so that it can reduce the number of flip-flops and full-adders without additional critical path delay. We also propose a resource sharing method and sharing-pattern searching algorithm to reduce the number of adders without deepening the logic depth. Simulation results show that the proposed structure can save the number of adders and registers by 22 and 26%, respectively, compared to the best one used in the past.

• 한국산학기술학회논문지
• /
• 제13권4호
• /
• pp.1857-1862
• /
• 2012

소규모 도시에서는 지하철과 같은 대규모의 구축비용과 운용비용이 필요한 저공해 대중교통 시스템을 구축하기가 어렵다. 본 연구에서는 환경개선 및 자원의 효율적인 사용이 가능한 전기자동차 세어링 서비스 프레임 워크를 기반으로 하는 소규모도시를 위한 대중교통 시스템을 제시한다. 제시한 시스템의 대중교통 수단으로의 유효성을 시뮬레이션 하였으며, 세어링 시스템을 도입하는 경우 출퇴근 시간대의 혼잡도가 줄어드는 것을 알 수 있었다.

• 한국IT서비스학회지
• /
• 제15권3호
• /
• pp.173-193
• /
• 2016

Start-ups do not have enough resources such as financial capital and established customer base. Knowledge base of start-up team members is the crucial and unrivaled resource. This study tries to explicate the knowledge sharing process occurring in this knowledge base of start-up teams. Adopting the knowledge process view, detail process of knowledge sharing process model is constructed consisting of knowledge sharing speed, quality and quantity in a form of nomological net and empirically tested. In addition, preceding antecedents and consequential outcomes of this knowledge sharing is also posited as part of the research model : knowledge state of the team leading to team creativity and agility via the explicated knowledge sharing process model. Also, as this knowledge based view are triggered by the advance of IT in general, IT support is conceptualized as an antecedent and measures are operationalized. 230 data points were collected from start-up teams. Via data analysis using PLS, theoretical relationships from knowledge state, IT support, knowledge sharing process and knowledge consequences are found to be empirically supported except a few not supported. Most of all, team agility and team creativity are theoretically supported and empirically validated as critical outcome variables beyond performance measures. Though agility and creativity has been discussed as critical construct in start-up teams, it has not be much validated empirically. Also, interestingly, IT support are found to be significantly impacting the knowledge sharing process as expected. Academic contributions and implications for practice are discussed at the end with limitations and further research.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

• 인터넷정보학회논문지
• /
• 제11권4호
• /
• pp.73-83
• /
• 2010

그리드 시스템에서의 확장성은 점증하고 있는 그리드 이용자를 수용하기 위해 효율적으로 설계되어야 한다. 본 논문은 그리드환경에서 확장성 가상조직(SVO: Scalable Virtual Organization)을 사용하여 VO들 간의 확장형 자원 공유 기법을 제시한다. 제안하는 그리드 구조는 SVO를 관리하기 위한 그리드 시스템의 표준 서비스들로 구성되며, 통합할 VO들을 선택하기 위해, VO들 간의 유사도를 결정하는 데 사용하는 그룹 유사함수를 제시한다. 다른 유사 함수들을 제시한 기법(GSF)과 비교하고, 시뮬레이션을 통해 SVO의 성능을 평가하였다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2008년도 춘계 종합학술대회 논문집
• /
• pp.489-493
• /
• 2008

유비쿼터스 컴퓨팅의 주요 목적 가운데 하나는 지능 공간에 존재하는 다양한 자원들을 공유하고 최적의 자원을 추론하여 사용자를 위한 효과적인 서비스를 구성하는 것이다. 그러나 각 응용들은 서로 다른 표현 방법으로 자원과 서비스들을 기술하고 있으며 이러한 이질적인 정보 표현 형식은 공유와 추론을 어렵게 하는 요인이 된다. 그러므로 자원 공유를 위해 필요한 정보를 단일화하는 것이 필요하며 온톨로지는 이를 표현하기위한 한 가지 방안이다. 본 논문에서는 유비쿼터스 지능 공간 내에서 제공 가능한 서비스들을 정의하고 이를 위한 온톨로지를 제안한다. 또한 서비스를 구성하기 위하여 주변의 자원을 공유하기 위한 자원 온톨로지를 정의한다. 이렇게 정의된 우리의 온톨로지들은 유비쿼터스 지능 공간에서 사용자에게 효과적인 서비스를 구성하기위한 자원 집합을 추론하기위해서 사용된다.

• ETRI Journal
• /
• 제27권1호
• /
• pp.43-52
• /
• 2005

In this paper, we introduce an adaptive radio resource allocation for IP-based mobile satellite services. We also present a synchronous multibeam CDMA satellite system using an orthogonal resource sharing mechanism among downlink beams for the adaptive packet transmission. The simulation results, using a Ka-band mobile satellite channel and various packet scheduling schemes, show that the proposed system and resource allocation scheme improves the beam throughput by more than two times over conventional systems. The simulation results also show that, in multibeam satellite systems, a system-level adaptation to a user's channel and interference conditions according to user locations and current packet traffic is more efficient in terms of throughput improvement than a user-level adaptation.

• Journal of Computing Science and Engineering
• /
• 제10권1호
• /
• pp.21-31
• /
• 2016

With the application and development of biomedical techniques such as next-generation sequencing, mass spectrometry, and medical imaging, the amount of biomedical data have been growing explosively. In terms of processing such data, we face the problems surrounding big data, highly intensive computation, and high dimensionality data. Fortunately, cloud computing represents significant advantages of resource allocation, data storage, computation, and sharing and offers a solution to solve big data problems of biomedical research. In order to improve the efficiency of resource management in cloud computing, this paper proposes a clustering method and adopts Radial Basis Function in order to compress comprehensive data sets found in biology and medicine in high quality, and stores these data with resource management in cloud computing. Experiments have validated that with such a data-compression-based resource management in cloud computing, one can store large data sets from biology and medicine in fewer capacities. Furthermore, with reverse operation of the Radial Basis Function, these compressed data can be reconstructed with high accuracy.

• 한국통신학회논문지
• /
• 제32권11A호
• /
• pp.1120-1127
• /
• 2007

셀룰라 기반의 멀티홉 시스템에서 각 홉이 필요로 하는 자원의 양에 따라 동적으로 자원을 할당하는 GPS-DRA(Generalized Processor Sharing-Dynamic Resource Allocation) 기법을 제안하였다. 논문에서 가정한 하이브리드 분산식 시스템에서는 네트워크에 연결되어있는 중앙의 controller가 각 홉에 자원을 적절히 할당해 주어야 한다. 하지만 전송환경이 시간에 따라 수시로 변하기 때문에 홉 별로 필요한 자원의 양에 맞게 자원을 할당하기가 쉽지 않다. GPS-DRA 기법은 홉 별로 이전에 사용한 자원의 양을 근거로 하여 홉 별로 필요한 자원의 양에 맞게 동적으로 자원을 할당한다. 본 기법을 사용하면 중앙의 controller에서 자원할당에 필요한 링크 정보를 모두 수집할 필요가 없으므로, 이 기법을 적용하기 위하여 추가적으로 필요한 control overhead의 증가량을 매우 적게 할 수 있다. 제안한 기법을 적용하여 모의실험을 수행한 결과, 고정 자원할당 방식에 비해 채널사용효율이 약 16% 증가하고 셀 용량이 최대 약 65% 커지게 되는 것을 확인하였다.