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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

550 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

544 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

检索条件"任意字段=19th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 566 条记录，以下是381-390 订阅

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

详细简洁

排序：

the efficient characterization of adaptive applications through fine profiling based on data locality

The efficient characterization of adaptive applications thro...

引用

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

作者： Liu, Qingyuan Tomko, Karen A. Univ Cincinnati Dept Elect & Comp Engn & Comp Sci Cincinnati OH 45221 USA

ISBN: (纸本)9780889866386

the efficient characterization of adaptive parallel applications is usually challenging due to their complexity and large problem size. Unlike traditional profiling approaches which target the tracing of events or determining performance parameters for subroutines, the approach described in this paper attempts to discover the inherent adaptivity of parallel applications mapped to the computation domain/mesh, which are independent of runtime environment, so as to aid in the performance tuning of parallel applications, especially dynamic load balancing and repartitioning. Our profiling scheme only requires one-time execution of the target program on any platform to generate a sequence of traces with timestamps. the traces can then be fed to simulations under various system configurations while independent of the real application. Preliminary experiments have been performed to evaluate the proposed profiling techniques.

关键词： parallel computing mesh-based adaptive application profiling

来源：评论

学校读者我要写书评

暂无评论

Investigating the replica transfer scheduling problem

Investigating the replica transfer scheduling problem

引用

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

作者： Loukopoulos, thanasis Tziritas, Nikos Lampsas, Petros Lalis, Spyros Univ Thessaly Dept Comp & Commun Engn Glavani 37 Volos 38221 Greece

ISBN: (纸本)9780889866386

the Replica Placement Problem (RPP) aims at selecting the nodes for duplicating data objects in order to optimize their access. Even though a lot of work already exists on RPP, the issue of implementing the resulting allocation scheme is typically overlooked. In this paper we introduce the Replica Transfer Scheduling Problem (RTSP), briefly stated as: given a network of servers with limited storage capacitv, a set of data objects and two replication schemes x(old) and X-new, find a schedule of object transfers and deletions for implementing X-old based on X-old with minimum communication cost. Given that this problem is NP-complete, we introduce several different heuristics to solve it, and evaluate them via simulations.

关键词： replica placement replica transfers distributed systems

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Approach to Tuning distributed Operating System Load Balancing Algorithms 19

Machine Learning Approach to Tuning Distributed Operating Sy...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Meehan, J. Michael Ritter, Alan Computer Science Department Western Washington University BellinghamWA98225 United States

ISBN: (纸本)9781604236446

this work concerns the use of machine learning techniques (genetic algorithms) to optimize load balancing policies in the openMosix distributed operating system. Parameters/alternative algorithms in the openMosix kernel were dynamically altered/selected based on the results of a genetic algorithm fitness function. In this fashion optimal parameter settings and algorithms choices were sought for the loading scenarios used as the test cases. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Constraint-Based Framework for Concurrent and distributed Programming 19

A Constraint-Based Framework for Concurrent and Distributed ...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Ramirez, Rafael Santosa, Andrew E. Technology Department Pompeu Fabra University Barcelona Spain School of Computing National University of Singapore Singapore

ISBN: (纸本)9781604236446

Constraint-based synchronization pioneered by (concurrent) logic and concurrent constraint programming is a powerful mechanism for synchronizing concurrent computations. this paper describes (1) a general constraint-based framework which combines declarative and imperative programming for writing concurrent applications (2) a particular implementation of the framework (for both uniprocessors and distributed systems) as an extension to the Java programming language, and (3) how model-based verification methods can be directly applied to programs in the resulting language. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

MSOMS: A meta simulation Framework for Optimizing Multidomain Simulation

MSOMS: A meta simulation Framework for Optimizing Multidomai...

引用

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

作者： Khan, Moinul H. Georgia Inst Technol Austin TX 78739 USA

ISBN: (纸本)9780889866386

Complex system design and analysis requires simulations with different views or domains. Multi-domain simulation models typically are a collection of simulation model integrated through various means. these concurrent models may be implemented to be closely integrated or distributed as parallel-distributed simulation or mix of the two. Performance of a coupled simulation between multiple domain models depends on various factors. Some of them are, integration backplane architecture, messaging schemes, sharing scheme, level of coupling, fidelity of domain models etc. Framework for Optimizing Multidomain Simulation (MSOMS) is a framework which can be used to estimate performance and effectiveness of integration methods under various scenarios. the framework is referred as meta-simulation, since it is a "simulation of a simulation". this paper captures formulation and demonstration of MSOMS. We compared two possible implementations of a multi-domain model using MSOMS as a case study.

关键词： multidomain modeling HLA distributed simulation

来源：评论

学校读者我要写书评

暂无评论

A distributed peer-to-peer grid scheduler

A distributed peer-to-peer grid scheduler

引用

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

