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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,668 篇 会议
194 篇 期刊文献
25 册 图书

馆藏范围

4,887 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,499 篇 工学
- 2,385 篇 计算机科学与技术...
- 1,470 篇 软件工程
- 419 篇 信息与通信工程
- 385 篇 电气工程
- 193 篇 控制科学与工程
- 159 篇 电子科学与技术（可...
- 75 篇 网络空间安全
- 33 篇 材料科学与工程（可...
- 33 篇 生物医学工程（可授...
- 26 篇 机械工程
- 26 篇 安全科学与工程
- 21 篇 光学工程
- 21 篇 动力工程及工程热...
- 21 篇 生物工程
- 20 篇 建筑学
- 19 篇 土木工程
- 17 篇 力学（可授工学、理...
- 17 篇 环境科学与工程（可...
- 15 篇 交通运输工程
792 篇 理学
- 669 篇 数学
- 103 篇 统计学（可授理学、...
- 89 篇 系统科学
- 66 篇 物理学
- 29 篇 生物学
- 19 篇 化学
451 篇 管理学
- 322 篇 管理科学与工程(可...
- 229 篇 工商管理
- 153 篇 图书情报与档案管...
51 篇 经济学
- 51 篇 应用经济学
18 篇 法学
- 17 篇 社会学
15 篇 医学
9 篇 教育学
9 篇 农学
5 篇 文学
4 篇 军事学

主题

564 篇 distributed comp...
540 篇 computer science
490 篇 parallel process...
485 篇 concurrent compu...
410 篇 parallel process...
379 篇 application soft...
342 篇 distributed data...
335 篇 distributed comp...
310 篇 databases
288 篇 computer archite...
249 篇 database systems
222 篇 computational mo...
220 篇 delay
215 篇 hardware
211 篇 costs
188 篇 processor schedu...
172 篇 protocols
170 篇 computer network...
162 篇 large-scale syst...
152 篇 parallel program...

机构

20 篇 ibm thomas j. wa...
11 篇 department of co...
10 篇 department of co...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
7 篇 ieee
7 篇 department of co...
7 篇 department of ee...
7 篇 department of co...
7 篇 college of compu...
7 篇 hewlett packard ...
7 篇 northwestern uni...
6 篇 department of co...
6 篇 syracuse univ sy...
6 篇 department of co...
6 篇 department of co...
6 篇 lawrence berkele...
6 篇 college of compu...
6 篇 univ of californ...

作者

20 篇 a. choudhary
16 篇 a. boukerche
10 篇 s.k. das
10 篇 boukerche azzedi...
10 篇 choudhary a
10 篇 li keqin
9 篇 j. saltz
9 篇 sun xian-he
9 篇 choudhary alok
9 篇 k. schwan
9 篇 das sajal k.
8 篇 l.r. welch
8 篇 a. makinouchi
8 篇 chen haibo
8 篇 anon
8 篇 a.a. chien
7 篇 c. katsinis
7 篇 t. kurc
7 篇 d.k. panda
7 篇 keqin li

语言

4,874 篇 英文
11 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings International Symposium on Databases in Parallel and Distributed Systems"

共 4887 条记录，以下是51-60 订阅

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

详细简洁

排序：

Balancing the Communication Load of State Transfer in Replicated systems

Balancing the Communication Load of State Transfer in Replic...

引用

30th IEEE international symposium on Reliable distributed systems (SRDS)

作者： Raghavan, Narasimha Vitenberg, Roman Univ Oslo Dept Informat N-0316 Oslo Norway

ISBN: (纸本)9780769544502

State transfer mechanisms are an essential building block in the design of many distribution applications that replicate the state, such as partially replicated databases or view-synchronous group communication. When a reconfiguration occurs, a need arises to ship a subset of objects that constitute the application state to a subset of nodes in the system. The most commonly employed solution is to elect a leader that collects state objects and transmits them to the nodes that need to receive them. In this paper, we present the problem of communication-balanced state transfer wherein the goal is to distribute the load of communication due to state transfer evenly across the participating nodes. We propose an algorithm that achieves the optimal balance, analyze it, and describe how it can be used in a variety of applications. We evaluate the algorithm on a typical setup of partially replicated databases and show that it attains a significant improvement compared with existing approaches.

关键词： Context databases Matrix converters Optimization Protocols Resource management Unicast communication balanced state transfer communication load balancing distributed processing distributed systems distribution applications load balancing partially replica

来源：评论

学校读者我要写书评

暂无评论

Scheduling problems for a class of parallel distributed systems

Scheduling problems for a class of parallel distributed syst...

引用

IEEE international symposium on Circuits and systems (ISCAS)

作者： Tamura, H Tasaki, F Sengoku, M Shinoda, S Niigata Inst Technol Kashiwazaki 9451195 Japan

ISBN: (纸本)0780388348

parallel distributed systems in which multiple computers are connected through LAN and WAN are widely used at present. One of the important function of parallel distributed systems is broadcasting to deliver data over an entire system. Multicasting is an expanded function of broadcasting. Broadcast/multicast processing greatly affects the performance of parallel distributed systems, and it is desirable to develop a delivering procedure that completes the processing in a short time. There have been many approaches to the minimum broadcast time problem, aiming at the optimal delivering procedure. In this paper, we consider the minimum broadcast/multicast time problem for a parallel distributed system whose topology can be represented by a subclass of split graphs.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Applicability of the Imprecise Computation Approach for the QoS Enhancement in distributed RTDBMS 13

Applicability of the Imprecise Computation Approach for the ...

引用

13th IEEE international symposium on parallel and distributed Computing (ISPDC)

作者： Ben Salem, Malek Bouazizi, Emna Hamdi, Issam Bouaziz, Rafik Sfax Univ Higher Inst Comp Sci & Multimedia MIRACL Lab Sfax Tunisia

ISBN: (纸本)9781479959198

Large amounts of real-time data is used by geographically distributed real-time applications. Using DRTDBMS1 is more and more needed to better manage the large amount of real-time data. In order to take account of unpredictable workload, Quality of Service (QoS) based approaches are the most appropriate. In the case of distributed real-time applications, it is necessary to take into account the problems of load balancing for user transactions between different nodes. Feedback Scheduling based approaches can manage the unpredictable workload variations. Further, the imprecise computation technique has been defined as a technique to enhance the Quality of Service QoS) in centralized RTDBMS. In this paper, we propose to apply the imprecise computation approach in a distributed feedback control scheduling architecture to improve the QoS in DRTDBMS. Then, we focus on two ways of optimization in DRTDBMS, 1) the space optimization in which we propose to apply three replication data policies, and 2) the QoS optimization in which we propose an improvement of the imprecise computation to ensure a better quality of the service.

