期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
无阻塞Clos-Type网上的多源点多播 被引量:2
1
作者 顾乃杰 李栋 +2 位作者 熊焰 潘伟 刘刚 《计算机研究与发展》 EI CSCD 北大核心 2002年第3期354-359,共6页
在并行和分布式环境中 ,提供无阻塞的多对多通信是至关重要的 .Clos- Type网络能很好地满足这些要求 ,因此得到广泛的应用 .但是目前对于这类网中的多源点多播 ,通常的办法是通过对输入端的请求逐个进行一到多播送的方式来实现 ,这样的... 在并行和分布式环境中 ,提供无阻塞的多对多通信是至关重要的 .Clos- Type网络能很好地满足这些要求 ,因此得到广泛的应用 .但是目前对于这类网中的多源点多播 ,通常的办法是通过对输入端的请求逐个进行一到多播送的方式来实现 ,这样的方式算法效率较低 ,在 N× N的网络中时间复杂度达到Θ (N3/2 ) ,其中 N为网络输入端的总数 .文章主要研究的是 Clos- Type网上进行多源点多播的充分条件 ,并且通过引入分组、竞争互斥等机制 ,在中间级开关数目数量级不变的情况下使路由算法的时间复杂度降低至 :Θ N log Nloglog N2 log N ,从而在 展开更多
关键词 多源点多播 路由策略 并行路由算法 无阻塞Clos-Jype网 并行计算机网络
下载PDF
An Algorithm to Construct Concurrent Reachability Graph of Petri Nets 被引量:3
2
作者 张金泉 倪丽娜 蒋昌俊 《Journal of Donghua University(English Edition)》 EI CAS 2004年第3期180-184,共5页
Reachability graph is a very important tool to analyze the dynamic properties of Petri nets, but the concurrent relation of transitions in Petri nets cannot be represented by reachability graph. Petri net is a concurr... Reachability graph is a very important tool to analyze the dynamic properties of Petri nets, but the concurrent relation of transitions in Petri nets cannot be represented by reachability graph. Petri net is a concurrent system, while reachability graph is a serial one. However, concurrency is a kind of property which is not only very significant but also difficult to be analyzed and controlled. This paper presents the concepts of concurrent reachable marking and concurrent reachable graph in order to represent and analyze the concurrent system. The algorithm constructing concurrent reachable marking set and concurrent reachability graph is also shown so that we can study the response problems among services in a network computing environment and analyze the throughput of the system. The Dining Philosophers Problem, which is a classic problem of describing the management of concurrent resources, is given as an example to illustrate the significance of concurrent reachability graph. 展开更多
关键词 Petri nets concurrent system Concurrent Reachable Marking concurrent reachable marking set Concurrent Reachability Graph
下载PDF
Deterministic and randomized scheduling problems under the lp norm on two identical machines 被引量:5
3
作者 林凌 谈之奕 何勇 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2005年第1期20-26,共7页
Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in... Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented. 展开更多
关键词 SEMI-ONLINE SCHEDULING RANDOMIZATION Competitive ratio
下载PDF
An Improved Model for Computing-Intensive Tasks on Heterogeneous Workstations
4
作者 邬延辉 陆鑫达 《Journal of Shanghai Jiaotong university(Science)》 EI 2004年第2期6-9,15,共5页
An improved algorithm, which solves cooperative concurrent computing tasks using the idle cycles of a number of high performance heterogeneous workstations interconnected through a high-speed network, was proposed. In... An improved algorithm, which solves cooperative concurrent computing tasks using the idle cycles of a number of high performance heterogeneous workstations interconnected through a high-speed network, was proposed. In order to get better parallel computation performance, this paper gave a model and an algorithm of task scheduling among heterogeneous workstations, in which the costs of loading data, computing, communication and collecting results are considered. Using this efficient algorithm, an optimal subset of heterogeneous workstations with the shortest parallel executing time of tasks can be selected. 展开更多
关键词 HETEROGENEOUS parallel computing cooperative concurrent computing scheduling
下载PDF
Research and Analysis of the Parallel Computer Network Reliability
5
作者 Xiaodan ZHANG 《International Journal of Technology Management》 2015年第3期113-114,共2页
With the continuous development of network communication technology and computer technology, parallel computer network applications becoming more widely, its reliability has attracted more attention on researcher. Thi... With the continuous development of network communication technology and computer technology, parallel computer network applications becoming more widely, its reliability has attracted more attention on researcher. This paper gives a introduction to a simple computer network, given the reliability of the design criteria for computer network analysis, and finally through the examples to illustrate the computer network hardware and software reliability. 展开更多
关键词 Computer network RELIABILITY Design criteria Example illustrations.
下载PDF
The Edge-pancyclicity of Generalized Hypercubes 被引量:1
6
作者 Lei Ma Hongmei Liu Changqing Liu 《Journal of Systems Science and Information》 2009年第1期49-55,共7页
Generalized hypercubes (denoted by Q(d1,d2,... ,dn)) is an important network topology for parallel processing computer systems. Some methods of forming big cycle from small cycles and links have been developed. Ba... Generalized hypercubes (denoted by Q(d1,d2,... ,dn)) is an important network topology for parallel processing computer systems. Some methods of forming big cycle from small cycles and links have been developed. Basing on which, we has proved that in generalized hypercubes, every edge can be contained on a cycle of every length from 3 to IV(G)I inclusive and all kinds of length cycles have been constructed. The edgepanciclieity and node-pancilicity of generalized hypercubes can be applied in the topology design of computer networks to improve the network performance. 展开更多
关键词 complete graph PANCYCLICITY generalized hypercube
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部