[특허]Controlled take over of services by remaining nodes of clustered computing system

IPC분류정보
국가/구분	United States(US) Patent 등록
국제특허분류(IPC7판)	G06F-011/00
출원번호	US-0479485 (2000-01-10)
발명자 / 주소	Kumar, Krishna Murphy, Declan J. Hisgen, Andrew L.
출원인 / 주소	Sun Microsystems, Inc.
대리인 / 주소	Beyer Weaver & Thomas, LLP
인용정보	피인용 횟수 : 16 인용 특허 : 39

초록 ▼

Improved techniques for controlled take over of services for clustered computing systems are disclosed. The improved techniques can be implemented to allow one sub-cluster of the clustered computing system to safely take over services of one or more other sub-clusters in the clustered computing syst

Improved techniques for controlled take over of services for clustered computing systems are disclosed. The improved techniques can be implemented to allow one sub-cluster of the clustered computing system to safely take over services of one or more other sub-clusters in the clustered computing system. Accordingly, if the clustered computing system is fragmented into two or more disjointed sub-clusters, one sub-cluster can safely take over services of the one or more other sub-clusters after the one or more other sub-clusters have been shutdown. As a result, the clustered computing system can continue to safely provide services even when the clustered computing system has been fragmented into two or more disjointed sub-clusters due to an operational failure.

대표청구항 ▼

1. A method for taking over services by one or more remaining sub-clusters of a clustered computing system from one or more other sub-clusters of the clustered computing system after the one or more other sub-clusters have been shutdown, said method comprising:(a) attempting to determine whether a s

