找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: High Performance Computing – HiPC 2005; 12th International C David A. Bader,Manish Parashar,Viktor K. Prasanna Conference proceedings 2005

[復(fù)制鏈接]
樓主: 尤指植物
31#
發(fā)表于 2025-3-26 21:54:45 | 只看該作者
32#
發(fā)表于 2025-3-27 04:51:35 | 只看該作者
33#
發(fā)表于 2025-3-27 05:47:50 | 只看該作者
Preemption Adaptivity in Time-Published Queue-Based Spin Locksscheduler-based locks incur the overhead of a full context switch between threads and are thus unacceptably slow for many applications. Spin locks offer low overhead, but they either scale poorly (test-and-set style locks) or handle preemption badly (queue-based locks). Previous work has shown how t
34#
發(fā)表于 2025-3-27 12:02:39 | 只看該作者
Criticality Driven Energy Aware Speculation for Speculative Multithreaded Processorsxecution results in a significant wastage of dynamic energy due to useless computation in the event of mis-speculation. As energy consumption is becoming an important constraint in microprocessor design, it is extremely important to reduce such wastage of dynamic energy in SpMT processors in order t
35#
發(fā)表于 2025-3-27 16:36:42 | 只看該作者
Search-Optimized Suffix-Tree Storage for Biological Applicationsty of enhancing the search efficiency of . suffix-trees through customized layouts of tree-nodes to disk-pages. Specifically, we propose a new layout strategy, called ., that provides significantly improved search performance on a representative set of real genomic sequences. Further, Stellar suppor
36#
發(fā)表于 2025-3-27 21:38:30 | 只看該作者
37#
發(fā)表于 2025-3-28 00:46:03 | 只看該作者
A Fault Recovery Scheme for P2P Metacomputers search and file-sharing and storage to name a few. In particular, this innovation has had little significant impact in the field of distributed computing..There are several obstacles to be overcome in the development of any distributed computer, most notably: scalability, fault tolerance, security
38#
發(fā)表于 2025-3-28 03:23:13 | 只看該作者
A Distributed Location Identification Algorithm for Ad hoc Networks Using Computational Geometric Meining region for a node can be guaranteed, but only the location could be estimated either with no definitive error bound or only with some probabilistic error. The location identification algorithm presented here minimizes the size of this region, using computational geometric methods. The proposed
39#
發(fā)表于 2025-3-28 09:29:28 | 只看該作者
40#
發(fā)表于 2025-3-28 12:08:04 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 09:24
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
中江县| 新田县| 长春市| 普陀区| 景宁| 富锦市| 湖南省| 东山县| 保德县| 太谷县| 中超| 隆昌县| 台湾省| 建德市| 乌拉特后旗| 泰顺县| 三河市| 黔西县| 嘉祥县| 襄汾县| 改则县| 万州区| 长治市| 绥宁县| 大理市| 定襄县| 开化县| 雅安市| 黎城县| 韶关市| 游戏| 安仁县| 太保市| 宜城市| 井研县| 清镇市| 瑞丽市| 百色市| 拉孜县| 久治县| 娄烦县|