2013 International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献_第2页

A New Efficient Random Key Revocation Protocol for Wireless Sensor Networks 一种新的无线传感器网络随机密钥撤销协议

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.43

Yi Jiang, Ruonan Zhang, Xiaojiang Du

引用次数: 3

A Task Scheduling Algorithm for Multi-core Processors 一种多核处理器任务调度算法

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.47

Xuanxia Yao, P. Geng, Xiaojiang Du

{"title":"A Task Scheduling Algorithm for Multi-core Processors","authors":"Xuanxia Yao, P. Geng, Xiaojiang Du","doi":"10.1109/PDCAT.2013.47","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.47","url":null,"abstract":"With the widespread use of multi-core processors, task scheduling for multi-core processors has become a hot issue. Many researches have been done on task scheduling from various perspectives. However, the existing task scheduling algorithms still have some drawbacks, such as low processor utilization rate, high complexity, and so on. This paper presents a task scheduling algorithm for multi-core processors, which is based on priority queue and task duplication. In the proposed algorithm, the Directed A cyclic Graph (DAG) is used to build a task model. Based on the model, task critical degree, task reminder, task execution time and the average communication time are all considered as the priority metrics. A priority based task dispatching list is set up by comprehensive analysis and calculating the priority for each task. Then interval insertion and task duplication strategies are employed to map tasks to processors, which can decrease the communication cost, improve the processor utilization rate and shorten the schedule length. Our experiments show that the proposed algorithm has better performance and lower complexity than the existing scheduling algorithms.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131586358","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

RDF Data Query and Management Method Based on HBase and Structure Index in Railway Sensor Application 基于HBase和结构索引的RDF数据查询与管理方法在铁路传感器中的应用

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.13

Menglun Yang, Baopeng Zhang, Yidong Li

{"title":"RDF Data Query and Management Method Based on HBase and Structure Index in Railway Sensor Application","authors":"Menglun Yang, Baopeng Zhang, Yidong Li","doi":"10.1109/PDCAT.2013.13","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.13","url":null,"abstract":"Railway dangerous goods tracing is a typical application of the sensor network. Application correlation among the sensor, carriage and train is a graph relationship which can be described by using RDF frameworks. It requires data management system to manage a large scale of ever-increasing RDF data, and support semantic access for monitoring the safety state of the environment inside the carriage. For these problems, this paper proposes RDF data query and management method based on HBase and structure index, and optimization method of query engine. The method is enforced by rewriting SPARQL statements according of correlation degree between them, and at querying time, \"structure-level\" index is used to identify the groups of RDF data, then the \"data-level\" data matching utilizes the proposed scalable storage mechanism based on hash-oriented multiple table partition of data entity class. As shown in our experiments, our approach can effectively reduce the semantic query time, enhance storage scalability and effective support multi-criteria query of sensor data.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126895701","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

An Efficient Projective Rectification for Trinocular Stereo Vision 三眼立体视觉的有效投影校正

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.34

Qing Zhu, Dan Luo

引用次数: 0

GBD IAAS Manager: A Tool for Managing Infrastructure-as-a-Service for Private and Hybrid Clouds GBD IAAS管理器:用于管理私有云和混合云的基础设施即服务的工具

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.39

C. R. Valêncio, Andrielson Ferreira Da Silva, D. Guimaraes, A. Cansian, M. L. Tronco, A. R. Pinto

引用次数: 0

Implementation of Data Transform Method into NoSQL Database for Healthcare Data 医疗保健数据到NoSQL数据库的数据转换方法实现

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.38

Chao-Tung Yang, Jung-Chun Liu, Wen-Hung Hsu, Hsin-Wen Lu, W. Chu

引用次数: 14

A DWT Based Perfect Secure and High Capacity Image Steganography Method 一种基于小波变换的安全高容量图像隐写方法

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.56

M. Farahani, A. Pourmohammad

引用次数: 23

Simulated-Annealing Load Balancing for Resource Allocation in Cloud Environments 云环境下资源分配的模拟退火负载均衡

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.7

Zongqin Fan, Hong Shen, Yanbo Wu, Yidong Li

引用次数: 27

In-Domain Neighborhood Approach to Heterogeneous Dynamic Load Balancing in Real World Network 现实网络中异构动态负载均衡的域内邻域方法

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.17

E. Daraghmi, S. Yuan

{"title":"In-Domain Neighborhood Approach to Heterogeneous Dynamic Load Balancing in Real World Network","authors":"E. Daraghmi, S. Yuan","doi":"10.1109/PDCAT.2013.17","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.17","url":null,"abstract":"In this paper, we present a novel in-domain neighborhood approach to clarify the dynamic load balancing problem on a heterogeneous network and to solve many practical problems. The distributed system consists of a network of workstations with different domains, speeds and capacities. Since the number of workstations and the diameter of the network affect the convergences rate, our approach introduces the in-domain relation that classifies the entire network into sub-networks called domains. The algorithm runs in each workstation in order to reach the fairness state in-domain and in entire network rapidly. In this paper, our approach is applied to a cafeteria system as a case study, each workstation is viewed as a cafeteria where the maximum number of orders that can be submitted to one cafeteria corresponds to the capacity of that cafeteria workstation, the communication channels are modeled between the in-domain cafeterias, and the workload is represented as orders. An algorithm is presented to simulate the migration of the orders between in-domain cafeterias and to distribute a proportion of the excessive workload of heavily loaded node to lightly loaded node by considering the capacity of each node such that when the algorithm terminates, the effective-load in all cafeterias is the same. Therefore, each workstation receives an amount of workload proportional to its total capacity. This framework is analyzed mathematically, and it is proved that the proposed algorithm converges and achieves the fairness state.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123026704","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}

引用次数: 2

Study on Quantum Parallel Processing by Adiabatic Quantum Computation in Simon Problem Simon问题中绝热量子计算的量子并行处理研究

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.20

S. Nakayama, Gang Peng, I. Iimura

引用次数: 0