• Title/Summary/Keyword: Distributed Resource

Search Result 860, Processing Time 0.025 seconds

Research on the Sharing Strategy of Electronic Book Resources in Universities in the Internet Era

  • Guiya Gao
    • Journal of Information Processing Systems
    • /
    • v.19 no.5
    • /
    • pp.590-601
    • /
    • 2023
  • University books are an important information resource. University book resources can be shared not only in the traditional paper form, but also electronic form under the background of the Internet. In order to better manage the sharing of electronic book resources in universities, this study put forward three resource sharing strategies: centralized sharing strategy, distributed sharing strategy, and centralized-distributed sharing strategy by analyzing the combined development of books and the Internet as well as the significance and development of book resource sharing. The centralized sharing strategy, however simple, was difficult to handle large traffic; while the resource nodes were independent and self-consistent, the distributed sharing strategy was not easy to find and had a high repetition rate. Combining the advantages of both strategies, the centralized-distributed sharing strategy was more suitable for the heterogeneous form of university book sharing. Finally, a teaching resources sharing platform for university libraries was designed based on the strategy of centralized and distributed sharing, and three interfaces including platform login, resource search, and resource release were displayed. The results of the simulated comparison experiment showed that centralized and distributed sharing strategies had limitations in resource searching and had low efficiencies; the efficiency of the centralized strategy reduced with an increase in search subjects; however, the centralized-distributed sharing strategy was able to search more resources efficiently and main stability.

Supply-Driven Strategies Model for Resource Management in Grid Environment (그리드 환경에서의 효율적인 자원 관리를 위한 공급-조정 전략 모델)

  • Ma Yong-Beom;Lee Jong-Sik;Cho Kyu-Cheol;Kim In-Hee;Jang Sung-Ho;Park Da-Hye
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2005.11a
    • /
    • pp.65-70
    • /
    • 2005
  • Recently, Grid is embossed as a new issue according to the need of cooperation related to distributed resources, data sharing, Interaction and so on. It focuses on sharing of large scale resources, high-performance, applications of new paradigms, which improved more than established distributed computing. Because of the environmental specificity distributed geographically and dynamic, the most important problem in grid environment is to share and to allocate distributed grid resources. This paper proposes supply-driven strategies model that is applicable for resource management in grid environment and presents a optimal resource allocation algorithm based on resource demands. Supply-driven strategies model can offer efficient resource management by transaction allocation based on user demand and provider strategy. This paper implements the supply-driven strategies model on the DEVS modeling and simulation environment and shows the efficiency and excellency of this model by comparing with established models.

  • PDF

Distributed Resource Allocation in Two-Hierarchy Networks

  • Liu, Shuhui;Chang, Yongyu;Wang, Guangde;Yang, Dacheng
    • ETRI Journal
    • /
    • v.34 no.2
    • /
    • pp.159-167
    • /
    • 2012
  • In this paper, a new distributed resource allocation algorithm is proposed to alleviate the cross-tier interference for orthogonal frequency division multiplexing access macrocell and femtocell overlay. Specifically, the resource allocation problem is modeled as a non-cooperative game. Based on game theory, we propose an iterative algorithm between subchannel and power allocation called distributed resource allocation which requires no coordination among the two-hierarchy networks. Finally, a macrocell link quality protection process is proposed to guarantee the macrocell UE's quality of service to avoid severe cross-tier interference from femtocells. Simulation results show that the proposed algorithm can achieve remarkable performance gains as compared to the pure waterfilling algorithm.

Scalable Distributed Scheduling in Grid Computing Environment (그리드 컴퓨팅 환경에서 확장 가능한 분산 스케줄링)

  • Lee, Joon-Dong;Lee, Moo-Hun;Choi, Eui-In
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.1-9
    • /
    • 2007
  • We propose a novel framework for distributed resource management. The framework has the following novel features. First, the resource management system is distributed using resource content information that is characterized by system properties. We argue that a distributed system based on resource content is sufficient to satisfy specific scheduling requests for Quality of Service(QoS) considering workload balance across a grid. Second, the distributed system constructs a hierarchical peer-to-peer network. This peered network provides an efficient message routing mechanism. The simulation results demonstrate that the proposed framework is proficient to satisfy QoS in distributed environment.

  • PDF

