检索结果-内蒙古大学图书馆

10th ifip international conference on network and parallel computing, npc 2013

ISBN: (纸本)9783642408199

the proceedings contain 34 papers. the topics discussed include: a virtual network embedding algorithm based on graph theory;access annotation for safe program parallelization;extracting threaded traces in simulation environments;a network-aware virtual machine allocation in cloud datacenter;totoro: a scalable and fault-tolerant data center network by using backup port;a cloud resource allocation mechanism based on mean-variance optimization and double multi-attribution auction;a scheduling method for multiple virtual machines migration in cloud;speeding up Galois field arithmetic on Intel MIC architecture;software/hardware hybrid network-on-chip simulation on FPGA;total exchange routing on hierarchical dual-nets;efficiency of flexible rerouting scheme for maximizing logical arrays;conditional diagnosability of complete Josephus cubes;accelerating parallel frequent itemset mining on graphics processors with sorting;and asymmetry- aware scheduling in heterogeneous multi-core architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel Computation of the Combination of Two Point Operations in Conic Curves Cryptosystem over GF(2n) Using Tile Self-assembly 20th

Parallel Computation of the Combination of Two Point Oper...

引用

20th ifip WG 10.3 international conference on network and parallel computing, npc 2024

作者： Li, Yongnan School of National Security People’s Public Security University of China Beijing100038 China

ISBN: (纸本)9789819628292

How to accomplish the basic operations in cryptosystem becomes a hot research direction in the field of DNA-based cryptography. this paper proposes a DNA computing model that could fulfill parallel computation of point-addition and point-doubling, two fundamental point operations in conic curves cryptosystem, using tile self-assembly. the combination of the two operations is a key step to compute point-multiplication, a point operation to generate intractability of conic curve discrete logarithm problem. Point-addition is deduced by division in one sub-model and another sub-model calculates point-doubling directly and generates the parameters for division. the assembly time complexity of this model is 2n2+3n-3, and the space complexity is n4+3n3-3n+1. © ifip international Federation for Information Processing 2025.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

CMS: A Computility Resource Status Management and Storage Framework 20th

CMS: A Computility Resource Status Management and Storage F...

引用

20th ifip WG 10.3 international conference on network and parallel computing, npc 2024

作者： Peng, Xiaohui Luo, Xudong Chang, Kuo Wang, Yifan Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Nanjing Institute of InforSuperBahn Nanjing China

ISBN: (纸本)9789819628292

With the increasing demand for computility, managing distributed computility resources is crucial for improving service quality and performance of the cross-region computility infrastructure. In order to ensure timely and accurate scheduling of computing tasks on such infrastructure, a distributed computility status storage and query system is needed to achieve millisecond-level performance in terms of multidimensional sort query and multidimensional range query for computility status. thus, we propose CMS, a computility resource status management and storage framework, which leverages specialized multidimensional indexes to support millisecond-level resource status reporting and querying, as well as sort and range queries. In addition, we developed BCQL and a set of querying algorithms to enhance throughput and reduce query latency. Experimental results show that the average query latency of the multidimensional sorting queries and range queries of the CMS system is 2.499 ms and 2.014 ms, respectively. While, the latency of those queries in Redis-based framework reach 25.66 ms and 25.13 ms, which are 10× higher than the CMS. © ifip international Federation for Information Processing 2025.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

LDChain: A Lightweight and Scalable Blockchain System for Dynamic IoT Scenarios 20th

LDChain: A Lightweight and Scalable Blockchain System for ...

引用

20th ifip WG 10.3 international conference on network and parallel computing, npc 2024

作者： Wang, Jianrong Cao, Yuxuan Hu, Dengcheng Li, Qi Li, Sen Li, Xuewei Liu, Xiulong College of Intelligence and Computing Tianjin University Tianjin China School of Electrical and Information Engineering Tianjin University Tianjin China School of Future Technology Tianjin University Tianjin China

ISBN: (纸本)9789819628292

