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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
19 篇 期刊文献
9 册 图书

馆藏范围

1,019 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

763 篇 工学
- 735 篇 计算机科学与技术...
- 525 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 dongarra jack
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,000 篇 英文
19 篇 其他

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

共 1019 条记录，以下是81-90 订阅

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

详细简洁

排序：

Dynamic rescheduling scheme for large-scale workflows

Dynamic rescheduling scheme for large-scale workflows

引用

iasted international conference on parallel and distributed computing and systems, pdcs 2010

作者： Matsumoto, Masaki Ohno, Kazuhiko Sasaki, Takahiro Kondo, Toshio Nakashima, Hiroshi Department of Information Engineering Mie University 1577 Kurimamachiya-cho Tsu Mie 514-8507 Japan Academic Center for Computing and Media Studies Kyoto University Yoshida-Honmachi Sakyo-ku Kyoto 606-8501 Japan

ISBN: (纸本)9780889868786

Task scheduling is very important for effcient execution of large-scale workflows in distributed computing environments. Static scheduling schemes achieve high performance when executing workflow in stable environments. However, the scheduling costs are very high for largescale workflow and they may perform poorly if the system performance is changed dynamically. Demand-driven scheduling schemes achieve high performance for independent tasks, but they may perform poorly for workflow. Dynamic rescheduling schemes have the advantages of these two types of schemes, because tasks are rescheduled using algorithms from static scheduling schemes when the performance is changed. Thus, better performance can be achieved in workflow applications, although the scheduling costs are increased if the system performance is frequently changed. Therefore, a new dynamic scheduling scheme is proposed to reduce the number of rescheduling tasks. The rescheduling trigger of this scheme is based on task terminations. Moreover, the scheme reduces the number of rescheduling tasks compared to a scheme using a simple task termination trigger by checking dependencies between tasks. Evaluation using an abstract simulation demonstrated that the number of rescheduling tasks was reduced to approximately 1/4 to 1/100 of that without, and with a 5% increase of the execution time.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Hiding I/O latency with parallel pre-execution prefetching

Hiding I/O latency with parallel pre-execution prefetching

引用

iasted international conference on parallel and distributed computing and systems, pdcs 2012

作者： Zhao, Yue Yoshigoe, Kenji Department of Computer Science University of Arkansas at Little Rock 2801 S. University Avenue Little Rock AR 72204 United States

parallel applications continue to suffer more from I/O latency as the rate of increase in computing power grows faster than that of memory and storage access performance. I/O prefetching is an effective solution to hide the latency, yet existing I/O prefetching techniques are conservative and their effectiveness is limited. A pre-execution prefetching approach, whereby a thread dedicated to read operations is executed ahead of main thread in order to hide I/O latency, has been put forward to solve this "I/O wall" problem in a recent work. We first identify the limitation of applying the existing pre-execution prefetching approach due to read after write (RAW) dependency, and then propose a method to overcome this limitation by assigning a thread for each dependent read operation. Preliminary experiments, including one from Hill encryption as a real-life application, verify the benefits of the proposed approach.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

A distributed optimization approach to ubiquitous display environments

A distributed optimization approach to ubiquitous display en...

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Heider, Thomas Giersich, Martin Kirste, Thomas Rostock Univ Mobile Multimedia Informat Syst Grp Rostock Germany

ISBN: (纸本)9780889866386

Emerging multiple display infrastructures provide users with a large number of semi-public and private displays. Selecting what information to present on which display here becomes a real issue, especially when multiple users with diverging interests have to be considered. This especially holds for dynamic ensembles of displays. We propose to cast the Display Mapping problem as an optimization task. We develop an explicit criterion for the global quality of a display mapping and then describe a distributed algorithm based on the GRASP framework that is able to approximate the global optimum through local interaction between display devices. We claim that such a distributed optimization approach, based on the definition of an explicit global quality measure, is a general concept for achieving coherent ensemble behavior.

关键词： distributed agents optimization algorithms ubiquitous computing multiple display environments

来源：评论

学校读者我要写书评

暂无评论

Implementing a multiple-instruction-stream associative MASC processor

Implementing a multiple-instruction-stream associative MASC ...

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Wang, Hong Walker, Robert A. Univ Toledo Dept Engn Technol 2801 W Bancroft St Toledo OH 43606 USA Kent State Univ Dept Comp Sci Kent OH 44242 USA

ISBN: (纸本)9780889866386

For search-intensive applications such as data mining and bioinformatics, a SIMD Processor Array on a Chip may be an effective architecture, and if the application is control-intensive, a Multiple SIMD (MSIMD) architecture may further increase processor utilization. In this paper, we describe the implementation of an associative MSIMD architecture on the MASC Processor. The MASC Processor implemented using FPGAs, is easily scalable, and dynamically assigns tasks to Processing Elements as the program executes.

关键词： SIMD multiple SIMD (MSIMD) associative computing processor array processor design FPGA

来源：评论

学校读者我要写书评

暂无评论

SLINC: A framework for volunteer computing

SLINC: A framework for volunteer computing

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Baldassari, James Finkel, David Toth, David Raytheon Network Centr Syst Tewksbury MA USA Worcester Polytech Inst Comp Sci Dept Worcester MA USA

ISBN: (纸本)9780889866386

Volunteer computing is an innovative approach to high performance computing that relies on volunteers who donate their personal computers' unused resources to a computationally intensive research project. Prominent volunteer computing projects include SETI@home, Folding@Home, and The Great Internet Mersenne Prime Search (GIMPS). Many volunteer computing projects are built upon a volunteer computing framework that abstracts functionality that is common to all volunteer computing projects, such as network communications, database access, and project management. These volunteer computing frameworks tend to be complex, limiting, and difficult to use. We have designed and implemented a new volunteer computing framework called the Simple Light-weight Infrastructure for Network computing (SLINC) that addresses the disadvantages we identified with existing frameworks. SLINC is a flexible and extensible volunteer computing framework that will enable researchers to more easily build volunteer computing projects.

