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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,404 篇 会议
127 篇 期刊文献
6 册 图书

馆藏范围

3,537 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,760 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 534 篇 信息与通信工程
- 428 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
90 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,489 篇 英文
46 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing"

共 3537 条记录，以下是841-850 订阅

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

详细简洁

排序：

Automatic concurrency management for distributed applications

Automatic concurrency management for distributed application...

引用

15th ieee symposium on Computers and Communications, ISCC 2010

作者： Li, Huiba Liu, Shengyun Peng, Yuxing Li, Dongsheng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781424477555

Building distributed applications is difficult mostly because of concurrency management. Existing approaches primarily include events and threads. Researchers and developers have been debating for decades to prove which is superior. Although the conclusion is far from obvious, this long debate clearly shows that neither of them is perfect. One of the problems is that they are both complex and error-prone. Both events and threads need the programmers to explicitly manage concurrency, and we believe it is just the source of difficulties. In this paper, we propose a novel approach-automatic concurrency management by the runtime system. It dynamically analyzes the programs to discover potential concurrency opportunities;and it dynamically schedules the communication and the computation tasks, resulting in automatic concurrent execution. this approach is inspired by the instruction scheduling technologies used in modern microprocessors, which dynamically exploits instruction-level parallelism. However, hardware scheduling algorithms do not fit software in many aspects, thus we have to design a new scheme completely from scratch. automatic concurrency management is a runtime technique with no modification to the language, compiler or byte code, so it is good at backward compatibility. It is essentially a dynamic optimization for networking programs. © 2010 ieee.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers

Algorithmic mechanisms for internet-based master-worker comp...

引用

24th ieee International parallel and distributed processing symposium, IPDPS 2010

作者： Anta, Antonio Fernández Georgiou, Chryssis Mosteiro, Miguel A. LADyR GSyC Universidad Rey Juan Carlos Spain Dept. of Computer Science University of Cyprus Cyprus Dept. of Computer Science Rutgers University Universidad Rey Juan Carlos United States

ISBN: (纸本)9781424464432

We consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of untrusted worker processors, and collects their responses;examples of such computations are the "@home" projects such as SETI. Prior work dealing with Internet-based task computations has either considered only rational, or only malicious and altruistic workers. Altruistic workers always return the correct result of the task, malicious workers always return an incorrect result, and rational workers act based on their self-interest. However, in a massive computation platform, such as the Internet, it is expected that all three type of workers coexist. therefore, in this work we study Internet-based master-worker computations in the presence of Malicious, Altruistic, and Rational workers. A stochastic distribution of the workers over the three types is assumed. Considering all the three types of workers renders a combination of game-theoretic and classical distributed computing approaches to the design of mechanisms for reliable Internet-based computing. Indeed, in this work, such an algorithmic mechanism that makes use of realistic incentives to obtain the correct task result with a parametrized probability is designed. Only when necessary, the incentives are used to force the rational players to a certain equilibrium (which forces the workers to be truthful) that overcomes the attempts of the malicious workers to deceive the master. Finally, the mechanism is analyzed in two realistic Internet-based master-worker applications. this work is an example of how game theory can be used as a tool to formalize and solve a practical distributed Computing problem such as Internet super computing. ©2010 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Reversible parallel discrete-event execution of large-scale epidemic outbreak models 10

Reversible parallel discrete-event execution of large-scale ...

引用

24th Annual Workshop on Principles of Advanced and distributed Simulation, PADS 2010

作者： Perumalla, Kalyan S. Seal, Sudip K. Oak Ridge National Laboratory Oak Ridge TN United States

ISBN: (纸本)9781424472918

the spatial scale, runtime speed and behavioral detail of epidemic outbreak simulations together require the use of large-scale parallel processing. In this paper, an optimistic parallel discrete event execution of a reaction-diffusion simulation model of epidemic outbreaks is presented, with an implementation over the μsik simulator. Rollback support is achieved with the development of a novel reversible model that combines reverse computation with a small amount of incremental state saving. parallel speedup and other runtime performance metrics of the simulation are tested on a small (8,192-core) Blue Gene / P system, while scalability is demonstrated on 65,536 cores of a large Cray XT5 system. Scenarios representing large population sizes (up to several hundred million individuals in the largest case) are exercised. © 2010 ieee.

关键词： Population statistics

来源：评论

学校读者我要写书评

暂无评论

Exploiting the forgiving nature of applications for scalable parallel execution

Exploiting the forgiving nature of applications for scalable...

引用

24th ieee International parallel and distributed processing symposium, IPDPS 2010

