RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Static Task Scheduling Algorithm with Minimum Distance for Multiprocessor System (STMD)

        Ranjit Rajak,C.P.Katti 한국산학기술학회 2015 SmartCR Vol.5 No.2

        Task scheduling in the multiprocessor environment is considered to be a NP-complete problem. It is also called a multiprocessor scheduling. Here, a parallel program is divided into a number of subtasks and it is mapped on the processors for concurrent execution. The objective of task scheduling is to reduce scheduling length of a given application program. Considering that task scheduling is represented by Directed Acyclic Grape (DAG). There are two types of task scheduling algorithms: static task scheduling and dynamic task scheduling algorithms. In this paper, we propose a new task scheduling algorithm based on minimum distance and an entry task duplicated on the processors. The minimum distance computes between an entry task and its successors. It includes, minimum distance of parent task, execution time and communication time Here , also considering a priority list (PL) attribute that contains tasks information of a given application program whose distance is minimum from an entry task. Finally, we will do comparative study of the proposed algorithm with Bounded Number of Processors (BNP) class of scheduling algorithms. It has done based on the following matrices: Scheduling Length, Speedup, Efficiency, Load Balancing and Normalized Scheduling Length (NSL). It showed proposed algorithm gives better result than BNP class of scheduling algorithms.

      • Study of Cloud Computing and its Issues: A Review

        J. K. Verma,C. P. Katti 한국산학기술학회 2014 SmartCR Vol.4 No.5

        Cloud computing is a new paradigm for hosting and delivering services using the standard protocols of the Internet. It refers to a service-oriented architecture that offers ubiquitous and convenient computing, greater flexibility, on-demand services, reduced total cost of ownership, reduced information technology overhead for the end-user, and many other things. It allows access to a large amount of computing power in a fully virtualized mode by aggregating a configurable pool of resources that are rapidly provisioned and released dynamically. It also provides the capability to utilize scalable, distributed computing environments within the confines of the Internet with minimal management effort while keeping a single coherent system view. Cloud computing is constantly gaining popularity in the information technology industry, and so more and more issues and challenges are emerging that need to be handled for the success of this paradigm. This paper presents an introduction of cloud computing, and a comparative study of cloud computing and grids. Furthermore, we put forward pinpoint research issues in the cloud computing paradigm and a mathematical understanding of several issues among them.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