RISS 학술연구정보서비스

검색
자동완성 버튼
다국어입력
다국어 입력
あ ぁ か が さ ざ た だ な は ば ぱ ま や ゃ ら わ ゎ ん い ぃ き ぎ し じ ち ぢ に ひ び ぴ み り う ぅ く ぐ す ず つ づ っ ぬ ふ ぶ ぷ む ゆ ゅ る え ぇ け げ せ ぜ て で ね へ べ ぺ め れ お ぉ こ ご そ ぞ と ど の ほ ぼ ぽ も よ ょ ろ を
ア ァ カ サ ザ タ ダ ナ ハ バ パ マ ヤ ャ ラ ワ ヮ ン イ ィ キ ギ シ ジ チ ヂ ニ ヒ ビ ピ ミ リ ウ ゥ ク グ ス ズ ツ ヅ ッ ヌ フ ブ プ ム ユ ュ ル エ ェ ケ ゲ セ ゼ テ デ ヘ ベ ペ メ レ オ ォ コ ゴ ソ ゾ ト ド ノ ホ ボ ポ モ ヨ ョ ロ ヲ ―

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

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

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
ㅥ ㅦ ㅧ ㅨ ㅩ ㅪ ㅫ ㅬ ㅭ ㅮ ㅯ ㅰ ㅱ ㅲ ㅳ ㅴ ㅵ ㅶ ㅷ ㅸ ㅹ ㅺ ㅻ ㅼ ㅽ ㅾ ㅿ ㆀ ㆁ ㆂ ㆃ ㆄ ㆅ ㆆ ㆇ ㆈ ㆉ ㆊ ㆋ ㆌ ㆍ ㆎ
Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω α β γ δ ε ζ η θ ι κ λ μ ν ξ ο π ρ σ τ υ φ χ ψ ω
á à Á À é è É È ç Ç ê
Ä Ö Ü ä ö ü ß
ְ ֳ ֲ ֱ ָ ַ ֵ ֶ ִ ֹ ּ ֻ ׂ ׁ ּ פ ם ן ו ט א ר ק ף ך ל ח י ע כ ג ד ש ץ ת צ מ נ ה ב
‘ ’ “ ” 〔 〕 〈 〉 「 」 『 』 【 】 ＂ （ ） ［ ］ ｛ ｝
± × ÷ ≠ ≤ ≥ ∞ ∴ ♂ ♀ ∠ ⊥ ⌒ ∂ ∇ ≡ ≒ ≪ ≫ √ ∽ ∝ ∵ ∫ ∬ ∈ ∋ ⊆ ⊇ ⊂ ⊃ ∪ ∩ ∧ ∨ ￢ ⇒ ⇔ ∀ ∃ ∮ ∑ ∏ ＋ － ＜ ＝ ＞
、 。 · ‥ … ¨ 〃 ― ∥ ＼ ∼ ´ ～ ˇ ˘ ˝ ˚ ˙ ¸ ˛ ¡ ¿ ː ！ ＇ ， ． ／ ： ； ？ ＾ ＿ ｀ ｜
½ ⅓ ⅔ ¼ ¾ ⅛ ⅜ ⅝ ⅞ ¹ ² ³ ⁴ ⁿ ₁ ₂ ₃ ₄
Æ Ð Ħ IJ Ł Ø Œ Þ Ŧ Ŋ æ đ ð ħ ı ij ĸ ŀ ł ø œ ß þ ŧ ŋ ʼn
А Б В Г Д Е Ё Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я а б в г д е ё ж з и й к л м н о п р с т у ф х ц ч ш щ ъ ы ь э ю я
′ ″ ℃ Å ￠ ￡ ￥ ¤ ℉ ‰ ＄ ％ Ｆ ￦ ㎕ ㎖ ㎗ ℓ ㎘ ㏄ ㎣ ㎤ ㎥ ㎦ ㎙ ㎚ ㎛ ㎜ ㎝ ㎞ ㎟ ㎠ ㎡ ㎢ ㏊ ㎍ ㎎ ㎏ ㏏ ㎈ ㎉ ㏈ ㎧ ㎨ ㎰ ㎱ ㎲ ㎳ ㎴ ㎵ ㎶ ㎷ ㎸ ㎹ ㎀ ㎁ ㎂ ㎃ ㎄ ㎺ ㎻ ㎽ ㎾ ㎿ ㎐ ㎑ ㎒ ㎓ ㎔ Ω ㏀ ㏁ ㎊ ㎋ ㎌ ㏖ ㏅ ㎭ ㎮ ㎯ ㏛ ㎩ ㎪ ㎫ ㎬ ㏝ ㏐ ㏓ ㏃ ㏉ ㏜ ㏆
§ ※ ☆ ★ ○ ● ◎ ◇ ◆ □ ■ △ ▽ → ← ↑ ↓ ↔ 〓 ◁ ◀ ▷ ▶ ♤ ♠ ♡ ♥ ♧ ♣ ⊙ ◈ ▣ ◐ ◑ ▒ ▤ ▥ ▨ ▧ ▦ ▩ ♨ ☏ ☎ ☜ ☞ † ‡ ↕ ↗ ↙ ↖ ↘ ♭ ♩ ♪ ♬ ㉿ ㈜ № ㏇ ™ ㏂ ㏘ ℡ ＃ ＆ ＊ ＠ ª º
ⅰ ⅱ ⅲ ⅳ ⅴ ⅵ ⅶ ⅷ ⅸ ⅹ Ⅰ Ⅱ Ⅲ Ⅳ Ⅴ Ⅵ Ⅶ Ⅷ Ⅸ Ⅹ
ا ب ت ث ج ح خ د ذ ر ز س ش ص ض ط ظ ع غ ف ق ک ل م ن ه و ی
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      검색키워드
      저자 : Ranjit Rajak (검색결과 4 건)
      • 무료
      • 기관 내 무료
      • 유료

      • A Novel Approach for Task Scheduling in Parallel Computing using Priority Attributes

        Ranjit Rajak,Shobhit Gupta,Girish Kumar Singh,Sanjay Jain 한국산학기술학회 2015 SmartCR Vol.5 No.4

        The major objective of any task-scheduling algorithm in parallel computing is to minimize the overall scheduling length. In this research paper, we present a task-scheduling algorithm in parallel computing called the Critical Path and b-level Based Task Scheduling algorithm. This algorithm is based on a new attribute, which is called the CPB attribute, which is based on two well-known priority attributes: Critical Path and B-Level. This algorithm uses entry tasks as duplicates in all of the available processors. The major objective of any task-scheduling algorithm is to minimize the overall scheduling length. Here, an application program in task scheduling is represented by a directed acyclic graph. We consider all processors to be homogenous in nature and fully connected. The Critical Path and b-level Based Task Scheduling algorithm gives a minimum scheduling length when compared to heuristic task-scheduling algorithms like the HLFET, MCP, DLS, and ETF. We have also done an analysis of the proposed algorithm and heuristic algorithms based on other priority attributes: Speedup, Efficiency, Scheduling Length Ratio, Load Balancing, and Cost.

      • 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.

      • Arbitrary Processor Network Scheduling Algorithms in Parallel Computing

        Shobhit Gupta,Ranjit Rajak,Girish Kumar Singh,Sanjay Jain 한국산학기술학회 2015 SmartCR Vol.5 No.3

        Task scheduling in parallel computing is represented by a directed acyclic graph, and it is called multiprocessor task scheduling. The primary objective of task scheduling algorithm is to minimize the total execution time i.e. scheduling length. There are various types of task scheduling algorithms: Bound Number of Processor Scheduling, and Arbitrary Processor Network Scheduling Algorithms. Bound Number of Processor Scheduling algorithms are used for limited number of processors; since it does not use task duplication, link contention, and routing strategy for communication. But Arbitrary Processor Network scheduling algorithms are considered for link contention routing strategy in communication. It uses arbitrary network topology. In this paper, we have studied different Arbitrary Processor Network scheduling algorithms: Mapping Heuristic, Dynamic Level Scheduling, Bottom Up, and Bubble Scheduling and Allocation. The primary objective of this survey paper is to explain various Arbitrary Processor Network scheduling algorithms and their functionality, priority attributes, and time complexity. The performance metrics can also be used for comparison of different Arbitrary Processor Network scheduling algorithms.

      • Review of Task Duplication Based (TDB) Scheduling Algorithms

        Shobhit Gupta,Ranjit Rajak,Girish Kumar Singh,Sanjay Jain 한국산학기술학회 2015 SmartCR Vol.5 No.1

        Task scheduling is a well-known NP-complete problem. It is one of the research areas in parallel computing. Task scheduling consists of an application program and a set of processors for allocating the various tasks. An application program is represented using a directed acyclic graph(DAG) and a set of processors that are homogenous and fully connected. In this paper, we study different task duplication-based (TDB) scheduling algorithms and their priority attributes and time complexity. Also, we will discuss different types of performance metrics in task scheduling algorithms. These performance metrics help to analyze different task scheduling algorithms.

      맨처음 페이지로1맨끝 페이지로

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