首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1790篇
  国内免费   77篇
  完全免费   770篇
工业技术   2637篇
  2020年   7篇
  2019年   9篇
  2018年   35篇
  2017年   50篇
  2016年   71篇
  2015年   79篇
  2014年   146篇
  2013年   136篇
  2012年   213篇
  2011年   216篇
  2010年   176篇
  2009年   198篇
  2008年   221篇
  2007年   230篇
  2006年   174篇
  2005年   169篇
  2004年   133篇
  2003年   124篇
  2002年   59篇
  2001年   46篇
  2000年   33篇
  1999年   28篇
  1998年   19篇
  1997年   16篇
  1996年   12篇
  1995年   14篇
  1994年   6篇
  1993年   3篇
  1992年   2篇
  1991年   3篇
  1990年   3篇
  1989年   1篇
  1988年   2篇
  1987年   2篇
  1957年   1篇
排序方式: 共有2637条查询结果,搜索用时 46 毫秒
1.
并行稀疏矩阵与向量乘的负载平衡和通信优化   总被引:1,自引:1,他引:0  
本文考虑了在工作站机群上实现大型稀疏矩阵和向量乘的负载平衡。提出了一个快速负载平衡和有效的消息传递技术相结合的方法,来缓解计算和节点间通信。该方法的性能在工作站机群上进行测试,可获得良好结果;并且,通过I/O延迟隐藏和整体负载平衡使I/O开销能有效地分摊。  相似文献   
2.
分布式入侵监测中负载平衡实现策略研究   总被引:1,自引:0,他引:1  
传统的分布式入侵检测系统存在着大量丢包等问题.通过对现有的入侵监测系统问题的分析,寻找出传统系统存在问题的原因并进行针对性地改进.通过对不同数据包特性的研究,通过实验的方式确定出影响入侵检测系统处理效率的主要因素,找出了一种标示负载量的方式,将负载平衡的思想引入其中并与分布式思想相结合提出了一种提高入侵监测系统性能的系统结构设计方案.  相似文献   
3.
一种多资源负载平衡算法--RLBA   总被引:1,自引:0,他引:1  
刘克剑  刘心松  吴艾 《计算机应用》2005,25(7):1512-1513,1516
讨论了一种适用于分布式系统的多种资源的负载平衡算法。调度时,首先将任务按照其所占用的系统资源比例进行分类,然后在线计算每个节点的综合资源负载,并按照节点与整个系统的平均综合资源负载的差值进行类型划分,最后在负载最小的节点类中按照均匀概率随机选择一个节点作为任务调度的对象。算法还考虑了调度时可能发生的倾泻现象,并给出了避免的方法。  相似文献   
4.
服务器集群系统研究   总被引:17,自引:1,他引:16  
探讨了服务器集群系统的作用、国内外研究发展现状、硬件架构、工作原理,并预测了集群系统的发展趋势。  相似文献   
5.
移动Ad Hoe网络(MANET)中的路由算法应尽量使网络负载均衡,不均衡不仅导致正在通信的路由由于过度拥塞而引起数据包延时过大、吞吐量下降,而且会使拥塞节点的能量提前耗尽,从而加剧网络拓扑结构的变化及节点之间的不公平性。本文对目前提出的一些负载均衡路由算法进行了简要比较和分析,在此基础上,指出了目前负载均衡路由算法中存在的一些问题,并提出了一个实现负载均衡路由算法的一般模型。基于该模型,文中提出了一种简单的负载均衡路由算法。仿真结果表明,负载均衡路由算法比未考虑负载均衡的路由算法具有更高的数据包投递率和更低的数据包传输延时。  相似文献   
6.
白雪飞  黄本雄 《电讯技术》2004,44(6):154-157
负载均衡算法是多任务实时集群系统的一个关键技术。在分析了常见的轮转式均衡调度算法和任务最少优先法的优缺点基础上,针对实时集群系统处理多类任务的特点,引入了加权负载率的概念来更准确地描述各分布式集群节点的负载状况。提出了通过任务QoS映射为负载权值的思想,并给出了一种改进的任务最少优先算法——加权负载率最小法,描述了以加权负载率表为核心的多任务均衡调度算法。最后,通过仿真验证了该算法明显优于前两种算法。  相似文献   
7.
Design and Implementation of an RDP Device Driver for Windows 2000   总被引:3,自引:0,他引:3  
A redundant data path(RDP) device driver for Windows 2000 is proposed and implemented to pro-vide automatic transparent failover and load balancing across multiple SCSI or fibre paths between the hosts and the storage subsystems. RDP driver is implemented as a filter driver on top of the traditional disk device driver, it is completely transparent to the upper file system and the lower level physical device. I/O requests bound for the disk device are routed first to the RDP driver, then RDP driver calls the disk driver to perform these I/O requests. RDP detects the path failure and reroutes all subsequent I/O traffic through survival paths. I/O requests are distributed to different physical paths to achieve the maximum throughput. The multi-layered device driver approach significantly reduces the implementation overhead and improves portability, and does not require any changes to the OS or the on-disk data layout. RDP driver keeps applications running un-der path fault conditions and improves disk I/O performance.  相似文献   
8.
By the load definition of cluster, the request is regarded as granularity to compute load and implement the load balancing in cache cluster. First, the processing power of cache-node is studied from four aspects: network bandwidth, memory capacity, disk access rate and CPU usage. Then, the weighted load of cache-node is customized. Based on this, a load-balancing algorithm that can be applied to the cache cluster is proposed. Finally, Polygraph is used as a benchmarking tool to test the cache cluster possessing the load-balancing algorithm and the cache cluster with cache array routing protocol respectively. The results show the load-balancing algorithm can improve the performance of the cache cluster.  相似文献   
9.
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (hencheforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of choice in both industry and academia. This highly efficient scheme is based on a collection of array-based double-ended queues (deques) with low cost synchronization among local and stealing processes. Unfortunately, the algorithm's synchronization protocol is strongly based on the use of fixed size arrays, which are prone to overflows, especially in the multiprogrammed environments for which they are designed. This is a significant drawback since, apart from memory inefficiency, it means that the size of the deque must be tailored to accommodate the effects of the hard-to-predict level of multiprogramming, and the implementation must include an expensive and application-specific overflow mechanism. This paper presents the first dynamic memory work-stealing algorithm. It is based on a novel way of building non-blocking dynamic-sized work stealing deques by detecting synchronization conflicts based on “pointer-crossing” rather than “gaps between indexes” as in the original ABP algorithm. As we show, the new algorithm dramatically increases robustness and memory efficiency, while causing applications no observable performance penalty. We therefore believe it can replace array-based ABP work stealing deques, eliminating the need for application-specific overflow mechanisms. This work was conducted while Yossi Lev was a student at Tel Aviv University, and is derived from his MS thesis [1].  相似文献   
10.
This paper studies the problem of balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or available capacity observed at the serving entities. We show that these techniques do not work well in the peer-to-peer context; either they do not address peer node heterogeneity, or they suffer from significant load oscillations which result in unutilized capacity. We propose a new decentralized algorithm, Max-Cap, based on the maximum inherent capacities of the replica nodes. We show that unlike previous algorithms, it is not tied to the timeliness or frequency of updates, and consequently requires significantly less update overhead. Yet, Max-Cap can handle the heterogeneity of a peer-to-peer environment without suffering from load oscillations. Mema Roussopoulos is an Assistant Professor of Computer Science on the Gordon McKay Endowment at Harvard University. Before joining Harvard, she was a Postdoctoral Fellow in the Computer Science Department at Stanford University. She received her PhD and Master’s degrees in Computer Science from Stanford, and her Bachelor’s degree in Computer Science from the University of Maryland at College Park. Her interests are in the areas of distributed systems, networking, and mobile and wireless computing. Mary Baker is a Senior Research Scientist at HP Labs. Her research interests include distributed systems, networks, mobile systems, security, and digital preservation. Before joining HP Labs she was on the faculty of the computer science department at Stanford University where she ran the MosquitoNet project. She received her PhD from the University of California at Berkeley.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号