关键词： Computational modeling Computer architecture Data models distributed databases Processor scheduling Quality of service Real-time systems Quality of service distributed databases scheduling of multiprocessor data models Computer Architecture real-time systems Computational modeling real-time application program real-time data arithmetic

来源：评论

学校读者我要写书评

暂无评论

Dynamic Linear Solver Selection for Transient Simulations Using Machine Learning on distributed systems

Dynamic Linear Solver Selection for Transient Simulations Us...

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Eller, Paul R. Cheng, Jing-Ru C. Maier, Robert S. Engineer Res & Dev Ctr Informat Technol Lab Vicksburg MS USA

ISBN: (纸本)9780769546766

Many transient simulations spend a significant portion of the overall runtime solving a linear system. A wide variety of preconditioned linear solvers have been developed to quickly and accurately solve different types of linear systems, each having options to customize the preconditioned solver for a given linear system. Transient simulations may produce significantly different linear systems as the simulation progresses due to special events occurring that make the linear systems more difficult to solve or the model moving closer to a state of equilibrium where the linear systems are easier to solve. Machine learning algorithms provide the ability to dynamically select the preconditioned linear solver for each linear system produced by a simulation. We can generate databases by computing attributes for each linear system, physical attributes for the transient simulation, computational attributes, and running times for a set of preconditioned solvers on each linear system. Machine learning algorithms can then use these databases to generate classifiers capable of dynamically selecting a preconditioned solver for each linear system given a set of attributes. This allows us to quickly and accurately compute each transient simulation using different preconditioned solvers throughout the simulation. This also provides the potential to produce speedups in comparison with using a single preconditioned solver for an entire transient simulation.