As a distributed ledger, blockchain inherently guarantees data consistency. However, when applied to the Internet of things (IoT), existing solutions employing blockchain systems struggle to address the scalability demands posed by the dynamic mobility of heterogeneous devices. To this end, we propose Lightweight DAG Chain (LDChain), a lightweight and scalable blockchain system tailored for IoT scenarios. LDChain connects weak nodes and strong nodes through a hierarchical DAG consensus algorithm. For weak nodes, we introduce a transaction-based DAG consensus mechanism utilizing a snapshot synchronization strategy to cater to the dynamic nature of weak nodes and the scalability demands of the system. the integrated snapshot synchronization strategy, based on the second latest block transaction selection algorithm, reduces the storage and computational overhead for resource-restricted devices. For strong nodes, we devise a block-based DAG consensus mechanism and a repackaging strategy, which resolves transaction conflicts across regions by managing conflicting transactions through a priority queue. We implement a prototype of LDChain and conduct experiments in a network environment comprising 10 cloud servers, simulating several strong nodes and weak nodes. the experimental results show that our system achieves a throughput exceeding 7000 transactions per second (TPS) and a transaction confirmation latency of 1.3 s with 100 nodes. © ifip international Federation for Information Processing 2025.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

network and parallel computing

引用

international JOURNAL OF parallel PROGRAMMING 2015年第3期43卷 311-315页

作者： Hsu, Ching-Hsien Li, Xiaoming Shi, Xuanhua Chung Hua Univ Dept Comp Sci & Informat Engn Hsinchu Taiwan Univ Delaware Dept Elect & Comp Engn Newark DE USA Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

It’s our pleasure to bring you this special issue of the international Journal of parallel Programming on the network and parallel computing. Prior to the publication to this special issue, all papers were presented in the 10th ifip international conference on network and parallel computing (npc’13) held from September 19 to September 21 2013 in Guiyang, China. Since 2003, npc has become a valuable venue for engineers and scientists to present their excellent ideas and experiences in system?fields of distributed and parallel computing. the npc 2013 continues this tradition and in particular extends areas of interest to Big data computing and parallel and multicore issues and opportunities. Huazhong University of Science and Technology, China organized this year’s npc conference.

关键词： CLOUD storage SEMANTIC Web parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Conditional Diagnosability of Complete Josephus Cubes

Conditional Diagnosability of Complete Josephus Cubes

引用

10th ifip international conference on network and parallel computing (npc)

作者： Lu, Lishan Zhou, Shuming Fujian Normal Univ Sch Math & Comp Sci Fuzhou 350007 Fujian Peoples R China Fujian Normal Univ Key Lab Network Secur & Cryptol Fuzhou 350007 Peoples R China

ISBN: (纸本)9783642408199;9783642408205

the growing size of the multiprocessor system increases its vulnerability to component failures. the fault diagnosis is the process of identifying faulty processors in a system through self-testing, and the diagnosability is an important parameter to measure the reliability of an interconnection network. As a new measure of fault tolerance, conditional diagnosability can better evaluate the real diagnosability of interconnection networks. In this paper, we derive the conditional diagnosability of the multiprocessor systems in terms of Complete Josephus Cubes CJC(n) (n >= 8) under the comparison model.

关键词： Comparison diagnosis conditional diagnosability Complete Josephus Cubes

来源：评论

学校读者我要写书评

暂无评论

A network-Aware Virtual Machine Allocation in Cloud Datacenter

A Network-Aware Virtual Machine Allocation in Cloud Datacent...

引用

10th ifip international conference on network and parallel computing (npc)

作者： Yao, Yan Cao, Jian Li, Minglu Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China

ISBN: (纸本)9783642408199;9783642408205

