TECHNICHE DI DECOMPOSIZIONE ED AGGREGAZIONE PER LA SOLUZIONE DI SISTEMI DISTRIBUITI = TECHNIQUES DE DECOMPOSITION ET D'AGREGATION POUR LA SOLUTION DE SYSTEMES REPARTISIAZEOLLA G; TUCCI S.1981; RIV. INFORM.; ISSN 0390-668X; ITA; DA. 1981; VOL. 11; NO 4; PP. 393-410; ABS. ENG; BIBL. 12 REF.Article

INVARIANCE PROPERTIES OF QUEUEING NETWORKS AND THEIR APPLICATION TO COMPUTER/COMMUNICATION SYSTEMSDUKHOVNY IM; KOENIGSBERG E.1981; INFOR (OTTAWA); ISSN 0315-5986; CAN; DA. 1981; VOL. 19; NO 3; PP. 186-204; ABS. FRE; BIBL. 35 REF.Article

ANALYZING QUEUEING NETWORKS WITH SIMULTANEOUS POSSESSIONJACOBSON PA; LAZOWSKA ED.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 2; PP. 142-151; BIBL. 9 REF.Article

COMPUTER PERFORMANCE MODELLING: AN OVERVIEWPENTZAROPOULOS GC.1982; APPL. MATH. MODEL.; ISSN 0307-904X; GBR; DA. 1982; VOL. 6; NO 2; PP. 74-80; BIBL. 76 REF.Article

NUMERICAL SOLUTIONS OF SOME MULTIPLE CHAIN QUEUEING NETWORKSSAUER CH.1981; PERFORM. EVAL. REV.; ISSN 0163-5999; USA; DA. 1981-1982; VOL. 10; NO 4; PP. 47-56; BIBL. 9 REF.Article

QUEUING NETWORK MODELS OF PACKET SWITCHING NETWORKS. I: OPEN NETWORKSWONG JW; LAM SS.1982; PERFORMANCE EVALUATION; ISSN 0166-5316; NLD; DA. 1982; VOL. 2; NO 1; PP. 9-21; BIBL. 24 REF.Article

APPROXIMATE SOLUTION OF QUEUEING NETWORKS WITH SIMULTANEOUS RESOURCE POSSESSIONSAUER CH.1981; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1981; VOL. 25; NO 6; PP. 894-903; BIBL. 31 REF.Article

APPROXIMATE ANALYSIS OF GENERAL QUEUING NETWORKS.CHANDY KM; HERZOG U; WOO L et al.1975; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1975; VOL. 19; NO 1; PP. 43-49; BIBL. 9 REF.Article

SIMULATION FOR PASSAGE TIMES IN CLOSED, MULTICLASS NETWORKS OF QUEUES WITH UNRESTRICTED PRIORITIESSHEDLER GS; SOUTHARD J.1982; PERFORMANCE EVALUATION; ISSN 0166-5316; NLD; DA. 1982; VOL. 2; NO 4; PP. 257-267; BIBL. 11 REF.Article

ZUR LEISTUNGSANALYSE VON SYMMETRISCHEN MEHRPROZESSOR-SYSTEMEN = SUR L'EVALUATION DES PERFORMANCES DE SYSTEMES MULTIPROCESSEURS SYMETRIQUESBOLCH G; JARSCHEL W.1982; ELEKTRON. RECHENANL.; ISSN 0013-5720; DEU; DA. 1982; VOL. 24; NO 1; PP. 3-7; ABS. ENG; BIBL. 5 REF.Article

OPEN QUEQUEING NETWORKS WITH FINITE CAPACITY QUEUESNILSSON AA; ALTIOK T.1981; INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING/1981/BELLAIRE OH; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1981; PP. 87-91; BIBL. 7 REF.Conference Paper

MODELES DE RESEAUX DE FILES D'ATTENTE AVEC PANNES = MODELS OF QUEUEING NETWORKS SUBJECT TO BREAKDOWNSMIKOU NOUFISSA.1981; ; FRA; DA. 1981; 159 P.; 30 CM; BIBL. DISSEM.; TH.: SCI./PARIS 11/1981/2530Thesis

MODELLI MATEMATICI ESATTI PER LA SOLUZIONE DI SISTEMI DISTRIBUITI = MODELES MATHEMATIQUES EXACTS POUR LA SOLUTION DE SYSTEMES DISTRIBUESDONATIELLO L; IAZEOLLA G; TUCCI S et al.1981; RIV. INFORM.; ISSN 0390-668X; ITA; DA. 1981; VOL. 11; NO 3; PP. 283-305; ABS. ENG; BIBL. 14 REF.Article