作者： Meng, Jiayuan Raghunathan, Anand Chakradhar, Srimat Byna, Surendra NEC Laboratories America Princeton NJ United States Department of Computer Science University of Virginia Charlottesville VA United States School of Electrical and Computer Engineering Purdue University West Lafayette IN United States

ISBN: (纸本)9781424464432

It is widely believed that most Recognition and Mining (RM) workloads can easily take advantage of parallel computing platforms because these workloads are data-parallel. Contrary to this popular belief, we present RM workloads for which conventional parallel implementations scale poorly on multi-core platforms. We identify off-chip memory transfers and overheads in the parallel runtime library as the primary bottlenecks that limit speedups to be well below the ideal linear speedup expected for data-parallel workloads. To achieve improved parallel scalability, we identify and exploit several interesting properties of RM workloads - sparsity of model updates, low spatial locality among model updates, presence of insignificant computations, and the inherently self-healing nature of these algorithms in the presence of errors. We leverage these domain-specific characteristics to improve parallel scalability in two major ways. First, we utilize data dependency relaxation to simultaneously execute multiple training iterations in parallel, thereby increasing the granularity of the parallel tasks and significantly lowering the run-time overheads of fine-grained threading. Second, we strategically drop selected computations that are insignificant to the accuracy of the final result, but account for a disproportionately large amount of off-chip (memory and coherence) traffic. through the application of the proposed techniques, we show that much higher speedups are possible on multi-core platforms for two important RM applications - document search using semantic indexing, and eye detection in images using generalized learning vector quantization. On an 8-core platform, we achieve application speedups of 5.5× and 7.3× compared to sequential implementations. Compared to conventional parallel implementations of these applications using Intel's TBB, the proposed techniques result in 4.3× and 4.9× improvements. Although the optimized parallel implementations are not numerically eq

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Cross layer neighbourhood load routing for wireless mesh networks

Cross layer neighbourhood load routing for wireless mesh net...

引用

2010 ieee International symposium on parallel and distributed processing, Workshops and Phd Forum, IPDPSW 2010

作者： Zhao, Liang Al-Dubai, Ahmed Y. Min, Geyong School of Computing Edinburgh Napier University Edinburgh EH10 5DT United Kingdom Department of Computing University of Bradford Bradford BD7 1DP United Kingdom

ISBN: (纸本)9781424465347

Wireless Mesh Network (WMN) has been considered as a key emerging technology to construct next generation wireless communication networks. It combines the advantages of both mobile ad-hoc network (MANET) and traditional fixed network, attracting significant industrial and academic attentions. In WMN, the load balancing becomes a hot topic in enhancing the QoS provision as a load balanced WMN exhibits low delay and high quality communications. Although there are a number of proposals on using load-aware routing metrics in WMN, the neighbourhood load has not been considered within the context of load balancing and QoS aware WMNs. In this paper, we propose a Neighbourhood Load Routing scheme to further improve the performance of the existing Routing protocol such as AODV in WMN. We have conducted extensive simulation experiments. Our results confirm the superiority of our proposed scheme over its well-known counterparts, especially in grid topologies. counterparts, especially in grid topologies. © 2010 ieee.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A self-optimizing computation partitioning algorithm for distributed many-task computing

A self-optimizing computation partitioning algorithm for dis...

引用

5th Annual ChinaGrid Conference, ChinaGrid 2010

作者： Yu, Huashan Li, Yingnan Wu, Xianguo Xiao, Jian Li, Xiaoming School of Computer Science and Electronic Engineering Peking University Beijing China

ISBN: (纸本)9780769541068

Many-task computing (MTC) is a practical paradigm for developing loosely coupled and complex scientific applications. In this paradigm, computation on a large dataset is decomposed into tasks that are expected to be executed in parallel with dynamically allocated computing resources. these tasks pass data via files, and each one is to execute an existing program on one dataset element. Task scheduling is a key issue to enable MTC on parallel platforms like large-scale clusters, Grids and Clouds. Current solutions mainly focus on maximizing the number of utilized parallel computing resources. this paper proposes a configurable MTC model that aims to minimize a MTC computation's turnaround time cost with as few resources as possible. the primary strategy is to coalesce tasks with application-specific expertise into task-sequences, and assign tasks on granularity of task-sequences. Based on this model, a self-optimizing task partitioning algorithm has been devised for scheduling tasks in MTC. It separates task assignment from resource allocation, and makes a tradeoff between maximizing utilized resources, balancing workload and reducing computation-scheduling overhead. the algorithm has been implemented in Harmonia, which is a software platform developed by Peking University for enabling MTC on large-scale distributed platforms. Both the configurable MTC model and the self-optimizing task partitioning algorithm were evaluated with the genome alternative splicing application, and experimental results have proved the model's practicability. © 2010 ieee.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Improvements of common open Grid standards to increase high throughput and High Performance Computing effectiveness on large-scale grid and e-science infrastructures

