2010 Ninth International Symposium on Parallel and Distributed Computing最新文献_第2页

Algorithm for Mapping Multilayer BP Networks onto the SpiNNaker Neuromorphic Hardware 多层BP网络映射到SpiNNaker神经形态硬件的算法

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.10

Xin Jin, M. Luján, Muhammad Mukaram Khan, L. Plana, Alexander D. Rast, S. Welbourne, S. Furber

引用次数: 6

Energy Minimization on Thread-Level Speculation in Multicore Systems 多核系统中线程级推测的能量最小化

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.17

Peng Li, Song Guo

引用次数: 3

Parallel ID Shadow-Map Decompression on GPU 并行ID阴影地图解压GPU

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.14

E. D. Diktas, A. V. Sahiner

{"title":"Parallel ID Shadow-Map Decompression on GPU","authors":"E. D. Diktas, A. V. Sahiner","doi":"10.1109/ISPDC.2010.14","DOIUrl":"https://doi.org/10.1109/ISPDC.2010.14","url":null,"abstract":"ID shadow-maps are used for robust real-time rendering of shadows. The primary disadvantage of using shadow-maps is their excessive size for large scenes in case high quality shadows are needed. To eliminate large memory requirements and texture-size limitations of the current generation GPUs, texture compression is an important tool. We present a framework where compressed ID-shadow-maps are used for real-time rendering of static scene shadows. The texture compression is performed off-line on the CPU and real-time decompression is performed on the GPU within a fragment-shader for shadowing the pixels. The use of ID shadow-maps (instead of conventional depth-based shadow-maps) is the key to high compression ratios. The ID shadow-map is compressed on the CPU by first partitioning it into blocks. Each compressed block is packed densely into a global array, while a pointer table is constructed that holds a pointer to the start of every compressed block in the global array. This data organization provides the GPU with a random access to the start of each compressed block thus enables fast parallel decompression. The proposed decompression shader-program and the underlying data structures can be applied to any type of array consisting of integers. The framework is implemented using OpenGL and GLSL.","PeriodicalId":444451,"journal":{"name":"2010 Ninth International Symposium on Parallel and Distributed Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133361952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Decomposition Based Algorithm for State Prediction in Large Scale Distributed Systems 基于分解的大规模分布式系统状态预测算法

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.13

Mihai Istin, A. Visan, Florin Pop, V. Cristea

引用次数: 12

Cost Performance Analysis in Multi-level Tree Networks 多层树网络的成本性能分析

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.34

Kijeung Choi, T. Robertazzi

引用次数: 1

A Distributed Wakening Based Target Tracking Protocol for Wireless Sensor Networks 基于分布式唤醒的无线传感器网络目标跟踪协议

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.33

Aysegul Alaybeyoglu, O. Dagdeviren, A. Kantarci, K. Erciyes

引用次数: 8

Butterfly Automorphisms and Edge Faults 蝴蝶自同构和边缘缺陷

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.11

M. D. Wagh, K. Bendjilali

引用次数: 4

SKAIT: A Parameterized Key Assignment Scheme for Wireless Networks 无线网络的参数化密钥分配方案

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.18

Ramon Novales, N. Mittal, K. Saraç

引用次数: 0

Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks 基于轻量级终端检测的异构认知无线网络快速邻居发现

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.32

Y. Zeng, N. Mittal, S. Venkatesan, R. Chandrasekaran

{"title":"Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks","authors":"Y. Zeng, N. Mittal, S. Venkatesan, R. Chandrasekaran","doi":"10.1109/ISPDC.2010.32","DOIUrl":"https://doi.org/10.1109/ISPDC.2010.32","url":null,"abstract":"An important step in the initialization of a wireless ad hoc network is neighbor discovery in which every node attempts to determine the set of nodes it can communicate with in one wireless hop. In recent years, cognitive radio technology has gained attention as an attractive approach to alleviate the congestion within the frequency spectrum. A cognitive radio transceiver can operate over a wide range of frequencies possibly spanning multiple frequency bands. A cognitive radio node can scan the frequency spectrum and dynamically identify frequencies that it can use for communication without interference from other wireless devices in its vicinity. When multiple cognitive radio nodes come together to form an ad hoc network, due to spatial variations in frequency usage and hardware variations in radio transceivers, different nodes in the network may perceive different subsets of frequencies available to them for communication. This heterogeneity in the available channel sets across the network increases the complexity of conducting neighbor discovery in a cognitive radio network. In this paper, we propose a new deterministic neighbor discovery algorithm for heterogeneous multi-hop cognitive radio networks with termination detection capability. Our algorithm allows nodes to detect termination of the neighbor discovery process. Our simulation results indicate that our algorithm is much faster compared to a recently proposed deterministic neighbor discovery algorithm (a reduction of 97-98% in time complexity ) and termination detection is lightweight (at most 3% of the total time complexity).","PeriodicalId":444451,"journal":{"name":"2010 Ninth International Symposium on Parallel and Distributed Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115708895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Operational Semantics of the Marte Repetitive Structure Modeling Concepts for Data-Parallel Applications Design 数据并行应用设计中Marte重复结构建模概念的操作语义

2010 Ninth International Symposium on Parallel and Distributed Computing Pub Date : 2010-07-07 DOI: 10.1109/ISPDC.2010.30

A. Gamatie, Vlad Rusu, É. Rutten

引用次数: 3