Optimum Allocation of Processes in a Distributed Environment: A Process-to-Process Approach

The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residin...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	The Journal of the Operational Research Society Jg. 41; H. 4; S. 329 - 337
1. Verfasser:	Sofianopoulou, Stella
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Taylor & Francis 01.04.1990 Macmillan Press Palgrave Macmillan UK Palgrave Pergamon Press Taylor & Francis Ltd
Schlagworte:	Algorithms Allocations Applied sciences Business and Management Communications processors Computer systems Cost allocation Datasets Distributed Distributed computing distributed processing Exact sciences and technology implicit enumeration Management Mathematical analysis Mathematical programming Objective functions Operations research Operations Research/Decision Theory optimization Optimum Processes Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Theoretical Paper Theoretical Papers distributed processing implicit enumeration optimization Enumeration Processor Resource allocation Telecommunication switching Theoretical study Distributed system Algorithm Optimization
ISSN:	0160-5682, 1476-9360
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residing on different processors subject to constraints on the processing power and storage c apacity (code-, data-storage and occupancy) of the processors. Constraints imposed on the co-location of certain processes on the same processor are also included. The problem is formulated as a 0-1 linear maximization problem, taking into account only the number of processes involved, while the number of processors required is produced automatically with the optimum solution. An implicit enumeration algorithm is developed which produces an optimum message-passing allocation. Computational results of a set of random problems which have similar characteristics to a real-world application in telecommunications are also presented.
AbstractList	The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residing on different processors subject to constraints on the processing power and storage c apacity (code-, data-storage and occupancy) of the processors. Constraints imposed on the co-location of certain processes on the same processor are also included. The problem is formulated as a 0-1 linear maximization problem, taking into account only the number of processes involved, while the number of processors required is produced automatically with the optimum solution. An implicit enumeration algorithm is developed which produces an optimum message-passing allocation. Computational results of a set of random problems which have similar characteristics to a real-world application in telecommunications are also presented. The process allocation problem regarding the assignment of a number of communicating processes to a certain number of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residing on different processors subject to constraints on the processing power and storage capacity (code, data storage, and occupancy) of the processors. Constraints imposed on the co-location of certain processes on the same processor are included. The problem is formulated as a 0-1 linear maximization problem, taking into account only the number of processes involved, while the number of processors required is produced automatically with the optimum solution. An implicit enumeration algorithm is developed that produces an optimum message-passing allocation. The computational results of a set of random problems that have similar characteristics to a real-world application in telecommunications are also presented. The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residing on different processors subject to constraints on the processing power and storage capacity (code-, data-storage and occupancy) of the processors. Constraints imposed on the co-location of certain processes on the same processor are also included. The problem is formulated as a 0-1 linear maximization problem, taking into account only the number of processes involved, while the number of processors required is produced automatically with the optimum solution. An implicit enumeration algorithm is developed which produces an optimum message-passing allocation. Computational results of a set of random problems which have similar characteristics to a real-world application in telecommunications are also presented. The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residing on different processors subject to constraints on the processing power and storage capacity of the processors. Constraints imposed on the co-location of certain processes on the same processor are also included. The problem is formulated as a 0-1 linear maximization problem. Computational results of a set of random problems which have similar characteristics to a real-world application in telecommunications are presented. The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori ) of identical processors in a telecommunications environment is examined. The objective is to minimize the total message-passing between processes residing on different processors subject to constraints on the processing power and storage c apacity (code-, data-storage and occupancy) of the processors. Constraints imposed on the co-location of certain processes on the same processor are also included. The problem is formulated as a 0-1 linear maximization problem, taking into account only the number of processes involved, while the number of processors required is produced automatically with the optimum solution. An implicit enumeration algorithm is developed which produces an optimum message-passing allocation. Computational results of a set of random problems which have similar characteristics to a real-world application in telecommunications are also presented.
Author	Sofianopoulou, Stella
Author_xml	– sequence: 1 givenname: Stella surname: Sofianopoulou fullname: Sofianopoulou, Stella organization: Economic University of Athens and Decree College
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19774720$$DView record in Pascal Francis
BookMark	eNp10UtPFDEcAPDGQOKC3vwAjQ9OztrH9MVtA4gmJHjQk4em0-loNzPt2nY0fHtnmCUQAqf28Pu_j8BBiMEB8AajNUZMfNrGlNdYKbRm9QuwwrXglaIcHYAVwhxVjEvyEhzlvEUIKYTVCvy83hU_jAPc9H20pvgYYOzgtxSty9ll6AM08NznknwzFtfCi_DXpxgGF8op3NzJqsRq_4Wb3S5FY3-_Aoed6bN7vX-PwY_PF9_PvlRX15dfzzZXla15XSqhatbU1ElLDFNCMNQqLlrSctoJJpVS3LHWSNRyh3BDOycb13RMClkT6hp6DE6WvFPZP6PLRQ8-W9f3Jrg4Zk2YZEQxOsG3j-A2jilMvWlCMRVkamVC755DmCJFsBCCT-rDXplsTd8lE6zPepf8YNKNxtMctSBoch8XZ1PMObnuniA9H03PR9Pz0TSbi5NH3Ppye5WSjO-fC6qWoDzlDr9cetDx0_794re5xPSwIUKRmNdFJZq3JRbmQxfTYP7F1Le6mJs-prt56ZMF_gNejMnR
CODEN	JORSDZ
CitedBy_id	crossref_primary_10_1016_0377_2217_92_90084_M
ContentType	Journal Article
Copyright	Copyright © 1990, Operational Research Society 1990 Copyright 1990 The Operational Research Society Limited Operational Research Society 1990 1991 INIST-CNRS Copyright Palgrave Macmillan Limited Apr 1990
Copyright_xml	– notice: Copyright © 1990, Operational Research Society 1990 – notice: Copyright 1990 The Operational Research Society Limited – notice: Operational Research Society 1990 – notice: 1991 INIST-CNRS – notice: Copyright Palgrave Macmillan Limited Apr 1990
DBID	AAYXX CITATION IQODW JXBYG K30 PAAUG PAWHS PAWZZ PAXOH PBHAV PBQSW PBYQZ PCIWU PCMID PCZJX PDGRG PDWWI PETMR PFVGT PGXDX PIHIL PISVA PJCTQ PJTMS PLCHJ PMHAD PNQDJ POUND PPLAD PQAPC PQCAN PQCMW PQEME PQHKH PQMID PQNCT PQNET PQSCT PQSET PSVJG PVMQY PZGFC JQ2 K9. U9A 7SC 8FD L7M L~C L~D
DOI	10.1057/jors.1990.54
DatabaseName	CrossRef Pascal-Francis Periodicals Index Online Segment 40 Periodicals Index Online Primary Sources Access—Foundation Edition (Plan E) - West Primary Sources Access (Plan D) - International Primary Sources Access & Build (Plan A) - MEA Primary Sources Access—Foundation Edition (Plan E) - Midwest Primary Sources Access—Foundation Edition (Plan E) - Northeast Primary Sources Access (Plan D) - Southeast Primary Sources Access (Plan D) - North Central Primary Sources Access—Foundation Edition (Plan E) - Southeast Primary Sources Access (Plan D) - South Central Primary Sources Access & Build (Plan A) - UK / I Primary Sources Access (Plan D) - Canada Primary Sources Access (Plan D) - EMEALA Primary Sources Access—Foundation Edition (Plan E) - North Central Primary Sources Access—Foundation Edition (Plan E) - South Central Primary Sources Access & Build (Plan A) - International Primary Sources Access—Foundation Edition (Plan E) - International Primary Sources Access (Plan D) - West Periodicals Index Online Segments 1-50 Primary Sources Access (Plan D) - APAC Primary Sources Access (Plan D) - Midwest Primary Sources Access (Plan D) - MEA Primary Sources Access—Foundation Edition (Plan E) - Canada Primary Sources Access—Foundation Edition (Plan E) - UK / I Primary Sources Access—Foundation Edition (Plan E) - EMEALA Primary Sources Access & Build (Plan A) - APAC Primary Sources Access & Build (Plan A) - Canada Primary Sources Access & Build (Plan A) - West Primary Sources Access & Build (Plan A) - EMEALA Primary Sources Access (Plan D) - Northeast Primary Sources Access & Build (Plan A) - Midwest Primary Sources Access & Build (Plan A) - North Central Primary Sources Access & Build (Plan A) - Northeast Primary Sources Access & Build (Plan A) - South Central Primary Sources Access & Build (Plan A) - Southeast Primary Sources Access (Plan D) - UK / I Primary Sources Access—Foundation Edition (Plan E) - APAC Primary Sources Access—Foundation Edition (Plan E) - MEA ProQuest Computer Science Collection ProQuest Health & Medical Complete (Alumni) Computer and Information Systems Abstracts Technology Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Periodicals Index Online Segment 40 Periodicals Index Online Segments 1-50 Periodicals Index Online ProQuest Health & Medical Complete (Alumni) ProQuest Computer Science Collection Career and Technical Education (Alumni Edition) Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	ProQuest Health & Medical Complete (Alumni) Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Sciences (General) Computer Science Business Applied Sciences
EISSN	1476-9360
EndPage	337
ExternalDocumentID	7110178 19774720 10_1057_jors_1990_54 2583803 11939568
Genre	Research Article
GroupedDBID	-~X .DC 0R~ 1OL 29L 3EH 3R3 5GY 7WY 8FL AAAZS AAIAL AAXLS ABAWQ ABBHK ABDPE ABJNI ABKVW ABLJU ABLWH ABPPZ ABXSQ ABYYQ ACGFO ACHJO ACHQT ACIWK ACNCT ACXJH ADEPB ADFRT ADGDI ADMHG ADNFJ ADULT ADXEU AEBJH AEHZU AENEX AEUPB AEYOC AEZBV AFAIT AFFNX AFTQD AGKTX AGYFW AHAJD AI. AKHJE AKMBP ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH APTMU AQTUD ASMEE ASPBG AVWKF AXYYD BGSSV BKKNO CBXGM CCKSF CS3 CYVLN DU5 EBS F5P FEFRA GENNL GUPYA HGD HVGLF IFELN IPSME JAAYA JAV JBC JBMMH JBZCM JENOY JHFFW JKQEH JLEZI JLXEF JPL JPPEU JST K60 K6~ MS~ N8N NHB NUSFT O9- P2P PLIJB RNS RPC RSV SA0 SOJ TAJZE TDBHL TFL TFW TN5 U5U VH1 WH7 ZCG ~02 ALIPV AMPGV AJPNJ AQSKT CSNOR GROUPED_ABI_INFORM_COMPLETE JSODD PKN VQA 0BK 30N 4.4 7RQ 7X7 88E 8FE 8FG 8FI 8FJ 8G5 8R4 8R5 AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR AARHV AAYXX ABJCF ABLIJ ABMNI ABPAQ ABUWG ABXUL ABXYU ACREN ACTIO ACTTO ADBBV ADGTB ADMLS ADUMR AECXW AEISY AEXYK AFBWG AFFHD AFKRA AFRVT AGAYW AGBKS AGDLA AGVKY AGWUF AHDZW AHSBF AIYEW AJRNO AKBVH AKOOK ALQZU ALRRR AQRUH ARAPS AWYRJ AZQEC BENPR BEZIV BGLVJ BLEHA BPHCQ BVXVI CAG CCCUG CCPQU CITATION COF CYRSC DAOYK DGEBU DWQXO EJD FRNLG FYUFA GNUQQ GROUPED_ABI_INFORM_RESEARCH GUQSH HCIFZ HMCUK H~9 K6V K7- KYCEM L6V LJTGL M0C M1P M2O M4Z M7S P62 PHGZM PHGZT PJZUB PPXIY PQBIZ PQBZA PQGLB PQQKQ PROAC PSQYO PTHSS Q2X RNANH ROSJB RTWRZ TASJS TBQAZ TEN TFT TTHFI TUROJ UKHRP XSW ZGOLN AAYZH ADYSH IQODW JXBYG K30 PAAUG PAWHS PAWZZ PAXOH PBHAV PBQSW PBYQZ PCIWU PCMID PCZJX PDGRG PDWWI PETMR PFVGT PGXDX PIHIL PISVA PJCTQ PJTMS PLCHJ PMHAD PNQDJ POUND PPLAD PQAPC PQCAN PQCMW PQEME PQHKH PQMID PQNCT PQNET PQSCT PQSET PSVJG PVMQY PZGFC JQ2 K9. U9A 7SC 8FD L7M L~C L~D
ID	FETCH-LOGICAL-c464t-7945b43e8c2a597750d967d2d63f7589996e5da80d6e01b3fe8bebf5878423eb3
IEDL.DBID	TFW
ISICitedReferencesCount	4
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1057_jors_1990_54&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0160-5682
IngestDate	Sun Nov 09 09:33:07 EST 2025 Fri Oct 03 07:51:24 EDT 2025 Fri Jul 25 04:48:39 EDT 2025 Mon Jul 21 09:14:51 EDT 2025 Sat Nov 29 01:37:12 EST 2025 Tue Nov 18 22:19:45 EST 2025 Fri Feb 21 02:44:33 EST 2025 Thu May 29 08:42:40 EDT 2025 Mon Oct 20 23:43:36 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	distributed processing implicit enumeration optimization Enumeration Processor Resource allocation Telecommunication switching Theoretical study Distributed system Algorithm Optimization
Language	English
License	http://www.springer.com/tdm CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c464t-7945b43e8c2a597750d967d2d63f7589996e5da80d6e01b3fe8bebf5878423eb3
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 content type line 23
PQID	1309217776
PQPubID	1817193
PageCount	9
ParticipantIDs	crossref_primary_10_1057_jors_1990_54 pascalfrancis_primary_19774720 crossref_citationtrail_10_1057_jors_1990_54 proquest_journals_1309217776 proquest_journals_231372794 informaworld_taylorfrancis_310_1057_jors_1990_54 jstor_primary_10_2307_2583803 proquest_miscellaneous_25852953 springer_journals_10_1057_jors_1990_54
PublicationCentury	1900
PublicationDate	1990-04-01
PublicationDateYYYYMMDD	1990-04-01
PublicationDate_xml	– month: 04 year: 1990 text: 1990-04-01 day: 01
PublicationDecade	1990
PublicationPlace	London
PublicationPlace_xml	– name: London – name: Basingstoke – name: Abingdon
PublicationTitle	The Journal of the Operational Research Society
PublicationTitleAbbrev	J Oper Res Soc
PublicationYear	1990
Publisher	Taylor & Francis Macmillan Press Palgrave Macmillan UK Palgrave Pergamon Press Taylor & Francis Ltd
Publisher_xml	– name: Taylor & Francis – name: Macmillan Press – name: Palgrave Macmillan UK – name: Palgrave – name: Pergamon Press – name: Taylor & Francis Ltd
SSID	ssj0009019
Score	1.3648409
Snippet	The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori) of identical... The process allocation problem (PAP) concerned with the assignment of a number of communicating processes to a certain number (not known a priori ) of... The process allocation problem regarding the assignment of a number of communicating processes to a certain number of identical processors in a...
SourceID	proquest pascalfrancis crossref springer jstor informaworld
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	329
SubjectTerms	Algorithms Allocations Applied sciences Business and Management Communications processors Computer systems Cost allocation Datasets Distributed Distributed computing distributed processing Exact sciences and technology implicit enumeration Management Mathematical analysis Mathematical programming Objective functions Operations research Operations Research/Decision Theory optimization Optimum Processes Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Theoretical Paper Theoretical Papers
Title	Optimum Allocation of Processes in a Distributed Environment: A Process-to-Process Approach
URI	https://www.tandfonline.com/doi/abs/10.1057/jors.1990.54 https://www.jstor.org/stable/2583803 https://link.springer.com/article/10.1057/jors.1990.54 https://www.proquest.com/docview/1309217776 https://www.proquest.com/docview/231372794 https://www.proquest.com/docview/25852953
Volume	41
WOSCitedRecordID	wos10_1057_jors_1990_54&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAWR databaseName: Taylor & Francis Online Journals customDbUrl: eissn: 1476-9360 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: TFW dateStart: 19500301 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB5VFUJwoHQBkb7wARAIuWTjOHa4raArToVDEZU4WLbjSEVtUm2y_H48id3dLeUANysZx7I945nJjL8BeMmySmelyakrc0tzJgwttZG0KEtjvIXPmB6LTYjTU3l-Xn7dAhnvwmBaJfrQ9QgUMZzVKNzadLEq7fuf7aLDW3bpMUcgUK_xUSLP5t9XaLvpUNED0dMoL2QWMt5vd97QRRtIpTE7EVMldedXqx7LXGzYobdCp4NGmu_8_1wew6NghZLZyDa7sOWaCdyPSfAT2InFHkiQ_Qk8XEMunMBueN6RNwG4-u0T-PHFnz9Xyysyu0QViVtO2pqEuwie9qIhmnxCqF6ssuUqcrK6ZveBzCIl7VsammQWMM-fwrf5ydnHzzQUb6A2L_KeejnnJmdO2kwjxh1Pq7IQVVYVrPY-CvpZjldaplXh0qlhtZPGmZpLIb2F5138Z7DdtI17DsQ6MeVCF17b8nxqjdTex9TGWCuZddMqgXdxG5UNyOZYYONSDRF2LhSussJVVjxP4NUN9fWI6PEXunSdI1Q__EEJfKDY3V0OB65Z_y4m2qsMg9MpS-Bog5tWdGiFiyxN4CCylwpnSYcBx9I7jkIUCez_-dob6MwboaUf_cXNW39GYOBHN65ddjg8xnP9-K8jy659_o6J7P373PfhAbbGpKYD2O4XS3cI9-yv_qJbHA3i-RtwFz2J
linkProvider	Taylor & Francis
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Nb9QwEB1BQRQOlC4gQr98AARCptk4ThxuK-iqiLJwWEQlDpbtOFJRm6BNlt-PJ3G62VIOiFuUTGLZGXtmPOP3AJ6xKFdRpmNqs9jQmKWaZkoLmmSZ1s7DZ0x1ZBPpbCZOT7MvA6ovLKvEGLrogCLatRonN25G97S0hz-qRY3H7MI3PL4Jt7gzsQibP59-W-Hthi2nB-KnUZ6IyNe8X317zRqtYZX29YlYLKlqN15FR3Sx5oleSZ62Nmm69R-9eQD3vSNKJp3mbMMNW47gTl8HP4Ktnu-B-Ok_gnsD8MIRbPv7NXnpsatfPYTvn90SdLG8IJNztJL410lVEH8cwcmelUSR94jWi0RbNidHq5N2b8mkl6RNRf0lmXjY80fwdXo0f3dMPX8DNXESN9RNda5jZoWJFMLc8TDPkjSP8oQVLkzBUMvyXIkwT2w41qywQltdcJEK5-S5KP8xbJRVaZ8AMTYd81QlzuDyeGy0UC7MVFobI5ix4zyA1_1_lMaDmyPHxrlsk-w8lTjKEkdZ8jiA55fSPztQj7_IhUOVkE27ieIVQbLrX9lr1Wb4Xay1lxHmp0MWwP6aOq3k0BFPozCA3V6_pF9Oasw5Zi52TNMkgJ0_HzsfnTk_NHOtH1w-dcsE5n5Uaatljc1jSte1_6LX2cHnr-nI03_v-wFsHs8_nciTD7OPO3AX73Y1Truw0SyWdg9um1_NWb3Yb-fqb0xlQbM
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED-NgabxwFgBEfblB0CgyZDGcezwVrFVIFDZwxCTeLBsx5E2benUpPz9-BJnbcd4gLfIPtuyfbbvcne_A3jJkkInuUmpy1NLUyYMzbWRNMtzY7yEz5jukk2IyUSeneUnayD7WBh0q0QduuyAItq7Gg_3dVH2WWnfX0xnNUbZxe94eg_ue4k5Q94-Hf9YwO3GbUoPhE-jPJNJcHm_3XrlMVqBKu3dE9FXUtd-ucouz8WKIHrLdto-SeOt_5_MY3gUxFAy6vhmG9ZcNYCN3gt-AFt9tgcSDv8AHi5BFw5gO5TX5E1Arn77BH5-8xfQ1fyKjC7xjcQ9J9OShGAET3teEU2OEKsX02y5ghwv4uw-kFFPSZspDZ9kFEDPn8L38fHpx080ZG-gNs3ShvqDzk3KnLSJRpA7Hhd5JoqkyFjplRRUtBwvtIyLzMVDw0onjTMll0J6Ec_r-M9gvZpW7jkQ68SQC53555anQ2uk9kqmNsZayawbFhEc9tuobIA2xwwbl6o1sXOhcJUVrrLiaQSvbqivO0iPv9DFyxyhmvYXSuADxe5ustdyzXK_6GmvErROxyyC_RVuWtChGC6SOILdnr1UuExqtDjmXnMUIotg589qL6EzL4XmfvSDm1p_SaDlR1duOq9xeDTo-vFf9yy71P0dE3nx73M_gI2To7H6-nnyZQc2sbBzcNqF9WY2d3vwwP5qzuvZfntSfwNjM0Bl
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimum+Allocation+of+Processes+in+a+Distributed+Environment%3A+A+Process-to-Process+Approach&rft.jtitle=The+Journal+of+the+Operational+Research+Society&rft.au=Sofianopoulou%2C+Stella&rft.date=1990-04-01&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=0160-5682&rft.eissn=1476-9360&rft.volume=41&rft.issue=4&rft.spage=329&rft_id=info:doi/10.1057%2Fjors.1990.54&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=7110178
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0160-5682&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0160-5682&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0160-5682&client=summon