| 期刊全稱 | Algorithm Engineering and Experimentation | | 期刊簡稱 | International Worksh | | 影響因子2023 | Michael T. Goodrich,Catherine C. McGeoch | | 視頻video | http://file.papertrans.cn/153/152827/152827.mp4 | | 發(fā)行地址 | Includes supplementary material: | | 學(xué)科分類 | Lecture Notes in Computer Science | | 圖書封面 |  | | 影響因子 | Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid progress in microprocessor speed has left main memory access as the primary limitation to SMP performance. Since memory is the bottleneck, simply increasing the n- ber of processors will not necessarily yield better performance. Indeed, memory bus limitations typically limit the size of SMPs to 16 processors. This has at least twoimplicationsfor the algorithmdesigner. First, since there are relatively few processors availableon an SMP, any parallel algorithm must be competitive with its sequential counterpart with as little as one processor in order to be r- evant. Second, for the parallel algorithm to scale with the number of processors, it must be designed with careful attention to minimizing the number and type of main memory accesses. In this paper, we present a computational model for designing e cient al- rithms for symmetric multiprocessors. We then use this model to create e cie | | Pindex | Book 1999 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-27 19:45
發(fā)表于 2025-3-21 18:11:31
