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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

294 篇 会议
8 册 图书
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

192 篇 工学
- 176 篇 计算机科学与技术...
- 87 篇 软件工程
- 27 篇 电气工程
- 16 篇 电子科学与技术（可...
- 15 篇 信息与通信工程
- 9 篇 控制科学与工程
- 8 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 3 篇 机械工程
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
40 篇 理学
- 23 篇 数学
- 10 篇 系统科学
- 8 篇 生物学
- 5 篇 物理学
- 4 篇 统计学（可授理学、...
- 2 篇 大气科学
- 1 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
29 篇 管理学
- 22 篇 管理科学与工程(可...
- 16 篇 工商管理
- 10 篇 图书情报与档案管...
2 篇 农学
2 篇 医学
- 2 篇 基础医学(可授医学...
- 2 篇 临床医学
- 2 篇 公共卫生与预防医...

主题

22 篇 parallel process...
17 篇 cloud computing
16 篇 distributed comp...
15 篇 computational mo...
13 篇 routing
12 篇 computer archite...
11 篇 scalability
11 篇 servers
10 篇 graphics process...
10 篇 peer-to-peer com...
9 篇 concurrent compu...
9 篇 resource managem...
9 篇 protocols
9 篇 hardware
9 篇 distributed comp...
8 篇 runtime
8 篇 monitoring
8 篇 real-time system...
8 篇 performance eval...
7 篇 computer science

机构

5 篇 institute of com...
3 篇 university of ch...
2 篇 school of scienc...
2 篇 vienna universit...
2 篇 shanghai key lab...
2 篇 guangdong provin...
2 篇 college of compu...
2 篇 department of co...
2 篇 tu münchen garch...
2 篇 school of comput...
2 篇 green univ bangl...
2 篇 univ chinese aca...
2 篇 school of cybers...
2 篇 school of comput...
2 篇 university of pi...
2 篇 isislab - dipart...
2 篇 department of co...
2 篇 institute of par...
2 篇 tennessee tech u...
2 篇 rwth aachen univ...

作者

3 篇 hai jin
3 篇 gonzalez teofilo...
2 篇 dan meng
2 篇 li cui
2 篇 roy palash
2 篇 chaudhary vipin
2 篇 haibin cai
2 篇 hassan mohammad ...
2 篇 michael alexande...
2 篇 liu yang
2 篇 roberto g. casce...
2 篇 shigeng zhang
2 篇 qiang li
2 篇 alexandru costan
2 篇 ammar reda a.
2 篇 luís lopes
2 篇 emmanuel jeannot
2 篇 vittorio scarano
2 篇 xiaofei liao
2 篇 stephen l. scott

语言

304 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=20th International Conference on Parallel and Distributed Computing Systems, PDCS 2007"

共 306 条记录，以下是11-20 订阅

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

详细简洁

排序：

MiDedup: A Restore-Friendly Deduplication Method on Docker Image Storage systems 20th

MiDedup: A Restore-Friendly Deduplication Method on Docker ...

引用

20th IFIP WG 10.3 international conference on Network and parallel computing, NPC 2024

作者： Qin, Lisha Tan, Haoliang Zou, Xiangyu Ou, Wenhao Wei, Yan Huang, Rubing Xia, Wen Harbin Institute of Technology Shenzhen China Peng Cheng Laboratory Shenzhen China Zhongruan International Technology Service Co. Ltd. Shenzhen China Macau University of Science and Technology Macao China

ISBN: (纸本)9789819628292

Docker image storage systems, like Docker registry, often employ deduplication to reduce storage overhead. Existing deduplication methods for these systems detect redundancy at either layer or file level, each with its own advantages and limitations. Layer-level deduplication offers much faster restoration but lower deduplication ratio, as it eliminates duplicate layers while ignoring duplicate files across layers. Conversely, file-level deduplication offers a higher deduplication ratio but slower restoration, as removing duplicate files scatters the files of a layer, leading to multiple disk read I/O during restoration. Our analysis reveals that the slow restoration in file-level deduplication partly stems from ignoring file-layer relationships. In this paper, we propose MiDedup, a new Docker deduplication method. MiDedup detects redundancy at file-level and organizes files into a restore-friendly layout by considering file-layer relationships to enhance restore speed. Our studies also show that duplicated files of one layer are not uniformly distributed across different layers. MiDedup uses this insight to skip deduplicating scattered files to further optimize the file layout for faster restoration. Evaluations indicate that MiDedup achieves restore speeds that are 8–19× faster than file-level deduplication (slightly slower than layer-level one), while maintaining 9–47% higher deduplication ratios than layer-level deduplication. © IFIP international Federation for Information Processing 2025.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Analysis of parallel Binary Merge Sort in a Grid Environment 20

Analysis of Parallel Binary Merge Sort in a Grid Environment

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Mach, Werner Schikuta, Erich University of Vienna Department of Knowledge and Business Engineering Rathausstraße 19/9 ViennaA-1010 Austria

ISBN: (纸本)9781604233926

this paper presents an analysis of the parallel binary merge sort algorithm and a comparison of its behavior in a generalized multiprocessor framework and a simplified Grid Environment. Based on the well known method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： algorithm analysis grid infrastructure parallel sorting workflow orchestration

来源：评论

学校读者我要写书评

暂无评论

On the Effective Paths for the General Tori 20

On the Effective Paths for the General Tori

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Shen, Zhizhang Qiu, Ke Dept. of Computer Science Plymouth State University PlymouthNH03264 United States Dept. of Computer Science Brock University St. CatharinesONL2S 3A1 Canada

ISBN: (纸本)9781604233926

We propose the notion of the effective routing paths for the general network structures, and study such paths for the general torus structures. Besides presenting and discussing the relevant notions, we give algorithms for constructing such paths for both the mesh and the torus structures, and calculate the number of such paths, for the d-dimensional tori. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithms for Motif Search 20

Parallel Algorithms for Motif Search

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Rajasekaran, Sanguthevar Department of Computer Science and Engineering University of Connecticut StorrsCT06269-2155 United States

ISBN: (纸本)9781604233926

Motif search is the problem of identifying biologically significant parts from large datasets. Several versions of motif search have been proposed in the literature. Numerous algorithms are also available. Since the general problem of finding patterns in sequences is intractable, motif search instances that can be solved in practice are severely constrained. In this paper we propose parallel algorithms for these problems so as to relax the constraints. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A Generalized Token-based Mutual Exclusion Algorithm for Wireless Networks 20

A Generalized Token-based Mutual Exclusion Algorithm for Wir...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Neilsen, Mitchell L. Dept. of Computing and Information Sciences Kansas State University ManhattanKS66506 United States

ISBN: (纸本)9781604233926

this paper presents a distributed mutual exclusion algorithm that generalizes several existing token-based algorithms for use in ad hoc wireless networks. the number of messages required to provide mutual exclusion is dependent upon the logical topology imposed on the nodes and the policy used for forwarding subsequent requests. Using the best topology, the algorithm attains comparable performance to a centralized mutual exclusion algorithm;that is, three messages per critical section. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

distributed Algorithms for Dynamic Coverage in Sensor Networks 20

Distributed Algorithms for Dynamic Coverage in Sensor Networ...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Lin, Lan Lee, Hyunyoung Department of Computer Science University of Denver DenverCO80208 United States

ISBN: (纸本)9781604233926

Topological changes in sensor networks may affect qualities of sensor coverage. In this paper, we present two suites of algorithms for dynamically maintaining the coverage and the measures of its qualities. Using only local knowledge, our algorithms capture the dynamic changes of network topology and efficiently maintain the coverage by updating the radii of sensors combined with limited sensor mobility. Our algorithms are fully distributed and have the advantages of low communication complexity with no need of a tight bound on message propagation delay. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

A QUEUING MODEL FOR DATA SCHEDULING IN REAL-TIME distributed systems 20

A QUEUING MODEL FOR DATA SCHEDULING IN REAL-TIME DISTRIBUTED...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Eltayeb, Mohammed Ozguner, Fusun Department of Physics and Engineering Frostburg State University United States Department of Electrical and Computer Engineering The Ohio State University United States

ISBN: (纸本)9781604233926

In this paper we have addressed the problem of data scheduling in distributed real-time staging systems with large-scale data communications and random requests generation. the ultimate goal is to increase the satisfiability of the distributed application by meeting the assigned deadlines for the requests of the data transfers. this was achieved by devising a new data staging method that depends on a queuing model for the staging network. the model is used to calculate the end-to-end delays estimates for each path. the delay estimates are used by the algorithm to make a path selection decisions. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Metadata Lookup for distributed Query Optimization in P2P Environment 20

Metadata Lookup for Distributed Query Optimization in P2P En...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Al-King, Raddad Hameurlain, Abdelkader Morvan, Franck Université Paul Sabatier 118 route de Narbonne Toulouse Cedex 9F-31062 France

ISBN: (纸本)9781604233926

Due to the characteristics of P2P systems, SQL query processing in these systems is more difficult than traditional DBMS. In this context, query optimization is even more complex. In this paper, we propose two methods allowing optimizer to avoid the bad choices which could be taken because of the lack of informations or the obsolete statistics found on the node initializing the query. the basic idea is to take advantage of the location phase to obtain metadata needed for the optimization phase. the performance evaluation of the proposed methods shows that both methods can improve the execution of complex queries in terms of response time and volume of inter-site transmitted data. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Model and Analysis of the Checkpointing Aided parallel Execution Technique 20

Model and Analysis of the Checkpointing Aided Parallel Execu...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Mereuta, Laura Renault, Éric GET/INT — Samovar UMR INT-CNRS 5157 9 rue Charles Fourier Évry91011 France

ISBN: (纸本)9781604233926

Checkpointing techniques have been used for years to secure the execution of sequential and parallel programs. However, it has been demonstrated recently that they can also be used to generate a parallel program from a sequential source code automatically. As a result, this technique allows any programs to be executed on any kind of distributed parallel system. this article presents the analysis of this innovative technique called CAPE for Checkpointing Aided parallel Execution, and a model for performance evaluation. As an example, the presented model is used to provide some hints to determine the optimal number of processors to run the automatically generated parallel code on a distributed system. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTATIONS OF ASYNCHRONOUS SELF-ORGANIZING MAPS ON OPENMP AND MPI parallel COMPUTERS 20

IMPLEMENTATIONS OF ASYNCHRONOUS SELF-ORGANIZING MAPS ON OPEN...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Hu, Jie Zhang, Liqiang Cheng, Jing Department of Computer Science St Cloud State University St CloudMN56377 United States Open Access Technology Int'l Inc. MinneapolisMN United States

ISBN: (纸本)9781604233926

In [1], we presented an asynchronous parallel algorithm for self-organizing maps based on a recently defined energy function which leads to a self-organizing map. We generalized the existing stochastic gradient approach to an asynchronous parallel stochastic gradient method for generating a topological map on a distributed computer system (MIMD). We theoretically proved that our algorithm was convergent and the simulations showed our algorithm was effective. In this paper, we implement this algorithm on practical parallel computers with two different types: openMP and MPI, in the Supercomputing Institution at University of Minnesota. By analyzing the experimental results, we demonstrate the convergence, efficiency and speed-up of our algorithm. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：