In a cloud computing environment, virtual machine allocation is an important task for providing infrastructure services. Generally, the datacenters, on which a cloud computing platform runs, are distributed over a wide area network. therefore, communication cost should be taken into consideration when allocating VMs across servers of multiple datacenters. A network-aware VM allocation algorithm for cloud is developed. It tries to minimize the communication cost and latency between servers, with the number of VMs, VM configurations and communication bandwidths are satisfied to users. Specifically, a two-dimensional knapsack algorithm is applied to solve this problem. the algorithm is evaluated and compared with other ones through experiments, which shows satisfying results.

关键词： VM allocation cloud datacenter Two dimensional knapsack algorithm

来源：评论

学校读者我要写书评

暂无评论

A Cloud Resource Allocation Mechanism Based on Mean-Variance Optimization and Double Multi-Attribution Auction

A Cloud Resource Allocation Mechanism Based on Mean-Variance...

引用

10th ifip international conference on network and parallel computing (npc)

作者： Gao, Chengxi Wang, Xingwei Huang, Min Northeastern Univ Coll Informat Sci & Technol Shenyang Peoples R China

ISBN: (纸本)9783642408199;9783642408205

As a new kind of commercial model, cloud computing can integrate various kinds of resources in the network. Resource providers offer these resources to users in the form of service and receive corresponding profits. To make more rational use of the cloud resources, an effective mechanism is necessary for allocating the resources. In this paper, the price attribution and non-price attributions of both traders are analyzed. the support vector machine algorithm is utilized to predict the price, further determining the quote and bid. then, the BP neural network algorithm is used to transfer the non-price attributions to the quality index. Finally, to maximize the total satisfaction of resource providers and resource consumers, the mean-variance optimization algorithm is adopted to obtain the optimized cloud resource allocation scheme. Simulation results have shown that the proposed mechanism is feasible and effective.

关键词： Cloud resource Double multi-attribution auction BP neural network Support vector machine Mean-variance optimization

来源：评论

学校读者我要写书评

暂无评论

One-to-One Disjoint Path Covers in DCell

One-to-One Disjoint Path Covers in DCell

引用

10th ifip international conference on network and parallel computing (npc)

作者： Wang, Xi Fan, Jianxi Cheng, Baolei Liu, Wenjun Wang, Yan Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Peoples R China

ISBN: (纸本)9783642408199;9783642408205

DCell has been proposed for one of the most important data center networks as a server centric data center network structure. DCell can support millions of servers with outstanding network capacity and provide good fault tolerance by only using commodity switches. In this paper, we prove that there exist r vertex disjoint paths {P(i vertical bar)1 <= i <= r} between any two distinct vertices u and v of DCell(k) (k >= 0) where r = n + k - 1 and n is the vertex number of DCell(0). the result is optimal because of any vertex in DCell(k) has r neighbors with r = n + k - 1.

关键词： DCell Data Center network Disjoint Path Covers Hamiltonian

来源：评论

学校读者我要写书评

暂无评论

Total Exchange Routing on Hierarchical Dual-Nets

Total Exchange Routing on Hierarchical Dual-Nets

引用

10th ifip international conference on network and parallel computing (npc)

作者： Li, Yamin Chu, Wanming Hosei Univ Tokyo 1848584 Japan Univ Aizu Aizu Wakamatsu Fukushima Japan

ISBN: (纸本)9783642408199;9783642408205

the hierarchical dual-net (HDN) is a newly proposed interconnection network for massive parallel computers. the HDN is constructed based on a symmetric product graph (base network). A k-level hierarchical dual-net, HDN(B, k, S), contains n(k) = (2n(0))(2k) /(2 Pi(k)(i=1) s(i)) nodes, where S = {G(1)', G(2)', ... , G(k)'}, G(i)' is a super-node and s(i) = vertical bar G(i)'vertical bar is the number of nodes in the super-node at the level i for 1 <= i <= k, and n(0) is the number of nodes in the base network B. the S is used mainly for adjusting the scale of the system. the node degree of HDN(B, k, S) is d(0) + k, where d(0) is the node degree of the base network. the HDN is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. the total exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper, we show that the total exchange routing can be done on HDN efficiently.

关键词： interconnection network total exchange routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：