1. A method for taking over services by one or more remaining sub-clusters of a clustered computing system from one or more other sub-clusters of the clustered computing system after the one or more other sub-clusters have been shutdown, said method comprising:(a) attempting to determine whether a sub-cluster of the clustered computing system is to remain active such that the processes of the sub-cluster may temporarily continue;(b) initiating shutdown of the sub-cluster when said attempting (a) does not determine within a first predetermined amount of time that the sub-cluster is to remain active;(c) to allow the processors of the sub-cluster to temporarily continue, delaying for a second predetermined amount of time after the first predetermined amount of time expires when said attempting (a) determines within the first predetermined amount of time that the sub-cluster is to remain active such that data corruption is avoided; and(d) taking over services of one or more other sub-clusters of the clustered computing system by one or more remaining sub-clusters after said delaying (c) for the second predetermined amount of time. 2. A method as recited in claim 1, wherein said method is performed by each of the sub-clusters of the clustered computing system. 3. A method as recited in claim 1, said method further comprising:initiating shutdown of the sub-cluster when said attempting (a) determines within the first predetermined amount of time that the sub-cluster is not to remain active. 4. A method as recited in claim 1, wherein the first predetermined amount of time represents an upper estimate of time required to determine whether a sub-cluster is to remain active. 5. A method as recited in claim 1, wherein the second predetermined amount of time represents an upper estimate for a delay typically encountered in initiating said attempting (a) after an error condition has actually occurred. 6. A method for taking over services by one or more remaining sub-clusters of a clustered computing system from one or more other sub-clusters of the clustered computing system after the one or more other sub-clusters have been shutdown, said method comprising:(a) determining whether one or more computing nodes in a cluster have become one or more non-responsive nodes;(b) starting a first timer when said determining (a) determines that one or more of the computing nodes in the cluster have become one or more non-responsive nodes, the first timer having a first duration;(c) attempting to determine whether a sub-cluster vote is at least a majority of a total votes available, the sub-cluster vote representing votes for a sub-cluster of one or more computing nodes, the sub-cluster representing a portion of the cluster that remains responsive;(d) initiating shutdown of the one or more non-responsive computing nodes of the sub-cluster when said attempting (c) does not determine within the first duration of the first timer that the sub-cluster vote is at least a majority of the total votes available;(e) to allow the processors of the sub-cluster to temporarily continue, starting a second timer after the first timer expires when the said attempting (c) has determined within the first duration of the first timer that the sub-cluster vote is at least a majority of the total votes available, the second timer having a second duration such that data corruption is avoided; and(f) taking over services from the one or more non-responsive nodes by at least one of the remaining computing nodes of the sub-cluster after the second timer expires. 7. A method as recited in claim 6, wherein said method is performed by each of the sub-clusters of the clustered computing system. 8. A method as recited in claim 6, wherein the (a) determining further comprises:(a1) detecting that a computing node in the cluster that has become non-responsive with respect to a first node;(a2) determining whether all responsive nodes to the first node agree that the computing node detect ed in detecting (a1) has become non-responsive. 9. A method as recited in claim 6, wherein the method further comprises:determining whether there is at least one service of the one or more non-responsive nodes that needs to be taken over. 10. A computer readable medium including computer program code for taking over services by one or more remaining sub-clusters of a clustered computing system from one or more other sub-clusters of the clustered computing system after the one or more other sub-clusters have been shutdown, said computer readable medium comprising:computer program code for attempting to determine whether a sub-cluster of the clustered computing system is to remain active such that the processes of the sub-cluster may temporarily continue;computer program code for initiating shutdown of the sub-cluster when said computer program code for attempting does not determine within a first predetermined amount of time that the sub-cluster is to remain active;computer program code for delaying for a second predetermined amount of time after the first predetermined amount of time expires when said computer program code for attempting determines within the first predetermined amount of time that the sub-cluster is to remain active such that the processes of the sub-cluster may temporarily continue; andcomputer program code to allow the processors of the sub-cluster to temporarily continue for taking over services of one or more other sub-clusters of the clustered computing system by one or more remaining sub-clusters after said computer program code for delaying has delayed for the second predetermined amount of time such that data corruption is avoided. 11. A computer readable medium as recited in claim 10, wherein the computer readable medium is provided for each of the sub-clusters of the clustered computing system. 12. A method as recited in claim 10, said method further comprising:computer program code for initiating shutdown of the sub-cluster when said computer program code for attempting determines within the first predetermined amount of time that the sub-cluster is not to remain active. 13. A computer readable medium for taking over services by one or more remaining sub-clusters of a clustered computing system from one or more other sub-clusters of the clustered computing system after the one or more other sub-clusters have been shutdown, said computer readable medium comprising:computer program code for determining whether one or more computing nodes in a cluster have become one or more non-responsive nodes;computer program code for starting a first timer when said computer program code for determining determines that one or more of the computing nodes in the cluster have become one or more non-responsive nodes, the first timer having a first duration;computer program code for attempting to determine whether a sub-cluster vote is at least a majority of a total votes available, the sub-cluster vote representing votes for a sub-cluster of one or more computing nodes, the sub-cluster representing a portion of the cluster that remains responsive;computer program code for initiating shutdown of the one or more non-responsive computing nodes of the sub-cluster when said computer program code for attempting does not determine within the first duration of the first timer that the sub-cluster vote is at least a majority of the total votes available;computer program code for starting a second timer to allow the processors of the sub-cluster to temporarily continue after the first timer expires when the said computer program code for attempting has determined within the first duration of the first timer that the sub-cluster vote is at least a majority of the total votes available, the second timer having a second duration such that data corruption is avoided; andcomputer program code for taking over services from the one or more non-responsive nodes by at least one of the remaining computing nodes of the sub-cluster after t he second timer expires. 14. A computer readable medium as recited in claim 13, wherein the computer readable medium is provided for each of the sub-clusters of the clustered computing system. 15. A clustered computing system, comprising:a cluster of computing nodes having at least two computing nodes; andan integrity protector, comprising:a cluster error detector operable to detect a formation of disjoint sub-clusters;a cluster shutdown controller operable to:attempt to determine whether a sub-cluster of the clustered computing system is to remain active such that the processes of the sub-cluster may temporarily continue;initiate shutdown of the sub-cluster when the attempt does not determine within a first predetermined amount of time that the sub-cluster is to remain active; andto allow the processors of the sub-cluster to temporarily continue, delay for a second predetermined amount of time after the first predetermined amount of time expires when said attempt determines within the first predetermined amount of time that the sub-cluster is to remain active such that data corruption is avoided; anda takeover controller operable to:take over services of one or more other sub-clusters of the clustered computing system by one or more remaining sub-clusters after the delay for the second predetermined amount of time. 16. The clustered computing system of claim 15, wherein the cluster shutdown controller is operable to:initiate shutdown of the sub-cluster when the attempt determines within the first predetermined amount of time that the sub-cluster is not to remain active. 17. The clustered computing system of claim 15, wherein the first predetermined amount of time represents an upper estimate of time required to determine whether a sub-cluster is to remain active. 18. The clustered computing system of claim 15, wherein the second predetermined amount of time represents an upper estimate for a delay typically encountered in initiating the attempt after an error condition has actually occurred.