The Design of Proxy Peer Algorithm based on DHT for Effective Resource Searching on JXTA Network Environments (JXTA 네트워크 환경에서 효율적인 자원 검색을 위한 DHT 기반프락시 피어 알고리즘 설계)

  • Lee, Gwang;Lee, Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.8
    • /
    • pp.1486-1492
    • /
    • 2007
  • Searching distributed resources efficiently is very important in distributed computing environments like P2P. But distributed resource searching may have system overheads and take a lot of time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. In this paper, we design a proxy peer algorithm based on DHT(Distributed Hash Table) for efficient distributed resource searching in JXTA network environments. By containing the rendezvous information in proxy peer and searching a rendezvous peer firstly which has higher hit ratio, we can reduce the searching number and minimize system overheads.

Employment Contract-Based Management Model of Production Resources on Relation-Driven Fractal Organization (관계주도형 프랙탈 조직에서의 고용계약 기반 생산자원 관리모형)

  • Shin, Moonsoo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.39 no.4
    • /
    • pp.278-289
    • /
    • 2013
  • Up-to-date market dynamics and intense competition have forced a production system to be more widely distributed and decentralized than ever, and the production system itself can be regarded as a collaborative network of autonomous production resources in which the responsibility of decision making is also decentralized into individual autonomous entities. The conventional resource management models, however, are not suitable for the distributed and decentralized environment because of their centralized nature. In this paper, an agent-based resource management model is proposed. The proposed model applies employment relation-driven fractal organization (FrOrg) into organizational model for distributed production resources and presents a resource management framework based on employment contracts. The fractal organization is a structured association in which a self-similar pattern recursively appears, and employment relations between production resources are recursively constructed throughout the entire production system.

Research on Distributed Sensor Device Resource Object Collaboration Service Providing System based on Service Delivery Platform (서비스 전달 플랫폼 기반 분산 센서 디바이스 자원 객체 연동 서비스 제공 시스템 연구)

  • Yoon, Changwoo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.6
    • /
    • pp.144-150
    • /
    • 2015
  • A system for providing a distributed device resource-object-connection service based on a service delivery platform (SDP) is described. The system includes an SDP and proxy. The SDP configures to define distributed service functions as enablers, generates a convergence service by combining the enablers, and provides the generated convergence service. The proxy configures to connect a distributed device and an SDP to allow the SDP to use the distributed device as a resource, and define and use the distributed device as an enabler. The system are capable of defining distributed service functions as well as distributed sensors as enablers, and thereby allowing the distributed sensors to be used in the same sense as service-function enablers.

Adaptive Resource Allocation for Efficient Power Control Game in Wireless Networks (무선 네트워크에서 효율적인 전력 제어 게임을 위한 적응 자원 할당 기법)

  • Wang, Jin-Soo;Park, Jae-Cheol;Hwang, Sung-Hyun;Kim, Chang-Joo;Kim, Yun-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3A
    • /
    • pp.221-228
    • /
    • 2009
  • We consider distributed resource allocation among the links in a wireless network to minimize the total transmit power of the network while meeting the target rate required by each link. The problem to be solved is how to change the amount of wireless resource allocated and the number of links sharing the resource according to the interference environment so that the following distributed power control game converges to a stable point. To provide a distributed method with less complexity and lower information exchange than the centralized optimal method, we define the resource sharing level among the links from which the size of resource allocated and the links sharing the resource are determined distributively. It is shown that the performance of the proposed method is better than that of the conventional methods, orthogonal resource allocation only and resource sharing only, as well as it approaches to that of the optimal method.

Consensus-Based Distributed Algorithm for Optimal Resource Allocation of Power Network under Supply-Demand Imbalance (수급 불균형을 고려한 전력망의 최적 자원 할당을 위한 일치 기반의 분산 알고리즘)

  • Young-Hun, Lim
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.6
    • /
    • pp.440-448
    • /
    • 2022
  • Recently, due to the introduction of distributed energy resources, the optimal resource allocation problem of the power network is more and more important, and the distributed resource allocation method is required to process huge amount of data in large-scale power networks. In the optimal resource allocation problem, many studies have been conducted on the case when the supply-demand balance is satisfied due to the limitation of the generation capacity of each generator, but the studies considering the supply-demand imbalance, that total demand exceeds the maximum generation capacity, have rarely been considered. In this paper, we propose the consensus-based distributed algorithm for the optimal resource allocation of power network considering the supply-demand imbalance condition as well as the supply-demand balance condition. The proposed distributed algorithm is designed to allocate the optimal resources when the supply-demand balance condition is satisfied, and to measure the amount of required resources when the supply-demand is imbalanced. Finally, we conduct the simulations to verify the performance of the proposed algorithm.

A Memory Configuration Method for Virtual Machine Based on User Preference in Distributed Cloud

  • Liu, Shukun;Jia, Weijia;Pan, Xianmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.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.