关键词： volunteer computing and distributed computing

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for computing alternate paths avoiding failed nodes and links

Distributed algorithms for computing alternate paths avoidin...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Bhosle, Amit M. Gonzalez, Teofilo F. Department of Computer Science University of California Santa Barbara CA 93106 United States

ISBN: (纸本)9780889868113

A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like the Internet. Thus, having the routing paths globally recomputed on a failure does not pay off since the failed element recovers fairly quickly, and the recomputed routing paths need to be discarded. In this paper, we present the first distributed algorithm that computes the alternate paths required by some proactive recovery schemes for handling transient failures. Our algorithm computes paths that avoid a failed node, and provides an alternate path to a particular destination from an upstream neighbor of the failed node. With minor modifications, we can have the algorithm compute alternate paths that avoid a failed link as well. To the best of our knowledge all previous algorithms proposed for computing alternate paths are centralized, and need complete information of the network graph as input to the algorithm.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Overlaying an opportunistic virtual storage system on the unagrid infrastructure

Overlaying an opportunistic virtual storage system on the un...

引用

iasted international conference on parallel and distributed computing and systems, pdcs 2011

作者： Cano, Mario Villamizar Oviedo, Arthur Castro, Harold Osorio, Juan Universidad de Los Andes Carrera 1 No 18A-12 Bogotá D.C. Colombia

ISBN: (纸本)9780889869073

UnaGrid is an opportunistic virtual grid infrastructure that takes advantage of the idle processing capabilities of conventional desktop machines in computer labs through the use of Customizable Processing Virtual Clusters (CPVCs), these capabilities are used in the development of e-Science projects. Up to now, however, a dedicated NFS-NAS solution is employed as the storage system. This solution does not take advantage of the idle storage capabilities of the desktop machines. This paper presents the design, implementation and assessment of a virtual storage system, which simultaneously allows UnaGrid to take advantage of the storage and processing capabilities available in tens of desktop machines. The tests executed show that the strategy used to create the virtual storage system achieves large storage capabilities, at low cost, and superior performance than a NFS-NAS dedicated solution.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Tree clocks: An efficient and entirely dynamic logical time system

Tree clocks: An efficient and entirely dynamic logical time ...

引用

international conference on parallel and distributed computing and Networks

作者： Landes, Tobias Tech Univ Munich Inst Informat D-85748 Garching Germany

ISBN: (纸本)9780889866379

A large number of tasks in distributed systems are based on the fundamental problem of tracing the causal dependencies among the events that characterize a run of the computation. This problem is commonly solved by appliance of vector clocks as a means of capturing the flow of information within and among distributed processes. In the paper at hand a new kind of logical clock concept is presented and examined that is meant to overcome the vector clocks' great drawback: that the number of processes in the distributed system has to be constant and known in advance. Tree clocks are designed to naturally and efficiently scale with the dynamic creation and termination of processes without losing their primary functionality, such as causality tracing, event ordering, and gap detection. In most aspects, they even are more efficient than vector clocks.

关键词： distributed systems logical time dynamic vector clocks

来源：评论

学校读者我要写书评

暂无评论

Implementation of a singular value decomposition module on an FPGA

Implementation of a singular value decomposition module on a...

引用

iasted international conference on parallel and distributed computing and systems, pdcs 2011

作者： Hosseinimehr, Masoud Montealegre, Norma University of Paderborn Warburger Str. 100 Paderborn NRW Germany Design of Distributed Embedded Systems Heinz Nixdorf Institute Fuerstenalle 11 Paderborn NRW Germany

ISBN: (纸本)9780889869073

Since FPGAs are more flexible than general purpose processors, they are used for accelerating the computation of algorithms. Singular value decomposition is the factorization of a matrix, useful in computations executed for signal processing and pattern recognition. This paper deals with the hardware implementation of the singular value decomposition of a given matrix. The used algorithm is based on a compact SVD presented by A. O. Tarakanov. That algorithm compared with others showed to be resource efficient and straightforward for being implemented in hardware. It has been programmed in VHDL and implemented in an FPGA trying to find a compromise among resources, run time, precision and parallelism. The VHDL module uses floating point numbers which bit width can be modified for tuning the precision of the results. Conventional higher level languages for the development of hardware do not allow working with floating point numbers and give rather a less optimal design as the evaluation at the end shows.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

On the timeliness of a cluster based large scale online video surveillance

On the timeliness of a cluster based large scale online vide...

引用

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

作者： Sinha, Koushik Chowdhury, Atish Datta Ghosh, Subhas K. Banerjee, Satyajit Honeywell Technology Solutions 151/1 Bannerghatta Road Bangalore 560076 India

ISBN: (纸本)9780889867741

Timeliness is an important issue for video based surveillance and is often quantified by the delay between the time of availability of image frames from cameras and completion of their processing. Most existing commercial video surveillance systems focus on the issues of efficient storage and retrieval, remote monitoring, data streaming, forensics and limited real-time analysis - but not explicitly on the timeliness issues of large scale online analysis vis-a-vis resource utilization. In this paper we present a new load distribution strategy for on-line, large scale video data processing clusters that are used as an aid to manual surveillance. We propose a novel approach for fine grained load balancing, modeled as a minimization of average completion time problem. The proposed approach is robust in the sense that it is not dependent on the estimates of future loads or on the worst case execution requirements of the video processing load. Simulation results with real-life video surveillance data establish that for a desired timeliness in processing the data, our approach reduces the number of compute nodes by more than a factor of two, compared to systems without the load migration heuristics.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：