LOADING...

이 특허에 인용된 특허 (39) 인용/피인용 타임라인 분석

Murthy V. Devarakonda ; Daniel Manuel Dias ; German Sergio Goldszmidt ; Guerney Douglass Holloway Hunt ; Arun Kwangil Iyengar ; Richard Pervin King ; Rajat Mukherjee, Affinity-based router and routing method.
상세보기
Nguyen Truong Q. (San Jose CA) Choi Isaac P. (San Jose CA), Apparatus and method of token ring beacon station removal for a communication network.
상세보기
Goldszmidt German Sergio ; Willebeek-LeMair Marc Hubert ; Hon Kenneth Sau-yee,HKX, Client-based dynamic switching of streaming servers for fault-tolerance and load balancing.
상세보기
Frank, Richard L.; Cusson, Michael J.; Kundu, Joydip; O'Shaughnessy, Daniel E., Closed-loop node membership monitor for network clusters.
상세보기
Timothy Roy Block ; Rodney Lee Rabe, Cluster node distress signal.
상세보기
Badovinatz Peter Richard ; Chandra Tushar Deepak ; Gopal Ajei Sarat ; Kirby Orvalle Theodore ; Pershing ; Jr. John Arthur, Communications method involving groups of processors of a distributed computing environment.
상세보기
Snaman ; Jr. William ; Cardoza Wayne, Computer network cluster generation indicator.
상세보기
Moiin Hossein ; Pruscino Angelo, Data integrity and availability in a distributed computer system.
상세보기
Arendt James W. ; Chao Ching-Yun ; Kistler Michael David ; Lawlor Frank Daniel ; Mancisidor Rodolfo Augusto ; Ramanathan Jayashree ; Strong Hovey Raymond, Enqueuing a configuration change in a network cluster and restore a prior configuration in a back up storage in reverse sequence ordered.
상세보기
Ludlam Henry S. (Longmont CO) Milligan Charles A. (Golden CO) Rudeseal George A. (Boulder CO) Swiatek Paul R. (Lafayette CO), Fault tolerant disk array data storage subsystem.
상세보기
Quarles Philip ; Quarles Stephanie, High availability on-line transaction processing system.
상세보기
Slaughter Gregory L. ; Traversat Bernard A. ; Herndon Robert ; Zheng Xiaoyan, Highly available cluster virtual disk system.
상세보기
James W. Arendt ; Ching-Yun Chao ; Rodolfo Ausgusto Mancisidor, Highly scalable and highly available cluster system management scheme.
상세보기
Pi-Yu Chung ; Om P. Damani ; Yennun Huang ; Chandra M. Kintala ; Yi-Min Wang, Hosting a network service on a cluster of servers using a single-address image.
상세보기
Kevin Michael Jordan ; Kun-Lung Wu ; Philip Shi-Lung Yu, Load balancing cooperating cache servers by shifting forwarded request.
상세보기
David Wong ; Cheng-chung Shih ; Jun Cao ; William Dai, Load balancing in link aggregation and trunking.
상세보기
Joffe Rodney Lance ; Dykes Barry A. ; Brittain Jason Alan ; Oppleman Victor Joseph ; Pettingell Brian Everett ; Lippard James Joseph ; Vandeventer Ian Burke ; Watson Brett Dean ; Hotz Steven Michael , Method and apparatus for balancing the process load on network servers according to network and serve based policies.
상세보기
Ching-Yun Chao ; Patrick M. Goal ; Richard James McCarty, Method and apparatus for building and managing multi-clustered computer systems.
상세보기
John M. Chiang, Method and apparatus for finding a match entry using receive port number embedded in the port vector.
상세보기
Basavaiah Murali ; Krishnakumar Karoor S., Method and apparatus for node pruning a multi-processor system for maximal, full connection during recovery.
상세보기
Kenneth Bruce MacKenzie ; Richard James McCarty ; Amal Ahmed Shaheen, Method and apparatus for partition resolution in clustered computer systems.
상세보기
Sung Yi-Hsin ; Dayal Vibha ; Ramakrishnan Satish, Method and apparatus for reestablishing network connections in a multi-router network.
상세보기
Jardine Robert L ; Basavaiah Murali ; Krishnakumar Karoor S, Method and apparatus for split-brain avoidance in a multi-processor system.
상세보기
Mogul Jeffrey C., Method and apparatus of improving network performance and network availability in a client-server network by transparently replicating a network service.
상세보기
Gorczyca Robert ; Rashid Aamir Arshad ; Rodgers Kevin Forress ; Warnsman Stuart ; Weaver Thomas Van, Method and system for dynamically reconfiguring a cluster of computer systems.
상세보기
Cunningham Mark,GBX ; Trevarrow Andrew,GBX, Method and system for monitoring and controlling network access.
상세보기
Cheung Yu-Cheung ; Carley William J., Method for sequential and consistent startup and/or reload of multiple processor nodes in a multiple node cluster.
상세보기
Jardine Robert L. (Cupertino CA) Collins Richard M. (Campbell CA) Zacher A. Richard (Los Gatos CA), Method to improve tolerance of non-homogeneous power outages.
상세보기
Beardsley Brent Cameron ; Iskiyan James Lincoln ; Micka William Frank ; Yudenfriend Harry Morris, Peer-to-peer backup system with failure-triggered device switching honoring reservation of primary device.
상세보기
Holmberg Per Anders,SEX, Protocol for providing replicated servers in a client-server system.
상세보기
Saito Hiroyuki,JPX ; Yoshida Makiko,JPX, Self-healing network initiating fault restoration activities from nodes at successively delayed instants.
상세보기
Rod Gamache ; Michael T. Massa ; Patrick J. Helland, Separately storing core boot data and cluster configuration data in a server cluster.
상세보기
Kametani Masatsugu (Tsuchiura JPX), Synchronous method and apparatus for processors.
상세보기
Rabinovich Michael, System and method for allocating requests for objects and managing replicas of objects on a network.
상세보기
Moiin Hossein, System and method for modifying membership in a clustered distributed computer system and updating system configuration.
상세보기
Attanasio Clement Richard ; Goldszmidt German Sergio ; Hunt Guerney Douglas Holloway ; Smith Stephen Edwin, System and method for providing dynamically alterable computer clusters for message routing.
상세보기
Carter John B. ; Davis Scott H. ; Dietterich Daniel J. ; Frank Steven J. ; Phillips Robert S. ; Woods John ; Porter David ; Lee Hsin H., System and method for providing highly available data storage using globally addressable memory.
상세보기
Long William A., System for transparently identifying and matching an input/output profile to optimal input/output device parameters.
상세보기
Brendel Juergen ; Kring Charles J. ; Liu Zaide ; Marino Christopher C., World-wide-web server with delayed resource-binding for resource-based load balancing on a distributed resource multi-n.
상세보기

