RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      DAVRID 다중스레드 구조에서 비정형적 자료 구조에 대한 자료 병렬성의 극대화 = The Exploitation of Data Parallelism in Nonstrict Data Structures for a Multithreaded Architecture: DAVRID

      한글로보기

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

      • 0

        상세조회
      • 0

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

      부가정보

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

      Even with introduction of new computational models and improvements in processor speeds, the memory system is still a stumbling block to achieve comparable performance of computer systems. Especially the existence of shared global data may cause a considerable performance degradation in parallel computing. Therefore, it is very important to exploit data locality by distributing data structure and scheduling computations according to the distributed data.
      In this paper, we present a data parallelism scheme in nonstrict data structures for a multithreaded architecture DAVRID. We suggest a data parallel programming language, DAPID(DAta Parallel ID), which is an extension of parallel programming language Id. In a bundle. For the efficient implementation of this mechanism, we also suggest a new structure and a new scheme of tag manipulation in nonstrict data structures.
      번역하기

      Even with introduction of new computational models and improvements in processor speeds, the memory system is still a stumbling block to achieve comparable performance of computer systems. Especially the existence of shared global data may cause a con...

      Even with introduction of new computational models and improvements in processor speeds, the memory system is still a stumbling block to achieve comparable performance of computer systems. Especially the existence of shared global data may cause a considerable performance degradation in parallel computing. Therefore, it is very important to exploit data locality by distributing data structure and scheduling computations according to the distributed data.
      In this paper, we present a data parallelism scheme in nonstrict data structures for a multithreaded architecture DAVRID. We suggest a data parallel programming language, DAPID(DAta Parallel ID), which is an extension of parallel programming language Id. In a bundle. For the efficient implementation of this mechanism, we also suggest a new structure and a new scheme of tag manipulation in nonstrict data structures.

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

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

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

      나만을 위한 추천자료

      해외이동버튼