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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

768 篇 会议
27 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

384 篇 工学
- 362 篇 计算机科学与技术...
- 194 篇 软件工程
- 58 篇 信息与通信工程
- 51 篇 电气工程
- 27 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 材料科学与工程（可...
- 7 篇 安全科学与工程
- 7 篇 网络空间安全
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 交通运输工程
101 篇 理学
- 95 篇 数学
- 18 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
72 篇 管理学
- 51 篇 管理科学与工程(可...
- 38 篇 工商管理
- 24 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
7 篇 医学
- 7 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 法学
- 3 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

121 篇 computer science
94 篇 concurrent compu...
94 篇 distributed comp...
83 篇 distributed data...
79 篇 parallel process...
78 篇 application soft...
76 篇 databases
74 篇 database systems
73 篇 parallel process...
55 篇 delay
53 篇 distributed comp...
52 篇 processor schedu...
45 篇 computer archite...
43 篇 transaction data...
41 篇 algorithm design...
40 篇 costs
39 篇 relational datab...
35 篇 protocols
34 篇 computational mo...
33 篇 hardware

机构

6 篇 ibm thomas j. wa...
5 篇 ieee
4 篇 school of comput...
4 篇 department of co...
4 篇 department of co...
3 篇 center for paral...
3 篇 department of co...
3 篇 lip ens-lyon lyo...
3 篇 department of co...
2 篇 department of co...
2 篇 institute of inf...
2 篇 department of co...
2 篇 institute of inf...
2 篇 computer systems...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of el...
2 篇 department of co...
2 篇 school of comput...

作者

7 篇 a. choudhary
6 篇 a. boukerche
5 篇 j. saltz
4 篇 s.k. das
4 篇 t. kurc
4 篇 a. el abbadi
3 篇 a. rau-chaplin
3 篇 o. wolfson
3 篇 f. dehne
3 篇 p.s. yu
3 篇 a. singh
3 篇 casanova henri
3 篇 c. liu
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 d. agrawal
3 篇 x. shen
2 篇 grove matthew
2 篇 a. burger

语言

792 篇 英文
4 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

共 796 条记录，以下是151-160 订阅

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

详细简洁

排序：

Divisible Load Scheduling with Result Collection on Heterogeneous systems

Divisible Load Scheduling with Result Collection on Heteroge...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Abhay Ghatpande Hidenori Nakazato Hiroshi Watanabe Olivier Beaumont School of Global Information and Telecommunication Studies Waseda University Tokyo Japan INRIA-Futurs-LaBRI Bordeaux France

Divisible load theory (DLT) is an established mathematical framework to study divisible load scheduling (DLS). However, traditional DLT does not comprehensively deal with the scheduling of results back to source (i.e., result collection) on heterogeneous systems. In this paper, the DLSRCHETS (DLS with result collection on hetero- geneous systems) problem is addressed. The few papers to date that have dealt with DLSRCHETS, proposed simplistic LIFO (last in, first out) and FIFO (first in, first out) type of schedules as solutions to DLSRCHETS. In this paper, a new heuristic algorithm, ITERLP, is proposed as a solution to the DLSRCHETS problem. With the help of simulations, it is proved that the performance of ITERLP is significantly better than existing algorithms.

关键词： Optimal scheduling Processor scheduling Computational modeling Heuristic algorithms databases Scheduling algorithm Bandwidth Computer networks Partitioning algorithms Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm for P systems implementation in multiprocessors

Parallel algorithm for P systems implementation in multiproc...

引用

作者： Gil, F. Javier Fernández, Luis Arroyo, Fernando De Frutos, J. Alberto Natural Computing Group Universidad Politécnica de Madrid Spain

ISBN: (纸本)9784990288020

The Transition P systems perform a computation through transition or evolution step between two consecutive configurations. Each evolution step is made up of two phases: on the first phase the evolution rules are applied, and a second phase of communication between membranes. At the time of designing architectures hardware and/or software for the implementation of Transition P systems, has been detected the necessity of having algorithms that can know beforehand the required time to apply a set of active evolution rules on a multiset inside a membrane. This is very important as it allows to determinate the balanced number of membranes to be located in each processor in the implementation of distributed architectures of P systems in order to achieve optimal evolution step time with minimal resources. In this work we introduce a parallel algorithm for application of active rules in a membrane oriented towards the implementation of Transition P systems in multiprocessors hardware architectures. Given a set of active rules R, the algorithm is based on power set of R (the set formed by all the subsets of R) and on the rules elimination algorithm (applying them to its maximum applicability benchmark). This new algorithm complies the requisites of being nondeterministic, parallel, and what is very important, the algorithm is time delimited because it is only dependant on the number of evolution rules placed in a membrane. ©ISAROB 2008.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel ODETLAP for terrain compression and reconstruction 08

Parallel ODETLAP for terrain compression and reconstruction

引用

16th ACM SIGSPATIAL international Conference on Advances in Geographic Information systems, ACM GIS 2008

作者： Stookey, Jared Xie, Zhongyi Cutler, Barbara Franklin, W. Randolph Tracy, Dan Andrade, Marcus V. A. ECSE Dept. RPI United States CS Dept. RPI United States DPI Univ. Fed. Vicosa Brazil RPI United States

ISBN: (纸本)9781605583235

We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data used for Geographical Information systems (GIS). ODETLAP can be used to reconstruct a compressed elevation map, or to generate a dense regular grid from airborne Light Detection and Ranging (LIDAR) point cloud data. With previous methods, the time to execute ODETLAP does not scale well with the size of the input elevation map, resulting in running times that are prohibitively long for large data sets. Our algorithm divides the data set into patches, runs ODETLAP on each patch, and then merges the patches together. This method gives two distinct speed improvements. first, we provide scalability by reducing the complexity such that the execution time grows almost linearly with the size of the input, even when run on a single processor. Second, we are able to calculate ODETLAP on the patches concurrently in a parallel or distributed environment. Our new patch-based implementation takes 2 seconds to run ODETLAP on an 800 x 800 elevation map using 128 processors, while the original version of ODETLAP takes nearly 10 minutes on a single processor (271 times longer). We demonstrate the effectiveness of the new algorithm by running it on data sets as large as 16000 x 16000 on a cluster of computers. We also discuss our preliminary results from running on an IBM Blue Gene/L system with 32,768 processors. © 2008 ACM.

关键词： Optical radar

来源：评论

学校读者我要写书评

暂无评论

Large scale execution of a bioinformatic application on a volunteer grid

Large scale execution of a bioinformatic application on a vo...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Viktors Bertis Raphael Bolze Frederic Desprez Kevin Reed IBM Systems and Technology Group Austin USA Université de Lyon France CNRS Lyon France LIP laboratory UMR 5668 ENS Lyon-CNRS-INRIA-UCBL Lyon France INRIA France IBM Centers for Solution Innovation Chicago USA

Large volunteer desktop platforms are now available for several applications. This paper presents the work that we did to prepare the first phase of the Help Cure Muscular Dystrophy project to run on World Community Grid. The project was launched on December 19, 2006, and took 26 weeks to complete. We present performance evaluation of the overall execution and compare a volunteer grid with a dedicated one.

关键词： Large-scale systems Bioinformatics Grid computing Protein engineering Costs Prediction algorithms databases Laboratories Technological innovation Computer applications

来源：评论

学校读者我要写书评

暂无评论

Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model

Scheduling divisibleworkloads on heterogeneous platforms und...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Olivier Beaumont Nicolas Bonichon Lionel Eyraud-Dubois INRIA Bordeaux Université de Bordeaux 1 France

In this paper, we discuss complexity issues for scheduling divisible workloads on heterogeneous systems under the bounded multi-port model. To our best knowledge, this paper is the first attempt to consider divisible load scheduling under a realistic communication model, where the master node can communicate simultaneously to several slaves, provided that bandwidth constraints are not exceeded. In this paper, we concentrate on one round distribution schemes, where a given node starts its processing only once all data has been received. Our main contributions are (i) the proof that processors start working immediately after receiving their work (ii) the study of the optimal schedule in the case of 2 processors and (iii) the proof that scheduling divisible load under the bounded multi-port model is NP-complete. This last result strongly differs from divisible load literature and represents the first NP-completeness result when latencies are not taken into account.

关键词： Bandwidth Optimal scheduling Processor scheduling Master-slave Load modeling Delay Scheduling algorithm Multimedia databases Kalman filters Filtering

来源：评论

学校读者我要写书评

暂无评论

Towards data partitioning for parallel computing on three interconnected clusters

Towards data partitioning for parallel computing on three in...

引用

6th international symposium on parallel and distributed Computing

作者： Becker, Brett A. Lastovetsky, Alexey Univ Coll Dublin Sch Comp Sci & Informat Dublin 4 Ireland

ISBN: (纸本)9780769529172

We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. first it can reduce communication time due to a lower total volume of communication and a more efficient communication schedule. When the network topology is a linear array this partitioning always results in a lower total volume of communication compared to existing partitionings, provided the most powerful node is at the center of the array. When the topology is fully connected this partitioning results in a lower total volume of communication for all but a few power ratios. Second, it allows for the overlapping of communication and computation. These two inherent advantages work together to reduce overall execution time significantly.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A comparison of scheduling approaches for mixed-parallel applications on heterogeneous platforms

A comparison of scheduling approaches for mixed-parallel app...

引用

6th international symposium on parallel and distributed Computing

作者： N'Takpe, Tchimou Suter, Frederic Casanova, Henri Univ Nancy 1 LORIA CNRS INPLINRIAUMR 7503UHP F-54013 Nancy France Univ Hawaii Manoa Dept Informat & Comp Sci Honolulu HI 96822 USA

ISBN: (纸本)9780769529172

Mixed-parallel applications can take advantage of large-scale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the two main proposed approaches for solving this scheduling problem on a heterogeneous set of homogeneous clusters. We first modify previously proposed algorithms for both approaches and show that our modifications lead to significant improvements. We then perform a comparison of the modified algorithms in simulation over a wide range of application and platform conditions. We find that although both approaches have advantages, one of them is most likely the most appropriate for the majority of users.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

FixD: Fault detection, bug reporting, and recoverability for distributed applications

FixD: Fault detection, bug reporting, and recoverability for...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： ŢǍpuş, Cristian Noblet, David A. California Institute of Technology

ISBN: (纸本)1424409101

Model checking, logging, debugging, and checkpointing/recovery are great tools to identify bugs in small sequential programs. The direct application of these techniques to the domain of distributed applications, however, has been less effective (mostly owing to the high degree of concurrency in this context). This paper presents the. design of a hybrid tool, FixD, that attempts to address the deficiencies of these tools with respect to their application to distributed systems by using a novel composition of several of these existing techniques. The authors first identify and describe the four abstract components that comprise the FixD tool, then conclude, with a proposal for how existing tools can be used to implement, these components. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive distributed database replication through colonies of pogo ants

Adaptive distributed database replication through colonies o...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Abdul-Wahid, Sarah Andonie, RǍzvan Lemley, Joseph Schwing, James Widger, Jonathan Central Washington University Computer Science Department Ellensburg WA 98926 United States

ISBN: (纸本)1424409101

We address the problem of optimizing the distribution of partially replicated databases over a computer network. Replication is used to increase data availability in the presence of site or communication failures and to decrease retrieval, costs by local access if possible. We present a new bio-inspired replication management approach which is adaptive, completely decentralized, and based on swarm intelligence. Each node has the autonomy to start at any time, depending on the internal state of its stored data objects, a redistribution process. "Redistribution" means replicate, create, delete, update, or move data objects to other nodes of the network. The redistribution process is a dynamic load-balancing scheme which runs with lower priority in the background. The system is event-driven, but the learning process is not synchronized with the events. © 2007 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Domain decomposition vs. master-slave in apparently homogeneous systems

Domain decomposition vs. master-slave in apparently homogene...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Banino-Rokkones, Cyril Sem Sælandsvei 7-9 NO-7491 Trondheim Norway

ISBN: (纸本)1424409101

This paper investigates the utilization of the master-slave (MS) paradigm as an alternative to domain decomposition (DD) methods for parallelizing lattice gauge theory (LGT) models within distributed memory environments. The motivations for this investigation are twofold. first, LGT models are inherently difficult to parallelize efficiently with DD methods. Second, DD methods have proven useful for homogeneous environments, but are impractical for heterogeneous and dynamic environments. Besides, many modern supercomputer architectures that look homogeneous (such as multi-core or SMP), are in fact heterogeneous and dynamic environments. We highlight this issue by comparing a traditional first-come first-served MS implementation to a simple but yet efficient selective MS scheduling strategy that automatically accounts for system, heterogeneity and variability. Our experimental results with the parallelization of our LGT model, reveal that the selective MS implementation achieves good efficiency, but lacks of scalability. In contrast, the DD method is highly scalable, but at the expense of a poor efficiency. These results open up for a hybrid approach, where the MS and the DD methods would, be combined for achieving scalable high performance. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：