作者： Liu, Cong Baskiyar, Sanjeev Wang, Chengjun Auburn Univ Auburn AL 36849 USA

ISBN: (纸本)9780889866386

In a grid computing environment, dynamicity, and geographically distributed sites, make task scheduling problems challenging to solve. It is hard for a local site to obtain precise real-time information about other sites given that specific information on a site such as load and computing resources may change rapidly. Moreover, in data grid environment, large scale data intensive applications make scheduling problems even more challenging since both computational and data storage resources must be taken into consideration. In this paper we propose an innovative peer-to-peer scheduler to solve these problems. this scheduler is distributed and scalable. We used simulation to evaluate the performance of the scheduler under different circumstances, such as different number of hops to search suitable sites and different number of incoming tasks. Results show that our scheduler can successfully schedule around 75% of incoming tasks within their deadlines in average. For computation-intensive tasks, it can successfully schedule more than 90% of incoming tasks.

关键词： data grid peer-to-peer scheduler distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

Efficient support of fine-grained futures in Java

Efficient support of fine-grained futures in Java

引用

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

作者： Zhang, Lingli Krintz, Chandra Soman, Sunil Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9780889866386

A future is a parallel programming language construct that enables programmers to specify potentially asynchronous computations. We present and empirically evaluate a novel implementation of futures for Java. Our futures implementation is a JVM extension that couples estimates of future computational granularity with underlying resource availability to enable automatic and adaptive decisions of when to spawn futures in parallel or to execute them sequentially. Our system builds from, combines. and extends (i) lazy task creation and (ii) a JVM sampling infrastructure previously used solely for dynamic and adaptive compilation. We empirically evaluate our system using different benchmarks, triggers for automatic spawning of futures, processor availability, and JVM configurations. We show that our future implementation for Java is efficient and scalable for fine-grained Java futures without requiring programmer intervention.

关键词： Java futures fine-grained parallel programming task scheduling profile-guided

来源：评论

学校读者我要写书评

暂无评论

RHT: Supporting range queries in DHT-based P2P systems

RHT: Supporting range queries in DHT-based P2P systems

引用

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

作者： Liu, Lintao Ryu, Kyung Dong Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA IBM Corp TJ Watson Res Ctr Hawthorne NY 10532 USA

ISBN: (纸本)9780889866386

An efficient range query processing support is required for distributed Hash Table (DHT)-based P2P networks as consistent hashing destroys the inherent order of numeric keys. In this paper, we present a lightweight and efficient mechanism, called Range Hash Tree (RHT), to support range queries on DHTs. In RHT, key space is partitioned into small ranges such that data items within one range can be stored on one node. To quickly resolve a range query, we introduce a scalable encoding algorithm that can represent the key space partitioning status with a small RHT Signature. Compared to other approaches, RHT provides a bounded query delay, which is independent of the size of range query and the number of matching data items. Our experiments show that RHT works efficiently on both uniform and much skewed data distributions.

关键词： range queries distributed Hash Table signature Peer-to-Peer distributed computing

来源：评论

学校读者我要写书评

暂无评论

Communication-aware parallel Domain Decomposition using Space Filling Curves 19

Communication-aware Parallel Domain Decomposition using Spac...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Seal, Sudip Aluru, Srinivas Department of Electrical and Computer Engineering Iowa State University AmesIA50011 United States

ISBN: (纸本)9781604236446

Space filling curves (SFCs) are proximity preserving linearizations of multidimensional data. they are frequently used for parallel domain decomposition in scientific computing applications where interactions occur between elements with physical proximity. the conventional way to affect SFC-based parallel domain decomposition is to take the SFC-linearization and map it to processors in a block distributed fashion. In this paper, we derive closed form formulas for the average nearest neighbor distance along a Z-space filling curve and use this result to show that such a mapping may not be communication efficient. We introduce topology-aware mapping of SFC data to parallel computers and show that SFC data can be partitioned on hypercubes such that communication is restricted to nearest neighbors. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED PROCESSOR ALLOCATION SCHEME for MIXED parallel TASK GRAPHS 19

AN IMPROVED PROCESSOR ALLOCATION SCHEME for MIXED PARALLEL T...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Bansal, Savina Kumar, Padam Singh, Kuldip Deptt of ECE GZSCET Bathinda India Deptt of E &CE IIT Roorkee India

ISBN: (纸本)9781604236446

A two-step Modified Critical Path and Area-based (MCPA) scheduling heuristic is developed which targets at improving the processor allocation phase of an existing Critical Path and Area-based (CPA) scheduling algorithm. Strength of the suggested algorithm lies in bridging the gap between the processor allocation and task assignment phases of scheduling. Performance of the suggested algorithm, as evaluated for random and real application task graph suite, is better than the CPA algorithm and comparable to more complex CPR algorithm. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：