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

9th iasted international conference on parallel and distributed computing and Networks, PDCN 2010

作者： Harada, Takashi Yamashita, Masafumi Graduate School of Management Hiroshima University Hiroshima Japan Department of Informatics Kyushu University Fukuoka Japan

ISBN: (纸本)9780889868205

A typical group mutual exclusion algorithm among m groups makes use of anm-group coterie, which determines the performance of the algorithm. there are two main performance measures: the availability is the probability that an algorithm tolerates process crash failures, and the concurrency is the number of processes that it allows simultaneous access to the resources. Since non-dominated (ND, for short) m-group coteries (locally) maximize the availability and their degrees roughly correspond to the concurrency, methods to construct ND m-group coteries with large degrees are looked for. Nevertheless, only a few naive methods have been proposed. this paper presents three methods to construct desirable m-group coteries. the first method constructs an ND m-group coterie from a dominated one using the transversal composition. the second one constructs an ND (m - 1)-group coterie from an ND m-group coterie. the last one uses the coterie join operation to produce an ND m-group coterie from an ND coterie and another ND mgroup coterie. these methods preserve the degrees of the original m-group coteries.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Minimal Sufficient Information about the Scientific Workflows to Create Reproducible Experiment 19

Minimal Sufficient Information about the Scientific Workflow...

引用

19th IEEE international conference on Intelligent Engineering systems (INES)

作者： Banati, Anna Kacsuk, Peter Kozlovszky, Miklos MTA SZTAKI H-1518 Budapest Hungary Univ Westminster London W1W 6UW England Obuda Univ John von Neumann Fac Informat Biotech Lab Becsi Str 96-b H-1034 Budapest Hungary

ISBN: (纸本)9781467379397

the reproducibility of an in-silico experiment is a great challenge because of the parallel and distributed environment and the complexity of the scientific workflows. In order to solve such problems on one hand provenance data has to be captured about the dataflow, the ancestry of the results and the environment of the execution, on the other hand description data has to be collected from the scientist and stored about the essential details, the types and samples of input/output data, and the operation of the experiment. the ultimate goal of our work is to propose a minimal dataset for recording and reporting scientific workflow based experiment, which will facilitate the reproducibility of such experiments, the public repositories and enable to share and reuse the scientific results. One part of the dataset can be filled in manually by the scientist, certain part can be filled in automatically by the system and other part can be filled in from provenance data.

关键词： data handling parallel processing workflow management software distributed environment hand description data hand provenance data in-silico experiment parallel environment scientific workflows Artificial intelligence conferences Databases Documentation Hardware Libraries Workflow management software Workflow management software data processing parallel PROCESSING (COMPUTERS) Artificial Intelligence Computer hardware Libraries Database Workflow

来源：评论

学校读者我要写书评

暂无评论

19th international conference on Computer Applications in Industry and Engineering, CAINE 2006

19th International Conference on Computer Applications in In...

引用

19th international conference on Computer Applications in Industry and Engineering, CAINE 2006

ISBN: (纸本)9781604236750

the proceedings contain 61 papers. the topics discussed include: evaluation methodology for virtual reality software tools;image compression of facial photographs based on BTC/TSVQ local processing;a novel method for person identification by comparing retinal patterns;achieving near-optimal distortion reduction with invisible watermarking RSSI algorithms;ModVis: an information visualization tool for gene module discovery;adaptive coverage in heterogeneous sensor network;a COTS framework for sensor fusion using dynamic Bayesian networks in livestock production;computer-aided item selection for the cycle counting procedure;performance modeling of hierarchical memories;modeling the dynamic load in distributed control systems (DCS);task-migration support for parallel computing on shared virtual memory clusters;and a novel parallel hardware and software solution for a large-scale biologically realistic cortical simulation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel computation for luc cryptosystems on distributed memory multiprocessor machine

Parallel computation for luc cryptosystems on distributed me...

引用

4th iasted international conference on Advances in Computer Science and Technology, ACST 2008

