RISS 학술연구정보서비스

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

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

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

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

    RISS 인기검색어

      고도 병렬 컴퓨터시스템을 위한 History Sensitive Processor Scheduling모델 = History Sensitive Processor Scheduling Model for Massively Parallel Computer Systems

      한글로보기

      https://www.riss.kr/link?id=A19601070

      • 0

        상세조회

      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

      영어
      한국어
      The processor scheduling of multiprocessor systems has been one of the critical issues on design of high performance computer systems But the optimal scheduling of multiple processor systems had been known as a NP-complete problem, accordingly we need to design near optimal processor scheduling schemes for maximizing the system throughputs and the utilization of processing elements.
      In this paper, we present a near optimal heuristic processor scheduling model, the History Sensitive Processor Scheduling Model, in which the target processing elements for the next allocation is determined only by the data dependency relationships between computation units and the preallocation informations of PEs.
      The results from an analysis of the HSPSM model show that the HSCPS Scheme is superior to the others of the HSSS model in the processor utilization and the program processing times. The HSCPS also has a lot of advantages over the Variable Resolution Actor scheme in the exploitation of internal parallelism
      of a task graph.
      번역하기

      The processor scheduling of multiprocessor systems has been one of the critical issues on design of high performance computer systems But the optimal scheduling of multiple processor systems had been known as a NP-complete problem, accordingly we need...

      The processor scheduling of multiprocessor systems has been one of the critical issues on design of high performance computer systems But the optimal scheduling of multiple processor systems had been known as a NP-complete problem, accordingly we need to design near optimal processor scheduling schemes for maximizing the system throughputs and the utilization of processing elements.
      In this paper, we present a near optimal heuristic processor scheduling model, the History Sensitive Processor Scheduling Model, in which the target processing elements for the next allocation is determined only by the data dependency relationships between computation units and the preallocation informations of PEs.
      The results from an analysis of the HSPSM model show that the HSCPS Scheme is superior to the others of the HSSS model in the processor utilization and the program processing times. The HSCPS also has a lot of advantages over the Variable Resolution Actor scheme in the exploitation of internal parallelism
      of a task graph.

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