Semigroup and prefix computations on improved generalized mesh-connected computers with multiple buses

Author(s):  
Yi Pan ◽  
S.Q. Zheng ◽  
Keqin Li ◽  
Hong Shen
Keyword(s):  
Author(s):  
KUO-LIANG CHUNG

Given a pattern of length m and a text of length n, commonly m≪n, this paper presents a randomized parallel algorithm for pattern matching in O(n1/10) (=O(n1/10+(n−m)1/10)) time on a newly proposed n3/5×n2/5 modular meshconnected computers with multiple buses. Furthermore, the time bound of our parallel algorithm can be reduced to O(n1/11) if fewer processors are used.


1999 ◽  
Vol 23 (6) ◽  
pp. 309-324 ◽  
Author(s):  
A.Y. Zomaya ◽  
H. Smith ◽  
S. Olariu
Keyword(s):  

2001 ◽  
Vol 12 (3) ◽  
pp. 293-305 ◽  
Author(s):  
Yi Pan ◽  
S.Q. Zheng ◽  
Keqin Li ◽  
Hong Shen
Keyword(s):  

2016 ◽  
Vol 17 (6) ◽  
pp. 649-661 ◽  
Author(s):  
Sunil S. Damodhar ◽  
S. Krishna

Abstract Undervoltage load shedding serves to maintain voltage stability when a majority of loads are fast acting. An undervoltage load shedding scheme should address two tasks: the detection of voltage instability following a large disturbance and the determination of the amount of load to be shed. Additionally, in case of short-term voltage instability, the scheme should be fast. This paper proposes a method to predict voltage instability arising due to a large disturbance. The amount of load to be shed to maintain voltage stability is then determined from the Thevenin equivalent of the network as seen from the local bus. The proposed method uses local measurements of bus voltage and power, and does not require knowledge of the network. The method is validated by simulation of three test systems subjected to a large disturbance. The proposed scheme is fairly accurate in estimating the minimum amount of load to be shed to maintain stability. The method is also successful in maintaining stability in cases where voltage collapse is detected at multiple buses.


Sign in / Sign up

Export Citation Format

Share Document