nurture 发表于 2025-3-26 21:54:45

http://reply.papertrans.cn/43/4264/426394/426394_31.png

男学院 发表于 2025-3-27 04:51:35

http://reply.papertrans.cn/43/4264/426394/426394_32.png

FER 发表于 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

夹死提手势 发表于 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

突袭 发表于 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

贫穷地活 发表于 2025-3-27 21:38:30

http://reply.papertrans.cn/43/4264/426394/426394_36.png

啮齿动物 发表于 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

ANIM 发表于 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

epinephrine 发表于 2025-3-28 09:29:28

http://reply.papertrans.cn/43/4264/426394/426394_39.png

Heresy 发表于 2025-3-28 12:08:04

http://reply.papertrans.cn/43/4264/426394/426394_40.png
页: 1 2 3 [4] 5 6 7
查看完整版本: Titlebook: High Performance Computing – HiPC 2005; 12th International C David A. Bader,Manish Parashar,Viktor K. Prasanna Conference proceedings 2005