VERMEIDUNG VON DEADLOCKS IM ALLGEMEINEN UND VON PUFFER-DEADLOCKS BEI STOREES AND FORWARD. KOMMUNIKATION IM BESONDEREN. = COMMENT EVITER LE "VERROU MORTEL" EN GENERAL ET LE VERROU MORTEL DU TAMPON LORS DE COMMUNICATION "STORE AND FORWARD" EN PARTICULIERGUENTHER K.1974; MITT. GESELLSCH. MATH. DATENVERARBEIT.; DTSCH.; DA. 1974; NO 28; PP. 1-15; BIBL. 2 REF.Article

UNE SOLUTION AU PROBLEME DU VERROU MORTEL EN PARTAGE SIMULTANE DE FICHIERS.GARDARIN G.1974; ; S.L.; DA. 1974; PP. (149P.); BIBL. 2 P.; (THESE DOCT. 3E. CYCLE, SPEC. MATH., MENTION INF.; PARIS VI)Thesis

Ein einfacher Algorithmus zur Auflösung von Deadlocks in Verteilten Datenbanksystemen = Un algorithme simple pour la détection de verrou mortel dans les systèmes de bases de données réparties = A simple algorithm for the detection of deadlaks in distributed database systemsSCHERG, W.Angewandte Informatik. 1984, Num 2, pp 60-61, issn 0013-5704Article

COMMENT ON DEADLOCK PREVENTION METHOD = COMMENTAIRE SUR UNE METHODE DE PREVENTION DE BLOCAGEPARNAS DL; HABERMANN AN.1972; COMMUNIC. A.C.M.; U.S.A.; DA. 1972; VOL. 15; NO 9; PP. 840-841; BIBL. 2 REF.Serial Issue

CRITERES DE SUPPRESSION DES PROCESSUS VERROUILLESKOTOWSKI M.1976; PRACE C.O. P.A.N.,; POLSKA; DA. 1976; NO 268; PP. 1-16; ABS. ANGL. RUSSEArticle

VERROU MORTEL ET RESSOURCES SIMULTANEMENT PARTAGEABLESGARDARIN G; ROCHER M.1972; IN: TECH. INF. CONGR. AFCET. GRENOBLE, 1972; PARIS; AFCET; DA. 1972; VOL. 1; PP. 225-241; BIBL. 3 REF.Conference Paper

ACCES SYNCHRONIZATION AND DEADLOCK-ANALYSIS IN DATABASE SYSTEMS: AN IMPLEMENTATION-ORIENTED APPROACH.SCHLAGETER G.1975; INFORM. SYST.; G.B.; DA. 1975; VOL. 1; NO 3; PP. 97-102; BIBL. 11 REF.Article

A NEW APPROACH TO AVOIDANCE OF SYSTEM DEADLOCKS.HABERMANN AN.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., B; FR.; DA. 1975; VOL. 9; NO 3; PP. 19-28; ABS. FR.; BIBL. 6 REF.Article

ON THE INTEGRITY OF DATA BASES AND RESOURCE LOCKING.BAYER R.1976; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1976; VOL. 39; PP. 339-361; BIBL. 1 P. 1/2; (DATA BASE SYST. 5TH INF. SYMP. PROC.; BAD HOMBURG; 1975)Conference Paper

A DEADLOCK-FREE SCHEME FOR RESOURCE LOCKING IN A DATA BASE ENVIRONMENT.CHAMBERLIN DD; BOYCE RF; TRAIGER IL et al.1974; IN: INF. PROCESS. 74. INT. FED. PROCESS. CONGR.; STOCKHOLM; 1974; AMSTERDAM; NORTH HOLLAND PUBL.; DA. 1974; PP. 340-343; BIBL. 2 REF.Conference Paper

SIMULATION AND MODELING.1975; AMSTERDAM.; NORTH-HOLLAND; DA. 1975; PP. 53-84; BIBL. DISSEM.; (WORKSHOP MICROARCHIT. COMPUT. SYST. PREPR.; NICE; 1975)Conference Proceedings

A GENERAL MECHANISM FOR AVOIDING STARVATION WITH DISTRIBUTED CONTROL.DEVILLERS RE; LAUER PE.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 3; PP. 156-158; BIBL. 4 REF.Article

