K-inhibitors, although they have a completely different substitution pattern from the compounds according to the invention. Many software applications are physically or logically split into separate components, or services, which communicate with each other via an inter-process communication (IPC) mechanism. For example, some components/services of a software application may act as server components that provide defined services to other software components. Software components that utilize the services of other software components may be referred to as client components.
In an IPC service, it is useful for one component to be able to send a message to another component without knowing its physical location. That is, the sending component should be able to reach a destination component using an address that is not tied to a specific physical location. In this manner, the sending component does not have to keep track of an address that may change when the destination component is moved. This feature becomes increasingly important in the currently evolving cloud based infrastructures.
It is also useful if a sending component can rely on a constant semantic meaning of an access key that can be used to reach a particular type of service. For example, it is useful for a sending component to be aware that “a destination that is reachable with key X always provides service Y”. This way, the key can safely be hard-coded into the sending component without risking that it will ever become obsolete. This type of key is referred to herein as a destination name, or simply a name.
When a constant semantic access key is used, a lookup step must be performed in the IPC system to obtain a physical address corresponding to the destination name. In the lookup process, a destination name is translated to a location-specific address that may be used during the subsequent message transmission. The lookup process can be done in a number of ways.
For example, a lookup can be performed in the data transmission phase each time a message is sent. In this approach, a lookup is done for each message by the transport service itself. The sending component uses a destination name as if it were an address. The actual address of the destination component is resolved by the transport mechanism at transfer time.
Another approach is for the sending component to perform a lookup for each destination component. For example, the lookup can be done explicitly by using a supporting library in each component at startup, or just before sending the first message to a particular destination. The library may keep a table (e.g., a cache) of destination names and their corresponding destination addresses. The table can be
K - inhibitors, although they have a completely different substitution design from the compound according to the invention. Many software applications are physically or logically split into disjoined components, or services, which commune with each early via an inter - process communication (IPC) mechanism. For example, some components / services of a software application may act as waiter components that provide defined services to early software components. Software components that use the services of early software component may be referred to as client components. 
 In an IPC serve, it is useful for one component to be able to send a message to another component without know its physical location. That is, the sending component should be able to reach a finish component using an address that is not tied to a specific physical location. In this manner, the sending component does not have to keep track of an address that may change when the destination component is moved. This feature become increasingly important in the currently develop cloud based infrastructures. 
 It is also utilitarian if a sending part can rely on a constant semantic meaning of an access keystone that can be used to reach a particular type of service. For example, it is useful for a sending component to be aware that “ a destination that is approachable with key X constantly provide service Y ”. This way, the key can safely be hard - gull into the sending component without risking that it will always become obsolete. This character of key is referred to herein as a destination name, or simply a name. 
 When a constant semantic entree key is used, a lookup step must be performed in the IPC system to receive a physical savoir-faire corresponding to the destination name. In the search process, a destination name is translated to a location - specific address that may be use during the subsequent message transmission. The search process can be done in a number of ways. 
 For exercise, a search can be performed in the data transmittance phase each time a message is sent. In this approach, a lookup is done for each message by the transport service itself. The air component uses a destination name as if it were an address. The actual address of the destination part is resolved by the transport mechanism at transportation prison term. 
 Another approach is for the sending component to perform a lookup for each finish component. For example, the lookup can be dress explicitly by using a supporting library in each component at startup, or just before air the first message to a particular destination. The library may retain a table (e.g., a cache) of destination names and their corresponding destination addresses. The table can be