EQUIVALENCE ET DECOMPOSITION DANS LES MODELES A FILES D'ATTENTE ET LEUR APPLICATION A L'EVALUATION DES PERFORMANCES DE SYSTEMES D'EXPLOITATION.BRANDWAJN A.1975; AO-CNRS-10936; FR.; DA. 1975; PP. (291P.); H.T. 4; BIBL. 27 P.; (THESE DOCT. SCI., SPEC. MATH., MENTION INF.; PARIS VI)Thesis

ADAPTIVE ROUTING USING A VIRTUAL WAITING TIME TECHNIQUEAGRAWALA AK; TRIPATHI SK; RICART G et al.1982; IEEE TRANS. SOFTW. ENG.; ISSN 0098-5589; USA; DA. 1982; VOL. 8; NO 1; PP. 76-81; BIBL. 5 REF.Article

BALANCED JOB BOUND ANALYSIS OF QUEUEING NETWORKZAHORJAN J; SEVICK KC; EAGER DL et al.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 2; PP. 134-141; BIBL. 8 REF.Article

LOGICIEL NUMERIQUE ASSOCIE A UNE MODELISATION DE SYSTEMES INFORMATIQUESCACHARD FRANCOIS.1981; ; FRA; DA. 1981; 132 P.; 21 CM; BIBL. 17 REF.; TH. DOCT.-ING./GRENOBLE 1-INPG/1981Thesis

A GENERATING FUNCTION APPROACH TO QUEUEING NETWORK ANALYSIS OF MULTIPROGRAMMED COMPUTERS.WILLIAMS AC; BHANDIWAD RA.1976; NETWORKS; U.S.A.; DA. 1976; VOL. 6; NO 1; PP. 1-22; BIBL. 9 REF.Article

Approximate analysis of open networks of pneues with blocking: tandem configurationsPERROS, H. G; ALTIOK, T.IEEE transactions on software engineering. 1986, Vol 12, Num 3, pp 450-461, issn 0098-5589Article

Cluster analysis and workload classificationRAATIKAINEN, K. E. E.Performance evaluation review. 1993, Vol 20, Num 4, pp 24-30, issn 0163-5999Article

PRODUCT FORM AND LOCAL BALANCE IN QUEUEING NETWORKS.MANI CHANDY K; HOWARD JH JR; TOWSLEY DF et al.1977; IN: MODELLING PERFORMANCE EVAL COMPUT. SYST. INT. WORKSHOP. PROC.; ISPRA; 1976; AMSTERDAM; NORTH-HOLLAND; DA. 1977; PP. 89-101; BIBL. 1 P. 1/2Conference Paper

THE EPF TECHNIQUE: A METHOD FOR OBTAINING APPROXIMATE SOLUTIONS TO CLOSED QUEUEING NETWORKS WITH GENERAL SERVICE TIMES.SHUM AW; BUZEN JP.1977; IN: MODELLING PERFORMANCE EVAL. COMPUT. SYST. INT. SYMP. 3; BONN-BAD GODESBERG; 1977; AMSTERDAM; NORTH HOLLAND; DA. 1977; PP. 201-220; BIBL. 14 REF.Conference Paper

ALGORITHME DE RESEAUX DE FILES D'ATTENTE FERMES B.C.M.P. ET HEURISTIQUES ASSOCIEES = CLOSED B.C.M.P. QUEUING NETWORKS ANALYSIS AND ASSOCIATED HEURISTICSDRIX PHILIPPE.1982; ; FRA; DA. 1982; 402 P.; 30 CM; BIBL. 31 REF.; TH. DOCT.-ING.: MATH. APPL./PARIS 6/1982Thesis

EVALUATION D'ALGORITHMES DE CONTROLE DE CONCURRENCE = PERFORMANCE EVALUATION OF CONCURRENCY CONTROL ALGORITHMSMADELAINE JACQUES.1982; ; FRA; LE CHESNAY: IMPR. I.N.R.I.A.; DA. 1982; INRIA/RR-164; PAG. MULT.; 30 CM; RAPPORTS DE RECHERCHE; 164;[RAPP. RECH.-I.N.R.I.A.; ISSN 0249-6399; NO 164]Report

HDLC THROUGHPUT AND RESPONSE TIME FOR BIDIRECTIONAL DATA FLOW WITH NONUNIFORM FRAME SIZESLABETOULLE J; PUJOLLE G.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 6; PP. 405-413; BIBL. 18 REF.Article