VERIFYING PROPERTIES OF PARALLEL PROGRAMS: AN AXIOMATIC APPROACH.OWICKI S; GRIES D.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 5; PP. 279-285; BIBL. 9 REF.; (ACM SYMP. OPER. SYST. PRINC. 5; AUSTIN, TEX.; 1975)Conference Paper

B-TREES IN A SYSTEM WITH MULTIPLE USERS.SAMADI B.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 4; PP. 107-112; BIBL. 4 REF.Article

REDUCTION: A METHOD OF PROVING PROPERTIES OF PARALLEL PROGRAMS.LIPTON RJ.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 12; PP. 717-721; BIBL. 6 REF.; (2ND. ACM SYMP. PRINC. PROGRAM. LANG.; PALO ALTO, CALIF.; 1975)Conference Paper

MECHANIZABLE PROOFS ABOUT PARALLEL PROCESSES.CADIOU JM; LEVY JJ.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 34-48; BIBL. 1 P. 1/2Conference Paper

LE VERROU MORTEL EN PARTAGE SIMULTANE DE RESSOURCES.GARDARIN G.sdIN: STRUCT. PROGRAMMATION DES CALC. SEMIN.; ROCQUENCOURT; 1974-75; ROCQUENCOURT; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 25-47; BIBL. 12 REF.Conference Paper

DEADLOCK-BEHANDLUNG IN DATENBANK-SYSTEMEN. = GESTION DU VERROU MORTEL DANS LES SYSTEMES DE BANQUE DE DONNEESWEINBIR H; SAHN J.1977; ANGEW. INFORMAT.; DTSCH.; DA. 1977; VOL. 19; NO 2; PP. 73-77; ABS. ANGL.; BIBL. 1 REF.Article

EVITEMENT DES INTERBLOCAGES DANS UN MODELE A ORGANIGRAMMES.DEVILLERS R.sdIN: STRUCT. PROGRAMMATION DES CALC. SEMIN.; ROCQUENCOURT; 1974-75; ROCQUENCOURT; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 49-62; BIBL. 6 REF.Conference Paper

An application of boolean algebra to system deadlock problemsNEZU, K.NEC research & development. 1983, Num 71, pp 106-113, issn 0547-051XArticle

DEADLOCK-FREE PARALLEL PROCESSING.HILL AG; TOWNSEND HRA.1975; IN: INT. JOINT CONF. ARTIF. INTELL. 4. ADV. PAP.; TBILISI; 1975; CAMBRIDGE, MASS.; ARTIF. INTELL. LAB.; DA. 1975; VOL. 2; PP. 534-537; BIBL. 11 REF.Conference Paper

A HARDWARE APPROACH TO DEADLOCK DETECTION IN COMPUTER SYSTEMSWAXMAN J; ROOTENBERG J.1979; INTERNATION. J. SYST. SCI.; GBR; DA. 1979; VOL. 10; NO 5; PP. 477-483; BIBL. 8 REF.Article

A METHOD DEADLOK-FREE RESOURCE ALLOCATION AND FLOW CONTROL IN PACKET NETWORKS.RAUBOLD E; HAENLE J.1976; IN: ADV. THROUGH. RESOUR. SHARING. INT. CONF. COMPUT. COMMUN. 3. PROC.; TORONTO; 1976; WASHINGTON, D.C.; INT. COUNC. COMPUT. COMMUN.; DA. 1976; PP. 483-487; BIBL. 8 REF.Conference Paper

UNE ETUDE COMPARATIVE DES METHODES DE PREVENTION DE L'INTERBLOCAGEBAK P.1976; PODSTAWY STEROWAN.; POLSKA; DA. 1976; VOL. 6; NO 4; PP. 359-382; ABS. ANGL. RUSSE; BIBL. 17 REF.Article

SOFTWARE CONTROLLED ACCESS TO DISTRIBUTED DATA BASES.MAHMOUD SA; RIORDON JS.1977; INFOR; CANADA; DA. 1977; VOL. 15; NO 1; PP. 22-36; ABS. FR.; BIBL. 15 REF.Article