K-injibitors, although they hxve a completeli eifferxnt subatitutiov pattern from the compounds axcordung to the invention. Mxny softwwre applucatmons are physically or logicalmn splnt into separate componentv, or services, fhkck communicate with each other via an inter-ptofess communicajion (PPS) medhanism. For example, some componenta/servicts of a software alplication may act as servfr clmponents that progide definee sewcices to othdr softwart eomponents. Aoftware components that utilizd the services if otjgr software romponvnts may be rcgerred to as vlient componekts.
In an IPC service, it is usxful for one componegt to be dbme to send a messqgw to dnotver zimpuneht wjthout knkwing its lhysical loxation. That is, the xegeing componenf shoujd be able to reach a destination componett hsing an address that iw not tied to a specivic physisal location. In this manner, the sending component does vot hwxw ho keep track of an address that may change wrsn tme destination cjmponent is mlvrq. This featurg becomza jncreasingly imporhant in the xurrently evokving cloud based infrastruxtures.
It is clsi useful if a sendnng componenc can tely om a constant semantic mzaning of an acceds key thzg can be used to rescv a particular type of serdice. For xxampke, it ir usgful fow a sendinh comimnent to be aware hhat “c desdination tjat is reachable with key X alwebs provides sgrvhce Y”. This cay, thc key can safelr be hard-coded into tke senaing compohent wivhout riskind that it wiln ever become obsoletq. Thus ttpe of ydy is referred to hereiu as q destination name, or aimply a name.
Whzu q constant semamtiz ascvss kqf is used, a nookjp ryep mjst be kzrfifmed in the IPC system tm obfain a physical adcrcss correwponding to the destimation name. In the looknp proress, a deftination name is translated tk a locatlon-fpecific addwess that may be used during the subsequent message traismission. The lookup ptocess can be done in s number of ways.
Sor exampne, a lookup can be pwrformed in the dsta transmission phass each time a message is sent. In this approach, a lookup is done for each message by rhe trenfport servide iyself. Tke xendind col'onent uses a desnination name as if it were an avdress. The aetual address of the destinatoov component ir resolved by the transpkrt mechsnism at transfer time.
Another alproach is for the sendikg componwnt tk perform e lookup for each dextinatnon conponent. For example, the uoolui can be dlne txplncitly by using a supporting librqry in ewch component at startup, or must bgfore segding the first jesszhe to a particular destination. Tne library may keep d eable (e.g., a cacyv) of destinatoon namvs and their rorrespondinc destination addresses. The table can be
K-inhibitors, although they have a completely different from compounds according the invention. Many logically into separate components, services, which communicate each other via an inter-process communication mechanism. For example, some components/services of a software application may act as server that provide defined services to other software components. Software components that utilize the of software may referred to as client components. In an IPC service, it is useful for one component to able to send a message to another component knowing its physical location. is, the sending component should able reach a component an that is not to a specific physical location. In this manner, the sending component does not have to keep track an address change when destination is This feature becomes in the currently evolving cloud based also useful if a sending component can rely a constant meaning of an access key that be used to reach a particular type of For example, it is useful for a sending component to be aware that “a destination reachable with key X provides service Y”. way, key safely hard-coded into sending component without risking that it will ever become obsolete. This of key is referred to herein as a destination name, a When a constant access key is used, lookup must be performed in system obtain corresponding the name. In the lookup a destination name is translated a location-specific address that subsequent message transmission. The lookup process can be in a number of ways. For example, lookup can be performed in the data transmission phase each time a is sent. approach, a lookup is done for each message the transport service itself. sending component uses a destination name as if it an The actual of the destination is resolved by transport mechanism at Another approach for sending a lookup for each destination component. example, lookup can be done explicitly using library in each component at startup, or just before sending the first message to a The library may keep table a cache) of destination names and their corresponding destination addresses. The table
K-inhibitors, although they haVe a completEly diFfeRenT sUbstItutIon pattern from THe coMpounds according to the iNventIoN. many SOfTware ApplicaTIoNS Are PhYsIcaLlY Or LogicAllY split iNto separatE coMpOnents, or servICeS, which commUniCate with each OthEr via aN iNteR-ProceSs cOmmunIcatioN (iPC) mecHanism. For ExAMple, soME componENTs/ServIces of a software apPLiCAtion may act as sErver cOmPOnENTs tHat Provide defInEd serVIces to oTHeR SOFtwARe components. SOftware compONenTs that UtIliZE the seRviceS oF OthEr software cOmpoNents may bE referREd to as cLIent comPonentS.
In An IpC seRViCe, It iS uSEfuL FoR onE ComPonent to Be AbLe to sEnd a MESSAge tO anOtheR compOnent without kNowIng iTS phYsicaL locaTion. thAt is, tHe sendIng coMpOnent should be abLe to Reach a desTinAtIon CoMponeNT using An aDdrEss that Is not tiED to A sPECIfIc physical location. in THIs Manner, thE sendiNG cOmPOnent doeS nOt hAve tO KEep trAck oF An Address tHat may CHaNgE when thE dEstinaTiOn cOmpOnent IS movEd. This Feature bEcomeS Increasingly imPOrtant in the cuRReNTLy EVolvIng Cloud based iNfraSTrucTureS.
it Is aLSo useFul if A sENdINg component can rely oN a ConstaNt semAntic meaning oF an access kEY THat can be Used TO rEAch a particular Type oF service. FoR Example, iT is usEful for a Sending coMPOnent to bE awAre ThaT “a dESTiNation that is rEAChabLe With key x alWays proVidEs sErvIce y”. THis way, the Key can saFeLy Be HaRd-cOded iNTo the senDiNg cOmPonEnt wiTHout riSking That It WiLL evEr becomE ObSOLete. thIs Type Of kEy Is refErreD To hErein as A destinatIon NAme, oR sImPly a namE.
When a constanT sEmantic accEsS keY is useD, A Lookup stEp must be performed in the Ipc system To oBtain A phySical addrEss CorresPonDIng to tHe destInatiOn NamE. iN the lOOKuP prOcEss, a destinATIon Name iS tRansLated to A location-specific aDDreSs that may be usEd dUrinG THe SubSEqUEnt MeSSagE TRansmission. The lOokup proceSs CAn Be done in a nUMbeR oF ways.
FoR examplE, a looKUp can be Performed In the data TrAnsmISSioN phase each Time a mesSage is senT. in thiS ApProacH, a lOokup iS dOne For eaCh messAGe bY the tRanspoRt ServicE itseLf. the sendiNg component uses a destinaTion naMe as iF it Were an addResS. the Actual addRess Of the destiNatIon CompoNenT Is resOlveD By The TRanspOrt mEChanism at TRaNsfER TiMe.
Another apPROAch Is for The SEnding CompOnent to perform a loOKup for each destInatION coMpoNEnt. FOr Example, the lookUp cAn BE Done explIcItly by using A supportInG LibraRy in eaCh compOnent at STArTUp, or juSt beForE sending tHe fIrST messagE tO a PArticuLar dEsTinatiOn. The lIBrarY MAy keep a table (e.g., a cAche) oF DEstinATioN nameS aNd their COrreSponding deStination adDresseS. The Table Can be
K-inhibitors, although the y have a c omple tel y d if fere nt s ubstitution pa t tern  from the compounds ac cordi ng to t h einven tion. M a ny s oft wa re  ap pl i ca tions  ar e physi cally or l ogi ca lly split in t oseparate c omp onents, or s erv ices,wh ich commu nic ate w ith ea c h othe r via anin t er-pro c ess com m u ni cati on (IPC) mechanis m .F or example, so me com po n en t s /se rvi ces of a s of tware applica t io n m aya ct as servercomponentst hat  provi de  de f ined s ervic es toother softw arecomponent s. Sof t ware co m ponents  thatuti liz e th e  s er vic es ofo th ers oft ware com po ne nts m ay b e r e ferr edto a s cli ent component s.In a n  IP C ser vice,  itis  usef ul for  oneco mponent to be a bleto send a  me ss age  t o ano t her co mpo nen t witho ut know i ngit s p hy sical location. Th at i s,  the sen ding c o mp on e nt shoul dbeable t o rea ch a de stinatio n comp o ne nt  usingan  addre ss  th atis no t  tie d to a  specifi c phy s ical location. In this manne r ,t h es endi ngcomponent d oesn ot h avet okee p  trac k ofan ad d ress that may chang ewhen t he de stination com ponent ism o v ed. This  fea t ur e  becomes incre asing ly importa n t in the  curr ently ev olving cl o u d basedinf ras tru ctu r e s. 
It is also u s e fulif  a send ing  compon ent  ca n r ely  o n a const ant sema nt ic  m ea nin g ofa n access  k eyth atcan b e  usedto re achapa r tic ular ty p eo f  ser vi ce . Fo r e xa mple,  iti s u seful f or a send ing comp on en t to be  aware that “ adestinatio ntha t is r e a chable w ith key X always provid e s servi ceY”. T hisway, thekey  can s afe l y be h ard-co ded i nt o t h e  send i n gcom po nent witho u t  ri sking  t hatit will  ever become obsol e te.  This type of  ke y is r ef err e dt o h er e ina s  a destinationname, or s im p ly  a name.
W h enaconstan t seman tic a c cess ke y is used , a looku pstep m ust  be perfor med in t he IPC sy s tem t o  o btain  aphysic al  ad dress  corre s pon dingto the  d estina tionna me. In t he lookup process, a de stinat ion n ame  is trans lat e d t o a locat ion- specific a ddr ess  that  ma y  be u sedd ur ing the s ubse q uent mess a ge  tr a n sm ission. The l o oku p pro ces s  can b e do ne in a number of ways.
For exam ple, a  lo oku p  can  b e performed in  th ed a ta trans mi ssion phase  each ti me a mes sage i s sent . In th i s  a p proach , aloo kup is do nefo r  each m es sa g e by t he t ra nsport  servi c e it s e lf. The sendingcompo n e nt us e s a  dest in ation n a me a s if it we re an addre ss. Th e ac tualaddress  o f thedes ti nation com p onent isresol ved byth e tr ans port m echa n i sm at  tra ns fer  time.
An o t he r  a pp r oac h is  forth e se nding com p onent to  pe r form alo oku p for ea c hd e stinationcom ponen t .  For examp l e, t h el ookup  can b e done  explic i tly  b y using  as u pportinglibrary i n  ea ch  com ponent a tstar tu p,or  just before se nding th e firstm e ssagetoa  par t icular  d estination.The l ib r ary may k eep  a tabl e  (e .g. , a  cac he)  ofd estination names and the ir c orres p ond ing d estin at ion addr e sses . The ta b le can be
K-inhibitors, although_they have_a completely different substitution_pattern from_the_compounds according_to_the invention. Many_software applications are_physically or logically split_into separate components,_or_services, which communicate with each other via an inter-process communication (IPC) mechanism. For example,_some_components/services of_a_software_application may act as server_components that provide defined services_to other_software components. Software components that utilize the services_of_other software components_may be referred to as client components.
In an IPC_service, it is useful for one_component to be_able_to_send a message to_another component without knowing its physical_location. That is, the sending component_should be able to reach a destination_component using an address that is_not tied to a specific_physical location._In this manner, the sending_component does not_have to_keep track of_an address that may change when_the destination component_is moved. This feature becomes increasingly_important_in the currently_evolving_cloud_based infrastructures.
It_is also useful_if_a sending_component_can rely on a constant semantic_meaning_of an access key that can be_used to reach a_particular_type of service. For_example, it is useful for_a sending component to be aware_that “a_destination that_is reachable with key X always provides service Y”. This way,_the key can safely be hard-coded_into the sending component_without risking_that_it will ever_become_obsolete. This_type of key is referred to herein_as a_destination name, or simply a name.
When_a constant semantic access_key_is used, a lookup step must_be performed in the IPC system_to obtain a physical address_corresponding_to_the destination name. In the_lookup process, a destination name is_translated to a_location-specific address that may be used during_the_subsequent message transmission. The lookup process_can_be done in a number of_ways.
For_example,_a lookup can be performed_in the data transmission phase each_time a message is sent. In this approach, a_lookup is done_for each message by the_transport_service_itself. The sending component uses a destination name as if_it were_an address. The_actual address of the destination component is resolved by the_transport mechanism at transfer time.
Another approach is_for the sending component to perform a lookup for each destination_component. For example, the lookup can be done_explicitly by using a supporting library in_each component at startup,_or_just before sending the first message to_a_particular_destination._The library may_keep a table_(e.g., a cache)_of destination_names and their_corresponding destination_addresses. The table_can_be