이 특허를 인용한 특허 (16) 인용/피인용 타임라인 분석

Wipfel,Robert, Cluster failover via distributed configuration repository.
상세보기
Subbaraman,Chittur P.; Shrivastava,Sunita, Failover scopes for nodes of a computer cluster.
상세보기
Donlin, Patrick John; Watters, Samuel Edward, Failsoft system for multiple CPU system.
상세보기
Chen,Dong; Coteus,Paul W.; Gara,Alan G.; Takken,Todd E., Fault tolerance in a supercomputer through dynamic repartitioning.
상세보기
Colrain, Carol Lyndall; Brower, David, Managing a high availability framework by enabling and disabling individual nodes.
상세보기
Glickstein,Ira; Szczerba,Robert J., Method for real-time team coordination with unrealiable communications between team members.
상세보기
Skinner,Steven George; Phuong,Matthew Ky; Preston,Mark Lynn, Method to revive and reconstitute majority node set clusters.
상세보기
Gawali, Ashish L.; Rajaa, Subash, Method, apparatus and system for improving failover within a high availability disaster recovery environment.
상세보기
Okabe, Tatsuya, Parallel computer system.
상세보기
Colrain,Carol Lyndall; Brower,David; Creighton,Jonathan, Real composite objects for providing high availability of resources on networked systems.
상세보기
Robertson, Alan L.; Beekhof, Andrew J., Simulation of failure recovery within clustered systems.
상세보기
Dinker, Darpan; Tonse, Sudhir; Nadipalli, Suveen R.; Gopinath, Pramod, System and method for enabling failover for an application server cluster.
상세보기
Kownacki,Ronald William; Bertschi,Jason S., System and method for establishing bi-directional failover in a two node cluster.
상세보기
Kim, Steven D.; Elazary, Lior, System and method for managing server configurations.
상세보기
Kim, Steven D.; Elazary, Lior, System and method for managing server configurations.
상세보기
Schatz, Bob; Kiselev, Oleg, System and method for preventing data corruption in computer system clusters.
상세보기

