pim(21)
-
[Paper Review] Processing in Memory: The Terasys Massively Parallel PlM Array
Processing in Memory: The Terasys Massively Parallel PlM Array (PACT'95) The notion of computing in memory has been with us for several decades. For example, Stone’ proposed a logic-in-memory computer consisting of an enhanced cache memory array that serves as a high-speed buffer between CPU and conventional memory. More recently, a group at the University of Toronto has designed a computati..
2026.04.22 -
[Paper Review] Hitting the Memory Wall: Implications of the Obvious
Hitting the Memory Wall: Implications of the Obvious (1994) This brief note points out something obvious—something the authors “knew” without really understanding. With apologies to those who did understand, we offer it to those others who, like us, missed the point.We all know that the rate of improvement in microprocessor speed exceeds the rate of improvement in DRAM memory speed; each is imp..
2026.04.17 -
[Paper Review] Near-Memory Computing: Past, Present, and Future
Near-Memory Computing: Past, Present, and Future The conventional approach of moving data to the CPU for computation has become a significant performance bottleneck for emerging scale-out data-intensive applications due to their limited data reuse. At the same time, the advancement in 3D integration technologies has made the decade-old concept of coupling compute units close to the memory — call..
2026.04.17 -
[UPMEM PIM] 졸업논문 최종 발표
2025. 12. 10. Wednesday
2025.12.10 -
[UPMEM PIM] DPU_FOREACH Iterator
2025. 12. 03. Wednesday * UPMEM PIM Programming- dpu.c : tasklet_id = me(), 한 DPU 내부의 tasklet 구분 - host.c : 서로 다른 DPU 인식 -> 구현을 여기서 수정해야 한다. - 이때 DPU_FOREACH Iterator를 활용한다. - As a consequence, the host API works on sets of DPUs, which may contain multiple DPU ranks.- The provided C macro DPU_RANK_FOREACH and DPU_FOREACH iterate over the ranks and DPUs respectively of a set. # UPMEM-GEM..
2025.12.03 -
[UPMEM PIM] UPMEM-MHA DPU Programming
2025. 11. 29 Saturday 한 달 내내 풀지 못했던 에러를 해결했다.!너무너무너무 기뻤다. .·⋆(⌒_⌒)⋆·. 오랜만에 느껴본 코딩(디버깅)의 맛 .막막하고 어려운 문제도 step by step으로생각해보면, 찬찬히 해결할 수 있다 ! * dpu-diag- 총 2546개 DPU, 350Mhz를 확인할 수 있다. - perfcounter_get 로 가져온 cycle을 ms로 표현할 때, 정확한 hz가 필요하다. * Cycles 선형 증가 해결 - perfcounter_config(COUNT_CYCLES, true); - 초기화 구문 추가로, head 별 cycle 에러 해결 * DPU 내부 float 연산 제거 - 구조체 정의 변경, PIM 성능 향상 + TILE_ROWS 최적값..
2025.12.01 -
[UPMEM PIM] MHA Host Code Review
2025. 10. 29. Wednesday 📌 TODOLIST - quantization 적용 더 알아보기 (float -> int) - dpu 2nd tasklet error debugging - embedding 차원 조절하기 (tasklet >= 16)
2025.10.29 -
[UPMEM PIM] UPMEM Checksum Example Code Review
2025. 10. 11. SaturdayUPMEM Official Example Review
2025.10.12 -
[UPMEM PIM] UPMEM-GEMM Code Review
2025. 10. 10. Friday다음주 랩미팅 준비: Code Review · 구현 📌 참고자료 - UPMEM SDK: https://sdk.upmem.com/stable/030_DPURuntimeService_Tasklets.html- UPMEM Naive-GEMM: https://github.com/hhessammheidary/UPMEM-GEMM 📌 TODOLIST- UPMEM Checksum example Code Review- PIM Embedding Lookup(Python Wrapper) - MHA Implementation
2025.10.10 -
졸업논문 기초조사서
2025. 09. 30. 화요일
2025.10.07