关键词： machine learning linear solvers finite element ADH WEKA

来源：评论

学校读者我要写书评

暂无评论

JOYCE+ - MODEL AND LANGUAGE FOR MULTISITE distributed systems 90

引用

2ND international SYMP ON databases IN parallel AND distributed systems ( DPDS 90 )

作者： FRANKY, MC SINBAD Research Group Computer Science Department University of Los Andes Apartado Aéreo Bogotá Colombia

ISBN: (纸本)0818620528

The models and languages most widely used for distributed systems programming (such as ADA, CSP, and OCCAM) do not explicitly consider the process execution site, they assume a synchronous communication scheme of “rendezvous” style, and require that each process recognize the names of their interlocutors. JOYCE+ is a modification of the JOYCE language defined by Brinch Hansen [Brinch 87, Brinch 89]. In the JOYCE+ model each process is executed in a specific site, it is assumed that the communication between processes at the same site is much more faster than between processes at different sites, and it is also assumed that the communication between processes is not always reliable. For this multi-site environment an asynchronous communication scheme is considered, eliminating waiting states for a process that sends a message to another process. Furthermore, modelling communication between processes through “channel” objects, the spaces for process names become *** this paper the JOYCE+ model for multi-site distributed systems is presented and the operational semantic of the asynchronous communication between processes is illustrated with Petri Nets. The syntax of the JOYCE+ language is presented in terms of the Guarded Commands language [Dijkstra 75]. The expressive power of the JOYCE+ language in distributed synchronization problems with timeout handling is illustrated through examples. Finally, we discuss about software development environments (based on JOYCE+) for distributed systems over multi- and mono-process computer *** Terms - Languages for distributed systems, Tools and methodologies for distributed systems.

关键词： tools and methodologies for distributed systems languages for distributed systems

来源：评论

学校读者我要写书评

暂无评论

Implementation and performance of a parallel file system for high performance distributed applications

Implementation and performance of a parallel file system for...

引用

5th IEEE international symposium on High Performance distributed Computing

作者： Ligon, WB Ross, RB CLEMSON UNIV CLEMSONSC 29631

ISBN: (纸本)0818675829

Dedicated Cluster parallel Computers (DCPCs) are emerging as low-cost high performance environments for many important applications in science and engineering. A significant class of applications that perform well on a DCPC are coarse-grain applications that involve large amounts of file I/O. Current research in parallel file systems for distributed systems is providing a mechanism for adapting these applications to the DCPC environment. We present the parallel Virtual File System (PVFS), a system that provides disk striping across multiple nodes in a distributed parallel computer and file partitioning among tasks in a parallel program. PVFS is unique among similar systems in that it uses a streams-based approach that represents each file access with a single set of request parameters and decouples the number of network messages from details of the files striping and partitioning. PVFS also provides support for efficient collective file accesses and allows overlapping file partitions. We present results of early performance experiments that show PVFS achieves excellent speedups in accessing moderately sized file segments.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Efficiently processing query-intensive databases over a non-dedicated local network

Efficiently processing query-intensive databases over a non-...

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Furtado, Pedro DEI/CISUC Universidade de Coimbra Portugal

ISBN: (纸本)0769523129

Commercial database systems must typically rely on fast hardware platforms and interconnects to deal efficiently with data in parallel. However, cheap computing power can be applied for flexibility and scalability in managing large data volumes if the right choices are made concerning data placement and processing. Our work concentrates on the use of cheap computing power in possibly slow, non-dedicated local networks to achieve a computing power over demanding query-intensive databases that would be unachievable without expensive specialized hardware and massively parallel systems. The Node Partitioned Data Management System (NPDM) works on computing nodes on non-dedicated local networks. In this paper we concentrate on query transformations required for efficient processing over a specialized query-intensive schema. The decision support benchmark TPC-H is used as a study case for the transformations and for experimental analysis.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Mobile processing in open systems