활용도 분석정보

상세보기

다운로드

내보내기

활용도 Top5 특허

해당 특허가 속한 카테고리에서 활용도가 높은 상위 5개 콘텐츠를 보여줍니다.
더보기 버튼을 클릭하시면 더 많은 관련자료를 살펴볼 수 있습니다.

IPC	Description
A	생활필수품
A62	인명구조; 소방(사다리 E06C)
A62B	인명구조용의 기구, 장치 또는 방법(특히 의료용에 사용되는 밸브 A61M 39/00; 특히 물에서 쓰이는 인명구조 장치 또는 방법 B63C 9/00; 잠수장비 B63C 11/00; 특히 항공기에 쓰는 것, 예. 낙하산, 투출좌석 B64D; 특히 광산에서 쓰이는 구조장치 E21F 11/00)
A62B-1/08	.. 윈치 또는 풀리에 제동기구가 있는 것

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표IPC 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 공고번호, 공고일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표출원인, 출원인국적, 출원인주소, 발명자, 발명자E, 발명자코드, 발명자주소, 발명자 우편번호, 발명자국적, 대표IPC, IPC코드, 요약, 미국특허분류, 대리인주소, 대리인코드, 대리인(한글), 대리인(영문), 국제공개일자, 국제공개번호, 국제출원일자, 국제출원번호, 우선권, 우선권주장일, 우선권국가, 우선권출원번호, 원출원일자, 원출원번호, 지정국, Citing Patents, Cited Patents
저장형식	Text(ASCII format) Excel format PIAS분석(.xls)
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증

[미국특허] Controlled take over of services by remaining nodes of clustered computing system 원문보기

초록 ▼

대표청구항 ▼

연구과제 타임라인

이 특허에 인용된 특허 (39) 인용/피인용 타임라인 분석

이 특허를 인용한 특허 (16) 인용/피인용 타임라인 분석

활용도 분석정보

활용도 Top5 특허

관련 콘텐츠

특허 원문 보기

IPC 상위 출원인

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

선택된 텍스트

연합인증

[미국특허] Controlled take over of services by remaining nodes of clustered computing system 원문보기

초록 ▼

대표청구항 ▼

연구과제 타임라인

전체(0) 논문(0) 특허(0) 보고서(0)

전체(0) 논문(0) 특허(0) 보고서(0)

이 특허에 인용된 특허 (39) 인용/피인용 타임라인 분석

이 특허를 인용한 특허 (16) 인용/피인용 타임라인 분석

활용도 분석정보

활용도 Top5 특허 더보기

관련 콘텐츠

특허 원문 보기

IPC 상위 출원인

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

선택된 텍스트

활용도 Top5 특허