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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

117 篇 会议
3 篇 期刊文献

馆藏范围

120 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

71 篇 工学
- 67 篇 计算机科学与技术...
- 23 篇 软件工程
- 7 篇 电气工程
- 6 篇 信息与通信工程
- 5 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 1 篇 光学工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
14 篇 理学
- 13 篇 数学
- 1 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
11 篇 管理学
- 11 篇 管理科学与工程(可...
- 5 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 教育学
- 1 篇 教育学

主题

19 篇 grid computing
16 篇 concurrent compu...
15 篇 distributed comp...
12 篇 parallel process...
11 篇 computer science
9 篇 parallel process...
9 篇 computer archite...
9 篇 processor schedu...
9 篇 clustering algor...
8 篇 delay
7 篇 application soft...
7 篇 computational mo...
7 篇 computer network...
7 篇 distributed comp...
6 篇 costs
6 篇 large-scale syst...
5 篇 parallel algorit...
5 篇 runtime
5 篇 peer to peer com...
5 篇 scheduling algor...

机构

3 篇 institute of com...
3 篇 univ coll dublin...
3 篇 polish japanese ...
2 篇 ericsson ab kist...
2 篇 inesc-id lisboa
2 篇 ibm deutschland ...
2 篇 polish japanese ...
2 篇 usn postgrad sch...
2 篇 laboratoire d'in...
2 篇 hiroshima univ d...
2 篇 natl univ irelan...
2 篇 univ connecticut...
2 篇 univ cyprus dept...
1 篇 laboratoire de r...
1 篇 department of co...
1 篇 supercomputing c...
1 篇 irisa/inria pari...
1 篇 center for embed...
1 篇 inesc id p-9 lis...
1 篇 laboratoire d'in...

作者

4 篇 m. tudruj
3 篇 l. masko
2 篇 ito yasuaki
2 篇 kechadi m-tahar
2 篇 lastovetsky alex...
2 篇 j. borkowski
2 篇 savvas ik
2 篇 musial peter m.
2 篇 nakano koji
2 篇 d. grigoras
2 篇 tudruj m
2 篇 s. yamagiwa
2 篇 shvartsman alexa...
2 篇 kechadi mt
2 篇 georgiou chryssi...
1 篇 hameurlain a
1 篇 macariu georgian...
1 篇 yamagiwa s
1 篇 park cy
1 篇 schreiner wolfga...

语言

120 篇 英文

检索条件"任意字段=ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing"

共 120 条记录，以下是31-40 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A distributed prime sieving algorithm based on Scheduling by Multiple Edge Reversal

A distributed prime sieving algorithm based on <i>Scheduling...

引用

4th international symposium on parallel and distributed computing (ispdc 2005)

作者： Paillard, G Lavault, C França, F Univ Paris 13 Inst Galilee Lab Informat Paris Nord F-93430 Villetaneuse France

ISBN: (纸本)0769524346

In this article, we propose a fully distributed algorithm for finding all primes in a given interval [2..n] (or (L, R), more generally), based on the SMER - Scheduling by Multiple Edge Reversal - multigraph dynamics. Given a multigraph M of arbitrary topology, having N nodes, an SMER-driven system is defined by the number of directed edges (arcs) between any two nodes of M, and by the global period length of all "arc reversals" in M. In the domain of prime numbers generation, such a graph method shows quite elegant, and it also yields a totally new kind of distributed prime sieving algorithms of an entirely original design. the maximum number of steps required by the algorithm is at most n + root n. Although far beyond the O(n/log log n) steps required by the improved sequential "wheel sieve" algorithms, our SMER-based algorithm is fully distributed and of linear (step) complexity. the message complexity of the algorithm is at Most n Delta(N) + root n Delta(N), where Delta(N) denotes the maximum "multidegree" of the arbitrary multigraph M, and the space required per process is linear.

关键词： distributed prime sieving resource sharing multigraph dynamics scheduling by edge reversal Scheduling by Multiple Edge Reversal

来源：评论

学校读者我要写书评

暂无评论

Evolutionary tuning for distributed database performance

Evolutionary tuning for distributed database performance

引用

ispdc 2005: 4th international symposium on parallel and distributed computing

作者： Gog, Anca Grebla, Horea-Adrian Babes-Bolyai University of Cluj-Napoca Romania Faculty of Mathematics and Computer Science Computer Science Department

ISBN: (纸本)0769524346

Modern companies dynamically change their departmental structure, type of activities and staff. Database management systems of such companies require adequate design and administration solutions. In such a system the initial estimations and predictions for performance characteristics are mandatory but not sufficient. the performance problems of data reallocation and query optimization in distributed database systems done by means of mobile agents and evolutionary algorithms are considered. these problems still present a challenge because of the dynamic changes in data amount, number of components and architectural complexity of nowadays system topologies. the distributed system is modeled as a graph structure on which is defined a dynamic cost vector. the cost vector remains consistent, relevant, by use of mobile agents performing cost statistics and vector updates. An evolutionary algorithm is proposed to solve this NP-Complete problem. Experimental results prove the efficiency of the proposed technique. © 2005 IEEE.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

A comparative simulation analysis of P2P system architectures

A comparative simulation analysis of P2P system architecture...

引用

ispdc 2005: 4th international symposium on parallel and distributed computing

作者： Mahanta, Anjan theeramunkong, thanaruk Sirindhorn International Institute of Technology Thammasat University 131 Moo 5 Tiwanont Rd. Bangkadi Muang Phathumthani 12000 Thailand

ISBN: (纸本)0769524346

this paper gives a comparative study on multilayer file sharing mechanisms in Peer-to-Peer (P2P) systems. Based on a well-known P2P system named Gnutella, two system architectures, 1-layer and 2-layer Ngnu architectures are proposed in order to reduce network traffic and to gain better scalability. these architectures can be applied to large-scale systems, such as e-government, e-office and e-library, which need an efficient file-sharing mechanism. To examine the efficiency and effectiveness of the proposed methods, a number of simulations are made with respect to three factors: time-to-live's (TTLs), the number of nodes and the number of queries. To compare these systems, the number of messages and the mean query hit are measured and compared with the original flat Gnutella system. © 2005 IEEE.

关键词： Systems analysis

来源：评论

学校读者我要写书评

暂无评论

From grid technologies (in 6th of IST RTD 2002-2006) to knowledge utility

From grid technologies (in 6th of IST RTD 2002-2006) to know...

引用

ispdc 2005: 4th international symposium on parallel and distributed computing

作者： Obozinski, Vincent R.

ISBN: (纸本)0769524346

An overview of the Strategic Objective on Advanced Grid Technologies, Systems and Services under the IST (Information Society Technologies) thematic priority of the 6th European RTD Framework Programme (2002-2006) will be provided. the evolution and progress since the 5th Framework Programme will be sketched. the presentation will include a brief description of the portfolio of 12 new projects - with a total EU funding of 52 million &euro- that were launched in the 2nd half of 2004. Latest strategic planning activities with regard to the Strategic Objective -particularly in the context of the European Research Area - will be covered in relative details. the related topics (S.O. 2.5.4) of the IST Work Programme 2005-2006 - as specified for Call 5 - will be addressed in an exhaustive manner. Future perspectives for the 7th Framework Programme (2007-2013) regarding the ICT technology pillar on/ Software, Grids, Security and Dependability/ as laid out in the Commission proposal of April 2005 will be outlined on a high level. A question and answer time will follow the presentation. © 2005 IEEE.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Ghost process: A sound basis to implement process duplication, migration and checkpoint/restart in linux clusters

Ghost process: A sound basis to implement process duplicatio...

引用

ispdc 2005: 4th international symposium on parallel and distributed computing

作者： Vallée, Geoffroy Lottiaux, Renaud Margery, David Morin, Christine Berthou, Jean-Yves ORNL/INRIA/EDF Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN 37831 United States IRISA/INRIA PARIS Project-team Campus Universitaire de Beaulieu 35042 Rennes Cedex France EDF R and D 1 avenue de General de Gaulle 92141 Clamart France

ISBN: (纸本)0769524346

Process management mechanisms (process duplication, migration and checkpoint/restart) are very useful for high performance and high availability in clustering systems. the single system image approach aims at providing a global process management service with mechanisms for process checkpoint, process migration and process duplication. In this context, a common mechanism for process virtualization is highly desirable but traditional operating systems do not provide such a mecahnism. this paper presents a kernel service for process virtualization called ghost process, extending the Linux kernel. the ghost process mechanism has been implemented in the Kerrighed single system image based on Linux. © 2005 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Metaheuristic Approaches to Virtual Machine Placement in Cloud computing: A Review 15

Metaheuristic Approaches to Virtual Machine Placement in Clo...

引用

15th international symposium on parallel and distributed computing (ispdc)

作者： Alboaneen, Dabiah Ahmed Tianfield, Huaglory Zhang, Yan Glasgow Caledonian Univ Sch Engn & Built Environm Glasgow G4 0BA Lanark Scotland Univ Dammam Coll Educ Jubail Ind City Saudi Arabia

ISBN: (纸本)9781509041527

Virtual machine placement (VMP) is mapping virtual machines (VMs) to appropriate physical machines (PMs) to achieve satisfactory objectives such as minimised energy consumption or maximised performance. VMP is considered as a non-deterministic polynomial-time hard (NP-hard) problem. Metaheuristic techniques are able to find near-optimal solutions to NP-hard problems. this paper presents a review upon metaheuristic approaches to VMP in cloud computing.

关键词： cloud computing metaheuristic virtual machine allocation virtual machine placement

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Model Updates in Edge computing: An Optimal Stopping theory Approach 18

Machine Learning Model Updates in Edge Computing: An Optimal...

引用

18th international symposium on parallel and distributed computing (ispdc)

作者： Aleksandrova, Ekaterina Anagnostopoulos, Christos Kolomvatsos, Kostas Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland

ISBN: (纸本)9781728138015

this work studies a sequential decision making methodology of when to update machine learning models in Edge computing environments given underlying changes in the contextual data distribution. the proposed model focuses on updates scheduling and takes into consideration the optimal decision time for minimizing the network overhead. At the same time it preserves the prediction accuracy of models based on the principles of the Optimal Stopping theory (OST). the paper reports on a comparative analysis between the proposed approach and other policies proposed in the respective literature while providing an evaluation of the performances using linear and support vector regression models. Our evaluation process is realized over real contextual data streams to reveal the strengths and weaknesses of the proposed strategy.

关键词： Edge computing machine learning model updates communication efficiency optimal stopping theory

来源：评论

学校读者我要写书评

暂无评论

Local Linear Time Convergence of Primal-Dual Energy Minimization Algorithm for parallel Processing 13

Local Linear Time Convergence of Primal-Dual Energy Minimiza...

引用

13th IEEE international symposium on parallel and distributed computing (ispdc)

作者： Lennerstad, Hakan Blekinge Insitute Technol Dept Math & Nat Sci Karlskrona Sweden

ISBN: (纸本)9781479959198

We consider energy minimization by speed-scaling of an open shop multiprocessor with n jobs and m machines. the paper studies the complexity of a primal-dual solution algorithm of [4], which was an open question in that paper. We prove that in a neighbourhood of the solution the complexity of the algorithm is O(mn log 1/epsilon) if n not equal m and epsilon is the roundoff error of the computer. the paper demonstrates how linearization can be used to investigate the complexity of an algorithm close to the optimum. An estimate of the size of the neighbourhood where the linearization error is smaller than the computer's roundoff error is also given.

关键词： Bismuth Complexity theory Computers Convergence Heuristic algorithms Minimization Processor scheduling scheduling of multiprocessor Computers Complexity theory Heuristic algorithms Converge bismuth parallel PROCESSING (COMPUTERS) Neighborhood Linearization

来源：评论

学校读者我要写书评

暂无评论

Accelerating Machine Learning on Sparse Datasets with a distributed Memory Vector Architecture 16

Accelerating Machine Learning on Sparse Datasets with a Dist...

引用

16th international symposium on parallel and distributed computing (ispdc)

作者： Araki, Takuya NEC Corp Ltd Syst Platform Res Labs Kawasaki Kanagawa Japan

ISBN: (纸本)9781538608623

We propose methods to accelerate machine learning (ML) on sparse datasets with a distributed memory vector architecture. First, we propose a new communication method that reduces the amount of communication by exploiting the sparsity of the data. Second, we propose a new sparse matrix vector multiplication (SpMV) for a vector architecture, which often becomes the kernel operation of ML on sparse datasets. the method keeps the vector length long even in the case of a power law matrix that typically appears in ML workloads. We implemented middleware that incorporates these two methods so that programmers who implement ML algorithms can easily utilize them. the evaluation results show that these methods improve the performance of ML algorithms by up to 4 times. the resulting performance of a vector architecture machine was up to 8.1 times faster than a commodity PC cluster with the same number of cores.

关键词： machine learning sparse matrices vector processors

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated Digital Halftoning by the Local Exhaustive Search 14

GPU-accelerated Digital Halftoning by the Local Exhaustive S...

引用

IEEE 14th international symposium on parallel and distributed computing (ispdc)

作者： Kouge, Hiroaki Ito, Yasuaki Nakano, Koji Hiroshima Univ Dept Informat Engn Kagamiyama 1-4-1 Higashihiroshima 7398527 Japan

ISBN: (纸本)9781467371483

the main contribution of this paper is to show a new GPU implementation for the digital halftoning by the local exhaustive search that can generate high quality binary images. We have considered programming issues of the GPU architecture to implement these two methods on the GPU. the experimental result shows that our GPU implementation for the local exhaustive search on NVIDIA GeForce GTX 980 for a 512x512 gray scale image runs in 732 seconds, while the CPU implementation runs in 37,364 seconds. thus, our GPU implementation attains a speed-up factor of 50.98. Additionally, we also propose a GPU implementation for the digital halftoning by the partial exhaustive search of which the search space of the local exhaustive search is reduced. Similarly, we can accelerate the computation of the partial exhaustive search 30.73 times faster.

关键词： Image processing Digital halftoning GPGPU Local exhaustive search Partial exhaustive search

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共12页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：