作者： Ali, Zulkarnain Md Othman, Mohamed Said, Mohd Rushdan Muhd Sulaiman, Mohammad Nasir Department of Computer Science Universiti Kebangsaan Malaysia 43600 Bangi Selangor Malaysia

ISBN: (纸本)9780889867307

Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing computation technique will suffer a huge computations time and spaces when calculating a very large size of public-key and private-key. Recently, a method for fast LUC Cryptosystems computation on single processor has been proposed. In this paper, we extend the method in parallel on distributed memory multiprocessor machine using message-passing interface. We are generating a special sequence from a given value of public-key and private-key. this special sequence will be used to direct the computation of LUC. We examine the parallelism efficiency of the algorithm by analyze the simulation time and speedup.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Euro-Par 2013 parallel Processing - 19th international conference, Proceedings

Euro-Par 2013 Parallel Processing - 19th International Confe...

引用

19th international conference on parallel Processing, Euro-Par 2013

ISBN: (纸本)9783642400469

the proceedings contain 73 papers. the topics discussed include: alignment-based metrics for trace comparison;validation and uncertainty assessment of extreme-scale HPC simulation through Bayesian inference;energy-efficient scheduling with time and processors eligibility restrictions;scheduling jobs with multiple non-uniform tasks;workflow fairness control on online and non-clairvoyant distributed computing platforms;how to be a successful thief: feudal work stealing for irregular divide-and-conquer applications on heterogeneous distributed systems;scheduling HPC workflows for responsiveness and fairness with networking delays and inaccurate estimates of execution times;enhancing concurrency in distributed transactional memory through commutativity;adaptive granularity control in task parallel programs using multiversioning;and online dynamic dependence analysis for speculative polyhedral parallelization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An analysis on adaptive parallel downloading method

An analysis on adaptive parallel downloading method

引用

19th international conference on Advanced Information Networking and Applications

作者： Funasaka, J Hiroshima City Univ Asaminami Ku Hiroshima 7313194 Japan

ISBN: (纸本)0769522491

While traditional downloading programs usually select one mirror server for retrieving a file, it is more effective to select several mirror servers and to fetch different parts of the same file from the servers in parallel from the viewpoints of downloading time and fault-tolerance of network service. We have already proposed an adaptive parallel downloading method that enables us to stabilize and accelerate the downloading time even if the network offers a wide variety of bandwidths. this paper describes a new adaptive block requesting method which improves our original method. the new method has the following features.(1) suitable parameters based on a theoretical model and (2) introduction of changing servers. Practical evaluations that focus on downloading speed and stability of downloading time confirm that the improved method is more effective than the original method.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Artifact: Scalable distributed Data Anonymization

Artifact: Scalable Distributed Data Anonymization

引用

19th IEEE international conference on Pervasive computing and Communications (IEEE PerCom)

作者： di Vimercati, Sabrina De Capitani Facchinetti, Dario Foresti, Sara Oldani, Gianluca Paraboschi, Stefano Rossi, Matthew Samarati, Pierangela Univ Milan Milan Italy Univ Bergamo Bergamo Italy

ISBN: (纸本)9781665404242

We describe the artifact, publicly available at [1], that implements the proposal in [2], and the reproduction of the experimental results. It is an extended and distributed version of the Mondrian anonymization algorithm. Our solution anonymizes large datasets by partitioning data among workers in a distributed setting. It provides parallel execution on a dynamically chosen number of workers, limiting their interaction and data exchange. © 2021 IEEE.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

TeeSwap: Private Data Exchange using Smart Contract and Trusted Execution Environment 23

TeeSwap: Private Data Exchange using Smart Contract and Trus...

引用

