RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      SCOPUS KCI등재

      Effective Partitioning of Static Global Buses for Small Processor Arrays

      한글로보기

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

      • 0

        상세조회
      • 0

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

      부가정보

      다국어 초록 (Multilingual Abstract)

      This paper shows an effective partitioning of static global row/column buses for tightly coupled 2D mesh-connected small processor arrays ("mesh", for short). With additional O(n/m (n/m + log m)) time slowdown, it enables the mesh of size $m{\times}m$...

      This paper shows an effective partitioning of static global row/column buses for tightly coupled 2D mesh-connected small processor arrays ("mesh", for short). With additional O(n/m (n/m + log m)) time slowdown, it enables the mesh of size $m{\times}m$ with static row/column buses to simulate the mesh of the larger size $n{\times}n$ with reconfigurable row/column buses ($m{\leq}n$). This means that if a problem can be solved in O(T) time by the mesh of size $n{\times}n$ with reconfigurable buses, then the same problem can be solved in O(Tn/m (n/m + log m)) time on the mesh of a smaller size $m{\times}m$ without a reconfigurable function. This time-cost is optimal when the relation $n{\geq}m$ log m holds (e.g., m = $n^{1-\varepsilon}$ for $\varepsilon$ > 0).

      더보기

      참고문헌 (Reference)

      1 S. Matsumae, "Tight bounds on the simulation of meshes with dynamically reconfigurable row/column buses by meshes with statically partitioned buses" 66 (66): 1338-1346, 2006

      2 S. Matsumae, "Simulation algorithms among enhanced mesh models" E82-D (E82-D): 1324-1337, 1999

      3 S. Matsumae, "Simulating a mesh with separable buses" 40 (40): 3706-3714, 1999

      4 T. Maeba, "Semigroup computations on a processor array with partitioned buses" J80-A (J80-A): 410-413, 1997

      5 S. Matsumae, "Polylogarithmic time simulation of reconfigurable row/column buses by static buses" 2010

      6 M. J. Serrano, "Optimal architectures and algorithms for mesh-connected parallel computers with separable row/column buses" 4 (4): 1073-1080, 1993

      7 R. Miller, "Meshes with reconfigurable buses" 163-178, 1988

      8 Y. Ben-Asher, "Efficient self-simulation algorithms for reconfigurable arrays" 30 (30): 1-22, 1995

      9 R. Vaidyanathan, "Dynamic Reconfiguration" Kluwer Academic/Plenum Publishers 2004

      10 B. Wang, "Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems" 1 (1): 500-507, 1990

      1 S. Matsumae, "Tight bounds on the simulation of meshes with dynamically reconfigurable row/column buses by meshes with statically partitioned buses" 66 (66): 1338-1346, 2006

      2 S. Matsumae, "Simulation algorithms among enhanced mesh models" E82-D (E82-D): 1324-1337, 1999

      3 S. Matsumae, "Simulating a mesh with separable buses" 40 (40): 3706-3714, 1999

      4 T. Maeba, "Semigroup computations on a processor array with partitioned buses" J80-A (J80-A): 410-413, 1997

      5 S. Matsumae, "Polylogarithmic time simulation of reconfigurable row/column buses by static buses" 2010

      6 M. J. Serrano, "Optimal architectures and algorithms for mesh-connected parallel computers with separable row/column buses" 4 (4): 1073-1080, 1993

      7 R. Miller, "Meshes with reconfigurable buses" 163-178, 1988

      8 Y. Ben-Asher, "Efficient self-simulation algorithms for reconfigurable arrays" 30 (30): 1-22, 1995

      9 R. Vaidyanathan, "Dynamic Reconfiguration" Kluwer Academic/Plenum Publishers 2004

      10 B. Wang, "Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems" 1 (1): 500-507, 1990

      11 V. K. Prasanna-Kumar, "Array processor with multiple broadcasting" 4 : 173-190, 1987

      12 T. Maeba, "An influence of propagation delays on the computing performance in a processor array with separable buses" J78-A (J78-A): 523-526, 1995

      13 T. Maeba, "Algorithms for finding maximum and selecting median on a processor array with separable global buses" J72-A (J72-A): 950-958, 1989

      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

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

      인용정보 인용지수 설명보기

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      2023 평가예정 해외DB학술지평가 신청대상 (해외등재 학술지 평가)
      2020-01-01 평가 등재학술지 유지 (해외등재 학술지 평가) KCI등재
      2012-01-01 평가 등재학술지 선정 (등재후보2차) KCI등재
      2011-01-01 평가 등재후보 1차 PASS (등재후보1차) KCI등재후보
      2009-01-01 평가 등재후보학술지 선정 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0.09 0.09 0.09
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0.07 0.06 0.254 0.59
      더보기

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

      나만을 위한 추천자료

      해외이동버튼