Improvements of common open Grid standards to increase high ...

引用

2010 ieee International symposium on parallel and distributed processing, Workshops and Phd Forum, IPDPSW 2010

作者： Riedel, M. Memon, M.S. Memon, A.S. Streit, A. Wolf, F. Lippert, th. Konstaninov, A. Marzolla, M. Konya, B. Smirnova, O. Zangrando, L. Watzl, J. Kranzlmüller, D. Jülich Supercomputing Centre Forschungszentrum Jülich Jülich Germany Vilnius University Vilnius Lithuania University of Bologna Bologna Italy Lund University Lund Sweden INFN Padova Italy Ludwig Maximillians University Munich Munich Germany

ISBN: (纸本)9781424465347

Grid and e-science infrastructure interoperability is an increasing demand for Grid applications but interoperability based on common open standards adopted by Grid middle-wares are only starting to emerge on Grid infrastructures and are not broadly provided today. In earlier work we have shown how open standards can be improved by lessons learned from cross-Grid applications that require access to both, High throughput Computing (HTC) resources as well as High Performance Computing (HPC) resources. this paper provides more insights in several concepts with a particular focus on effectively describing Grid job descriptions in order to satisfy the demands of e-scientists and their cross- Grid applications. Based on lessons learned over years gained with interoperability setups between production Grids such as EGEE, DEISA, and NorduGrid, we illustrate how common open Grid standards (i.e. JSDL and GLUE2) can take cross- Grid application experience into account. © 2010 ieee.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Using grid computing to accelerate optimization solution: A system of systems approach

Using grid computing to accelerate optimization solution: A ...

引用

2010 5th International Conference on System of Systems Engineering, SoSE 2010

作者： Pham, D.T. Marzi, H. Marzi, A. Marzi, E. Darwish, A. Haj Lee, J.Y. Manufacturing Engineering Centre Cardiff University Cardiff CF24 3AA United Kingdom Dept. of Information Systems St. Francis Xavier University NS B2G 2W5 Canada

ISBN: (纸本)9781424481972

this paper presents a system of systems approach to implement high-speed searching to solve complex optimization problems. In most optimization techniques, parallel computation is not effective due to the complexity in algorithm. Here, the search space is distributed within processing power of high performance computing resources. the methodology takes advantage of the Bees Algorithm and adapts it for best performance in a cluster grid computing environment. the effectiveness of the approach is verified by solving the problem of efficiency in a power plant by economizing fuel cost, efficiency of transmission losses and environmental hazardous emissions. © 2010 ieee.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

DMAL-BPIDE: A distributed multi-abstraction-level business process IDE

DMAL-BPIDE: A distributed multi-abstraction-level business p...

引用

5th International Conference on P2P, parallel, Grid, Cloud and Internet Computing, 3PGCIC 2010

作者： Xu, Xiaotian Sun, Hailong Wang, Xu School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769542379

How to raise the efficiency of collaboration of modelers and bring down the cost of reusing processes are key problems in modern process developing activities. In the role-oriented way to organize modelers and the single-instance-based way to organize processes, traditional practices failed to tackle the problems. this paper describes an abstraction-level-based solution which organizes modelers and processes in the context of the top-down modeling hierarchy, and introduces a distributed BPMN based business process IDE called DMAL-BPIDE, with which enterprises could regulate and optimize modeling activities, effectively organize modelers through task distributing mechanism, and facilitate the reuse of processes. © 2010 ieee.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

A fault-tolerant approach to storing objects in distributed systems

A fault-tolerant approach to storing objects in distributed ...

引用

5th International Conference on P2P, parallel, Grid, Cloud and Internet Computing, 3PGCIC 2010

作者： Dobre, Ciprian Pop, Florin Cristea, Valentin Computer Science Department Faculty of Automatic Control and Computes Science University POLITEHNICA of Bucharest Romania

ISBN: (纸本)9780769542379

Over the Internet today, computing and communications environments are more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. Peer-to-Peer network overlays provide a good substrate for creating large-scale data sharing, content distribution and application-level multicast applications. We present Disthash, a P2P overlay network designed to share large sets of replicated distributed objects in the context of large-scale highly dynamic infrastructures. the system uses original solutions to achieve optimal message routing in hop-count and throughput, provide an adequate consistency among replicas, as well as provide a fault-tolerant substrate. In this we present result proving that the system is able to scale to a large number of nodes, and it includes the fault tolerance and system orchestration mechanisms, added in order to assess the reliability and availability of the distributed system in an autonomic manner. © 2010 ieee.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 81 82 83 84 85 86 87 88 89 90 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：