Mobile processing in open systems

引用

5th IEEE international symposium on High Performance distributed Computing

作者： Sapaty, PS UNIV SURREY DEPT ELECT & ELECT ENGNGUILDFORD GU2 5XHSURREYENGLAND

ISBN: (纸本)0818675829

A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursive programs, or waves, self-navigate in networks of data or processes in multiple cooperative parts while controlling and modifying the environment they exist in and move through. The layered general organisation of the automaton as well as its distributed implementation in computer networks have been discussed. As the automaton dynamically creates, modifies, activates and processes any knowledge networks arbitrarily distributed in computer networks, it can easily model any other paradigms for parallel and distributed computing. Comparison of WAVE with some known programming models and languages, and ideas of their possible integration have also been given.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel association rule mining based on FI-growth algorithm

Parallel association rule mining based on FI-growth algorith...

引用

international Conference on parallel and distributed systems

作者： Manaskasemsak, Bundit Benjamas, Nunnapus Rungsawang, Arnon Surarerks, Athasit Uthayopas, Putchong Kasetsart Univ Dept Comp Engn MIKE Lab Bangkok 10900 Thailand Kasetsart Univ Dept Comp Engn HPCNC Lab Bangkok 10900 Thailand Chulalongkorn Univ Dept Comp Engn ELITE Lab Bangkok 10330 Thailand Minist Informat & Commun Technol Software Ind Promot Agcy Thai Natl Grid Ctr Bangkok Thailand

ISBN: (纸本)9781424418893

Association rule mining is one of the most important techniques in data mining. It extracts significant patterns from transaction databases and generates rules used in many decision support applications. Many organizations such as industrial, commercial, or even scientific sites may produce large amount of transactions and attributes. Mining effective rules from such large volumes of data requires much time and computing resources. In this paper, we propose a parallel FI-growth association rule mining algorithm for rapid extraction of frequent itemsets from large dense databases. We also show that this algorithm can efficiently be parallelized in a cluster computing environment. The preliminary experiments provide quite promising results, with nearly ideal scaling on small clusters and about half of ideal (15 fold speedup) on a thirty-two processor cluster.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

A strategy for semantic integrity checking in distributed databases 9

A strategy for semantic integrity checking in distributed da...

引用

9th international Conference on parallel and distributed systems (ICPADS 2002)

作者： Ibrahim, H Univ Pertanian Malaysia Dept Comp Sci Fac Comp Sci & Informat Technol Serdang 43400 Malaysia

ISBN: (纸本)0769517609

Integrity constraints represent knowledge about data with which a database must be consistent. The process of checking constraints to ensure that the update operations or transactions which alter the database will preserve its consistency has proved to be extremely difficult to implement efficiently, particularly in a distributed environment. In the literature, most of the approaches/methods proposed for finding/deriving a good set of integrity constraints concentrate on deriving simplified forms of the constraints by analyzing both the syntax of the constraints and their appropriate update operations. These methods are based on syntactic criteria and are limited to simple types of integrity constraints. Also, these methods are only able to produce one integrity test for each integrity constraint. In [1], we introduced an integrity constraint subsystem for a relational distributed database. The subsystem consists of several techniques necessary for efficient constraint checking, particularly in a distributed environment where data distribution is transparent to application domain. However, the technique proposed for generating integrity tests is limited to several types of integrity constraints, namely: domain, key, referential and simple general semantic constraint and only produced two integrity tests (global and local) for a given integrity constraint. In this paper, we present a technique for deriving several integrity tests for a given integrity constraint where the following types of integrity constraints are considered: static and transition constraints.

关键词： Algorithm design and analysis Computer science Costs distributed computing distributed databases Information technology Relational databases Robustness Testing Transaction databases

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：