23rd IEEE international conference on High Performance computing and Communications, 7th IEEE international conference on Data Science and systems, 19th IEEE international conference on Smart City and 7th IEEE international conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Chen, Peng Shi, Peichang Xu, Jie Fu, Xiang Li, Linhui Zhong, Tao Xiang, Liangliang Kong, Jinzhu College of Computer National University of Defense Technology National Key Laboratory of Parallel and Distributed Processing Changsha410073 China Zhejiang Lab Hangzhou311100 China Kylin Software Co. Ltd Changsha410073 China

ISBN: (纸本)9781665494571

With importance of data value is approved, data-sharing will create more and greater value has become consensus. However, data exchange has to use a trusted third party(TTP) as an intermediary in an untrusted network environment, which may lead to leakage of data privacy. In this paper, we design a system named TeeSwap, which uses smart contract to complete data exchange, and at the same time uses cryptographic algorithms and trusted execution environment (TEE) to ensure privacy in process of data transmission, verification and contract execution. Meanwhile, TeeSwap can ensure the credibility, fairness, integrity and privacy while data are shared in our system. In the end, we implement contracts about data market and data exchange. When confirming the data transaction, data market contract can automatically generate and deploy exchange contract, which can complete the data exchange authoritatively. © 2021 IEEE.

关键词： Data privacy Smart contracts Data communication Cryptography

来源：评论

学校读者我要写书评

暂无评论

AM++: A Generalized Active Message Framework 10

AM++: A Generalized Active Message Framework

引用

19th international conference on parallel Architectures and Compilation Techniques

作者： Willcock, Jeremiah J. Hoefler, Torsten Edmonds, Nicholas G. Lumsdaine, Andrew Indiana Univ Bloomington IN 47401 USA

ISBN: (纸本)9781450301787

Active messages have proven to be an effective approach for certain communication problems in high performance computing. Many MPI implementations, as well as runtimes for Partitioned Global Address Space languages, use active messages in their low-level transport layers. However, most active message frameworks have low-level programming interfaces that require significant programming effort to use directly in applications and that also prevent optimization opportunities. In this paper we present AM++, a new user-level library for active messages based on generic programming techniques. Our library allows message handlers to be run in an explicit loop that can be optimized and vectorized by the compiler and that can also be executed in parallel on multicore architectures. Runtime optimizations, such as message combining and filtering, are also provided by the library, removing the need to implement that functionality at the application level. Evaluation of AM++ with distributed-memory graph algorithms shows the usability benefits provided by these library features, as well as their performance advantages.

关键词： Active Messages parallel Graph Algorithms parallel Programming Interfaces

来源：评论

学校读者我要写书评

暂无评论

A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

引用

JOURNAL OF parallel AND distributed computing 2007年第7期67卷 797-815页

作者： Mittal, Neeraj Mohan, Prajwal K. Univ Texas Dept Comp Sci Richardson TX 75083 USA Intel Corp Digital Home Grp Hillsboro OR 97124 USA

In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their critical sections concurrently. However, processes requesting critical sections belonging to different groups (that is, of different types) must execute their critical sections in a mutually exclusive manner. Most algorithms for solving the group mutual exclusion problem that have been proposed so far in the literature treat all groups equally. this is quite acceptable if a process, at the time of making a request for critical section, selects a group for the critical section uniformly. However, if some groups are more likely to be selected than others, then better performance can be achieved by treating different groups in a different manner. In this paper, we propose an efficient algorithm for solving the group mutual exclusion problem when group selection probabilities are nonuniformly distributed. Our algorithm has a message complexity of 2n - 1 per request for critical section, where n is the number of processes in the system. It has low synchronization delay of one message hop and low waiting time of two message hops. the maximum concurrency of our algorithm is n, which implies that if all processes have requested critical sections of the same type then all of them may execute their critical sections concurrently. Finally, the amortized message-size complexity of our algorithm is O(1). Our experimental results indicate that our algorithm outperforms the existing algorithms, whose complexity measures are comparable to that of ours, by as much as 50% in some cases. (C) 2007 Elsevier Inc. All rights reserved.

关键词： message-passing system resource management group mutual exclusion token-based algorithm non-uniform group selection priority-based scheme

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：