• Title/Summary/Keyword: resource sharing

Search Result 635, Processing Time 0.041 seconds

Fast Generation of Multiple Custom Instructions under Area Constraints

  • Wu, Di;Lee, Im-Yong;Ahn, Jun-Whan;Choi, Ki-Young
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.11 no.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.

An Area Optimization Method for Digital Filter Design

  • Yoon, Sang-Hun;Chong, Jong-Wha;Lin, Chi-Ho
    • ETRI Journal
    • /
    • v.26 no.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.

  • PDF

Modelling and Analysis for Sharing of Full Electric Vehicles in Small-sized Cities (소규모 도시를 위한 전전기 자동차 세어링 서비스 시스템 모델링 및 분석 연구)

  • Jin, Young-Goun;Cho, Hyun-Seob
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.4
    • /
    • pp.1857-1862
    • /
    • 2012
  • It is very difficult to construct and manager public transit, like subway, in small city. In this paper, we suggest full electric vehicle sharing service framework as a public transit system in small city. The suggested system will reduce environment pollution and increase resource usage efficiency. The simulation result shows that the suggested electric vehicle sharing system can reduce traffic congestion and lower city road stress.

A Study on Relationship among Knowledge State, IT Support, Knowledge Sharing Process and Outcomes in Startup Teams

  • Lee, Seyoon;Lee, Hyejung;Lee, Jungwoo
    • Journal of Information Technology Services
    • /
    • v.15 no.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.

Joint Relay Selection and Resource Allocation for Cooperative OFDMA Network

  • Lv, Linshu;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.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.

Scalable Resource Sharing using Group Similarity Function in Grid System (그리드 시스템에서 그룹유사함수를 이용한 확장성 있는 자원공유)

  • Mateo, Romeo Mark A.;Lee, Jae-Wan;Lee, Mal-Rey
    • Journal of Internet Computing and Services
    • /
    • v.11 no.4
    • /
    • pp.73-83
    • /
    • 2010
  • The scalability of a grid system should be efficiently designed to handle the increasing number of grid users. This paper presents a scalable resource sharing mechanism among virtual organizations (VO) in grid environment by the scalable virtual organizations (SVO). The proposed grid architecture is composed of standard services of a grid system to manage the SVO. We propose a group similarity function which is used to determine similarities among VOs to select the VOs to merge. We compared other similarity functions to the GSF and determined the throughput performance of the SVO using simulation for grid system.

Ontology based reasoning for resource sharing in ubiquitous smart space (유비쿼터스 지능 공간에서 자원 공유를 위한 온톨로지기반 추론)

  • Kang, Sun-Hee;Park, Jong-Hyun;Kim, Young-Kuk;Kang, Ji-Hoon
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.489-493
    • /
    • 2008
  • One of the main goals of ubiquitous computing is to share a variety of resources existing to smart space and compose an efficient services by reasoning the most user-suitable resources, However, each applications describe the resources and services in different expression ways and these heterogeneous expression ways make it difficult for sharing and reasoning of the resources. Therefore, it is necessary to unify the information for resources sharing and ontology is one of the solution for the unification. In this paper, we define the possible services in the ubiquitous smart space and its ontology. Also, we propose a resource ontology to represent the usable resources in the space. our ontologies are used to reason resource set for composing user-suitable service in the ubiquitous smart space.

  • PDF

Adaptive Radio Resource Allocation for a Mobile Packet Service in Multibeam Satellite Systems

  • Lim, Kwang-Jae;Kim, Soo-Young;Lee, Ho-Jin
    • ETRI Journal
    • /
    • v.27 no.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.

  • PDF

Data-Compression-Based Resource Management in Cloud Computing for Biology and Medicine

  • Zhu, Changming
    • Journal of Computing Science and Engineering
    • /
    • v.10 no.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.

A Dynamic Resource Allocation scheme with a GPS algorithm in Cellular-based Hybrid and Distributed Wireless Multi-hop Systems (셀룰라 기반의 하이브리드 분산식 멀티홉 시스템에서의 GPS 알고리즘을 이용한 동적 자원할당 기법)

  • Bae, Byung-Joo;Kim, Dong-Kun;Shin, Bong-Jhin;Kang, Byoung-Ik;Hong, Dae-Hyoung;Choe, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1120-1127
    • /
    • 2007
  • In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.