[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_f93d9206-cc36-4fd1-9cfc-009cb9618275":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:f93d9206-cc36-4fd1-9cfc-009cb9618275,\"}":22},{"code":4,"data":5,"meta":10},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":19,"manageAffiliations":20,"indexDatabases":21,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},"f93d9206-cc36-4fd1-9cfc-009cb9618275","2023-12-22T17:52:37.498+00:00","2023-12-25T00:49:05.868+00:00",[],null,{"issn":12,"title":14},{"VOID":13},"21619883",{"EN":15},"IEEE Transactions on Parallel and Distributed Systems","PUBLISHER","PENDING",2,[],[],[],{"meta":23,"data":25},{"total":24},"17",[26,100,151,200,259,325,406,482,545,609],{"id":27,"createTime":28,"updateTime":29,"relativeEntities":30,"slug":31,"properties":32,"entityType":43,"verifyStatus":44,"verifyTime":29,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"primaryUrl":46,"fullTextUrl":47,"authors":48,"publicationType":80,"publisherRelationship":81,"citationCount":10,"citationInfo":10,"publishDate":97,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"396b49d9-fa7e-4ad7-8d14-eb8c77319d3b","2023-12-22T17:53:09.264+00:00","2024-12-21T21:59:38.180+00:00",[],"Locating-mobile-agents-in-a-wide-distributed-environment",{"references":33,"keywords":35,"abstract":37,"title":39,"doi":41},{"VOID":34},"10.1109\u002F4434.708256\n10.1145\u002F336595.337344\nwooldridge, 1999, Multiagent Systems\n10.1109\u002F32.685259\n10.1109\u002FASAMA.1999.805398\n10.1109\u002F32.685258\n2002\n10.1109\u002F4236.832950\n10.1109\u002F4236.832949\n10.1109\u002FENABL.1998.725697\n10.1109\u002F98.475989\nchow, 1996, Distributed Operating Systems & Algorithms\nbaumann, 1996, MoleA Java Based Mobile Agent System, Proc ECOOP '96 Workshop Mobile Object Systems\ncoulouris, 1995, Distributed Systems Concepts and Design\nbaumann, 1999, A Comparision of Mechanisms for Locating Mobile Agents\ntanenbaum, 1991, Modern Operating Systems\n10.1088\u002F0967-1846\u002F5\u002F4\u002F007\nradicati, 1994, X 500 Directory Services Technology and Deployment\n10.1109\u002F49.391747\ncomer, 1991, Internetworking With TCP\u002FIP\n10.1016\u002F0169-7552(93)90013-T\n10.1109\u002F4434.749137\n10.1109\u002F35.592101\n10.1109\u002F35.649334\n10.1109\u002F35.387553\n10.1088\u002F0967-1846\u002F1\u002F2\u002F002\ngray, 1995, AgentTcl: A Transportable Agent System, Proc CIKM Workshop Intelligent Information Agents\nsu, 1982, The Domain Naming Convention for Internet User Applications, 10.17487\u002Frfc0819\n10.1145\u002F313451.313457\n10.1109\u002F69.940733\n10.1109\u002FINFCOM.2000.832251\nceri, 1985, Distributed Database Systems\n10.1007\u002F3-540-62803-7_26\n10.1145\u002F115992.116013\n2002\nsantoro, 1998, ARCA: A Framework for Mobile Agent ProgrammingWhite Paper and Programmer's Tutorial\ncrocker, 1982, Standard for the Format of ARPA Internet Text Messages, 10.17487\u002Frfc0822\ndi stefano, 1999, Naming and Locating Mobile Agents in an Internet Environment, Proceedings of the Third International Enterprise Distributed Object Computing Conference (EDOC '99), 10.1109\u002FEDOC.1999.792059\nmokapetris, 1987, Domain NamesConcepts and Facilities\njalote, 1994, Fault Tolerance in Distributed Systems\n1997, Software Agents\nlange, 1998, Programming Mobile Agents in Javawith the Java Aglet API\n10.1109\u002F4236.656077\n2002\n0, Mobile Agent System Interoperability Facilities Specification\n1997, The common object request broker architecture and specifications",{"EN":36},"Mobile agents,Protocols,Programming profession,Performance evaluation,Power system modeling,Scalability,Humans",{"EN":38},"Finding the position of a mobile agent in a wide distributed system still represents an open research issue. The paper proposes a naming scheme and a location protocol of general validity for mobile agents able to effectively meet all the typical requirements of mobile agent environments and, thus, easy to integrate into different platforms. The paper identifies the main characteristics which an agent naming scheme and a location protocol of general validity should have, and suggests some properties and parameters to be taken into account to evaluate the effectiveness of naming schemes and location protocols. Then, we propose a \"human readable\" agent naming scheme based on the distributed environment outlined in MASIF, and a suitable location finding protocol called the Search-By-Path-Chase. Both of them are compared with some of the solutions already provided, using the properties and the parameters suggested. The performances are finally evaluated by means of a set of measurements.",{"EN":40},"Locating mobile agents in a wide distributed environment",{"VOID":42},"10.1109\u002FTPDS.2002.1028440","PUBLICATION","VERIFIED","Auto Verify","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1028440\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1028440",[49,68],{"id":50,"sortIndex":51,"researcher":10,"roles":52,"affiliations":54,"properties":65},"f861787c-7f77-41eb-8c39-c244829e234b",1,[53],"AUTHOR",[55],{"id":10,"sortIndex":56,"affiliation":57,"properties":10},0,{"id":58,"createTime":59,"updateTime":59,"relativeEntities":60,"slug":10,"properties":61,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"d2ea0e0a-29fe-496c-b4cb-4d89f0634342","2023-12-22T17:53:09.275+00:00",[],{"title":62},{"VI":63},"Facoltà di Ingegneria, Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Università Catania, Catania, Italy","AFFILIATION",{"title":66},{"VI":67},"C. Santoro",{"id":69,"sortIndex":56,"researcher":10,"roles":70,"affiliations":71,"properties":77},"9f743fa8-6648-46a6-b087-c0626969da6d",[53],[72],{"id":10,"sortIndex":56,"affiliation":73,"properties":10},{"id":58,"createTime":59,"updateTime":59,"relativeEntities":74,"slug":10,"properties":75,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},[],{"title":76},{"VI":63},{"title":78},{"VI":79},"A. Di Stefano","ARTICLE",{"url":46,"publisher":82,"properties":90},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":83,"slug":10,"properties":84,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":87,"manageAffiliations":88,"indexDatabases":89,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":85,"title":86},{"VOID":13},{"EN":15},[],[],[],{"volume":91,"pages":93,"issue":95},{"VOID":92},"13",{"VOID":94},"844-864",{"VOID":96},"8","2002-08-01",2002,false,{"id":101,"createTime":102,"updateTime":103,"relativeEntities":104,"slug":105,"properties":106,"entityType":43,"verifyStatus":44,"verifyTime":103,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56,"primaryUrl":117,"fullTextUrl":118,"authors":119,"publicationType":80,"publisherRelationship":135,"citationCount":10,"citationInfo":10,"publishDate":150,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"6aa1c95e-1cff-4d98-9873-ff81a666845f","2023-12-25T00:47:39.508+00:00","2025-01-09T20:08:38.047+00:00",[],"Extended-dominating-set-based-routing-in-ad-hoc-wireless-networks-with-unidirectional-links",{"references":107,"keywords":109,"abstract":111,"title":113,"doi":115},{"VOID":108},"wu, 2002, On Locality of Dominating Set in Ad Hoc Networks with Switch-On\u002FOff Operations, Proc Int'l Symp Parallel Architetures Algorithms and Networks (I-SPAN '02), 85\n10.1145\u002F313451.313556\n10.1023\u002FA:1016783217662\n10.1137\u002F0211059\ntanenbaum, 1996, Computer Networks\n10.1016\u002F0031-3203(80)90066-7\nlin, 1996, Adaptive Clustering for Mobile Wireless Networks, IEEE J Selected Areas in Comm, 15, 1265, 10.1109\u002F49.622910\nsteenstrup, 1995, Routing in Comm Networks\n10.1023\u002FA:1016735301732\n10.1016\u002F0020-0190(94)00159-6\nhedrick, 1988, Routing Information Protocol, Internet Request for Comments (RFC) 1058\nhaas, 1997, The Zone Routing Protocol (ZRP) for Ad Hoc Networks, IETF Internet Draft\n10.1007\u002FPL00009201\n10.2307\u002F2412323\njacquet, 2000, Optimized Link State Routing Protocol (OLSR), IETF Internet Draft\n10.1109\u002FTCOM.1980.1094721\n10.1016\u002F0376-5075(77)90014-9\nmoy, 1991, \"OSPF \"\nshepard, 1996, A Channel Access Scheme for Large Dense Packet Radio Networks, Proc ACM Speical Interest Group on Comm (SIGCOMM) Conf Comm Architectures Protocols and Applications\nbertsekas, 1992, Data Networks\n10.1109\u002F98.760423\n10.1109\u002FTCOM.1981.1094909\namis, 2001, Max-Min -Cluster Formation in Wireless Ad Hoc Networks, Proc INFORCOM, 32\nsteenstrup, 2001, Cluster-Based Networks in Ad Hoc Networks\nsivakumar, 1998, An Improved Spine-Based Infrastructure for Routing in Ad Hoc Networks, Proc Int'l Symp Computers and Comm (ISCC '98)\n10.1109\u002FHICSS.2002.994519\n10.1109\u002FINFCOM.1997.631180\n10.1023\u002FA:1013985610753\npapadimitriou, 1988, Combinatorial Optimization Algorithms and Complexity\ndas, 1997, Routing in Ad Hoc Networks Using a Virtual Backbone, Proc Sixth Int'l Conf Computer Comm and Networks (IC3N '97), 1\n10.1145\u002F190809.190336\n10.1109\u002FWCNC.1999.796715\nperkins, 1997, Mobile IP Design Principles and Practices\nbroch, 1998, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks, IETF Internet Draft",{"EN":110},"Intelligent networks,Wireless networks,Routing protocols,Wireless sensor networks,Bandwidth,Network topology,Mobile radio mobility management,Base stations,Distributed computing,Military computing",{"EN":112},"We extend dominating-set-based routing to networks with unidirectional links. Specifically, an efficient localized algorithm for determining a dominating and absorbant set of vertices (mobile hosts) is given and this set can be easily updated when the network topology changes dynamically. A host \u002Fspl nu\u002F is called a dominating neighbor (absorbant neighbor) of another host u if there is a directed edge from \u002Fspl nu\u002F to u (from u to \u002Fspl nu\u002F). A subset of vertices is dominating and absorbant if every vertex not in the subset has one dominating neighbor and one absorbant neighbor in the subset. The derived dominating and absorbant set exhibits good locality properties; that is, the change of a node status (dominating\u002Fdominated) affects only the status of nodes in the neighborhood. The notion of dominating and absorbant set can also be applied iteratively on the dominating and absorbant set itself, forming a hierarchy of dominating and absorbant sets. The effectiveness of our approach is confirmed and the locality of node status update is verified through simulation.",{"EN":114},"Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links",{"VOID":116},"10.1109\u002FTPDS.2002.1036062","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1036062\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1036062",[120],{"id":121,"sortIndex":56,"researcher":10,"roles":122,"affiliations":123,"properties":132},"1dd35b76-44ef-4b5d-a4f7-b74abb177c99",[53],[124],{"id":10,"sortIndex":56,"affiliation":125,"properties":10},{"id":126,"createTime":127,"updateTime":127,"relativeEntities":128,"slug":10,"properties":129,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"b895b998-3e39-48d3-8105-9328e174cdb2","2023-12-23T18:02:16.848+00:00",[],{"title":130},{"VI":131},"Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL, USA",{"title":133},{"VI":134},"Jie Wu",{"url":117,"publisher":136,"properties":144},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":137,"slug":10,"properties":138,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":141,"manageAffiliations":142,"indexDatabases":143,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":139,"title":140},{"VOID":13},{"EN":15},[],[],[],{"volume":145,"pages":146,"issue":148},{"VOID":92},{"VOID":147},"866-881",{"VOID":149},"9","2002-09-01",{"id":152,"createTime":153,"updateTime":154,"relativeEntities":155,"slug":156,"properties":157,"entityType":43,"verifyStatus":44,"verifyTime":154,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":51,"primaryUrl":168,"fullTextUrl":169,"authors":170,"publicationType":80,"publisherRelationship":186,"citationCount":10,"citationInfo":10,"publishDate":150,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"6053c0ec-3984-4436-939a-22b95551349a","2023-12-25T00:49:00.849+00:00","2025-01-01T19:53:33.963+00:00",[],"An-efficient-parallel-algorithm-for-the-efficient-domination-problem-on-distance-hereditary-graphs",{"references":158,"keywords":160,"abstract":162,"title":164,"doi":166},{"VOID":159},"bange, 1978, Disjoint Dominating Sets in Trees, Sandia Laboratories Report\n10.1016\u002F0012-365X(94)00052-K\n10.1016\u002F0095-8956(73)90042-7\nbange, 1988, Efficient Dominating Sets in Graphs, Application of Discrete Math, 189\nbandelt, 1989, Distance-Hereditary Graphs, J Combinatorial Theory Series B, 41, 182, 10.1016\u002F0095-8956(86)90043-2\n10.1016\u002F0196-6774(89)90017-5\nchang, 1997, Dynamic Programming on Distance-Hereditary Graphs, Proc Seventh Int'l Symp Algorithms and Computation (ISAAC'97), 344\n10.1007\u002FBFb0045090\nyen, 1996, The Weighted Perfect Domination Problem and Its Variants, Discrete Applied Math, 66, 147, 10.1016\u002F0166-218X(94)00138-4\nesfahanian, 1993, Distance-Hereditary Graphs and Multidestination Message-Routing in Multicomputers, J Combinatorial Math and Combinatorial Computing, 13, 213\ngolumbic, 1980, Algorithmic Graph Theory and Perfect Graphs\nyen, 1992, Algorithmic Aspects of Perfect Domination\n10.1137\u002F0217032\n10.1016\u002FS0166-218X(98)00060-2\n10.1007\u002F3-540-58218-5_34\noellermann, 1994, Computing the Average Distance of a Distance-Hereditary Graph in Linear Time, Congressus Numerantium, 103, 219\n10.1016\u002F0196-6774(91)90012-N\n10.1016\u002F0196-6774(88)90007-7\n10.1016\u002F0166-218X(90)90131-U\nhe, 1986, Efficient Parallel Algorithms for Solving Some Tree Problems, Proc 24th Allerton Conf Communication Control and Computing, 777\n10.1093\u002Fqmath\u002F28.4.417\n10.1142\u002FS0129626499000074\n10.1007\u002F3-540-49164-3_40\n10.1006\u002Fjagm.1999.1064\n10.1007\u002F3-540-49381-6_28\n10.1016\u002FB978-0-444-88071-0.50022-9\nlivingston, 1990, Perfect Dominating Sets, Congressus Numerantium, 79, 187\n10.1016\u002F0166-218X(94)00067-3\nlu, 1996, Efficient Domination on Bipartite Graphs\n10.1016\u002F0020-0190(93)90100-N\n10.1002\u002F(SICI)1097-0037(199805)31:3\u003C177::AID-NET4>3.0.CO;2-C\nnicolai, 1994, Hamiltonian Problems on Distance-Hereditary Graphs\n10.1016\u002F0020-0190(93)90147-2",{"EN":161},"Parallel algorithms,Phase change random access memory,Binary trees,Tree graphs,Bipartite graph,Joining processes,Concurrent computing,Codes,Resource management,Parallel processing",{"EN":163},"In the literature, there are quite a few sequential and parallel algorithms for solving problems on distance-hereditary graphs. With an n-vertex and m-edge distance-hereditary graph G, we show that the efficient domination problem on G can be solved in O(log\u002Fsup 2\u002F n) time using O(n + m) processors on a CREW PRAM. Moreover, if a binary tree representation of G is given, the problem can be optimally solved in O(log n) time using O(n\u002Flog n) processors on an EREW PRAM.",{"EN":165},"An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs",{"VOID":167},"10.1109\u002FTPDS.2002.1036071","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1036071\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1036071",[171],{"id":172,"sortIndex":56,"researcher":10,"roles":173,"affiliations":174,"properties":183},"8fb082b9-474a-4f26-a8c6-3234c6f4a6c9",[53],[175],{"id":10,"sortIndex":56,"affiliation":176,"properties":10},{"id":177,"createTime":178,"updateTime":178,"relativeEntities":179,"slug":10,"properties":180,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"2c7f7db1-f4ff-49ef-8475-1ad8400351b3","2023-12-25T00:49:00.862+00:00",[],{"title":181},{"VI":182},"The Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",{"title":184},{"VI":185},"Sun-yuan Hsieh",{"url":168,"publisher":187,"properties":195},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":188,"slug":10,"properties":189,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":192,"manageAffiliations":193,"indexDatabases":194,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":190,"title":191},{"VOID":13},{"EN":15},[],[],[],{"volume":196,"pages":197,"issue":199},{"VOID":92},{"VOID":198},"985-993",{"VOID":149},{"id":201,"createTime":202,"updateTime":202,"relativeEntities":203,"slug":10,"properties":204,"entityType":43,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56,"primaryUrl":215,"fullTextUrl":216,"authors":217,"publicationType":80,"publisherRelationship":245,"citationCount":10,"citationInfo":10,"publishDate":97,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"a9561c18-b0f9-4b2b-be6e-8ebcc6722438","2023-12-22T17:53:04.828+00:00",[],{"references":205,"keywords":207,"abstract":209,"title":211,"doi":213},{"VOID":206},"shoenfielinger, 1995, WWW Meets Linda: Linda for Global WWW-Based Transaction Processing Systems, World Wide Web J\nlehman, 1999, Tspaces: The Next Wave, Hawaii Int'l Conf System Sciences\ncarriero, 1990, How to Write Parallel Programs A First Course\njeong, 1994, Plinda 2.0: A Transactional\u002FCheckpointing Approach to Fault Tolerant Linda\nsiegel, 1991, Implementing Distributed Linda in Standard ml\ngibaud, 1999, Linda Typ�: Une Extension du Mod�le Linda Pour Environnement Multiapplicatif. [Typed Linda: An Extension of the Linda Model for Multiapplicative Environment], Technique et Science Informatiques (TSI), 19, 43\nmatson, 1992, The C-Linda Language for Network of Workstations\n10.1016\u002FS1389-1286(00)00178-X\nminsky, 1995, Law-Governed Linda as a Coordination Model, Object-Based Models and Languages for Concurrent Systems, 125, 10.1007\u002F3-540-59450-7_8\n2000, Paradise User's Guide and Reference Manual\n2000, JavaSpaces Service Specification\nhupfer, 1990, Melinda: Linda with Multiple Tuple Spaces\ngelernter, 1989, Multiple Tuple Spaces in Linda, Proc Parallel Architectures and Languages Europe (PARLE '89), 366, 20, 10.1007\u002F3-540-51285-3_30\nleichter, 1993, Shared Memories, Buses, and LansLinda Implementations Across the Spectrum of Connectivity\nagha, 1993, Actorspaces: An Open Distributed Programming Paradigm, Proc Fourth ACM Conf Principles and Practice of Parallel Programming ACM SIGPLAN Notices, 28, 23\n10.1016\u002F0169-7552(96)00045-1\ngelernter, 1985, Parallel Programming in Linda, Proc Int'l Conf Parallel Programming, 255\ngibaud, 1996, Linda Typ� : Une Approche Plus S�re de la Programmation Distribu�e Avec Linda. [Typed Linda: A Safer Approach to Distributed Programming with Linda], Calculateurs Parall�les, 8, 365\nplotkin, 1981, A Structural Approach to Operational Semantics\n10.1109\u002F2.44903\npriami, 1996, Enhanced Operational Semantics for Concurrency\npinakis, 1993, Using Linda as the Basis of an Operating System Microkernel\nbakken, 1993, Supporting Fault Tolerant Parallel Programming in Linda\nciancarini, 1992, The Semantics of a Parallel Language Based on a Shared Data Space",{"EN":208},"Application software,Parallel programming,Associative memory,Concurrent computing,Distributed computing,Computer architecture,Parallel processing,Variable speed drives,Power system economics,Power generation economics",{"EN":210},"Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show that this model suffers from the false matching phenomenon. We explain under which conditions this problem occurs, we examine the solutions already proposed to solve it, and we show why they are not sufficient. In this framework, our goal is to propose an extension to the Linda model in order to eliminate the false matching phenomenon. This model-Linda with bound types or B-Linda-suitable for modern programming paradigms, adds an extended-type notion into the basic Linda model. It is first introduced in an informal manner, then we present an implementation of it. Some formal aspects are specified in the appendix: The definition of the model's elements and operational semantics.",{"EN":212},"Communications directed by bound types in Linda: presentation and formal model",{"VOID":214},"10.1109\u002FTPDS.2002.1028439","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1028439\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1028439",[218,233],{"id":219,"sortIndex":56,"researcher":10,"roles":220,"affiliations":221,"properties":230},"1d6cc3ba-cda0-41a2-b224-8ce49991d67e",[53],[222],{"id":10,"sortIndex":56,"affiliation":223,"properties":10},{"id":224,"createTime":225,"updateTime":225,"relativeEntities":226,"slug":10,"properties":227,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"ebd0c914-08af-4b65-a8b2-c7b1d28b0813","2023-12-22T17:53:04.848+00:00",[],{"title":228},{"VI":229},"Laboratory of Industrial and Human Mechanics and Automatic Control, Universite Valenciennes et du Hainaut-Cambrésis, France",{"title":231},{"VI":232},"A. Gibaud",{"id":234,"sortIndex":51,"researcher":10,"roles":235,"affiliations":236,"properties":242},"63b9019b-5100-41ba-9cf7-14f7c2aa4311",[53],[237],{"id":10,"sortIndex":56,"affiliation":238,"properties":10},{"id":224,"createTime":225,"updateTime":225,"relativeEntities":239,"slug":10,"properties":240,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},[],{"title":241},{"VI":229},{"title":243},{"VI":244},"P. Thomin",{"url":215,"publisher":246,"properties":254},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":247,"slug":10,"properties":248,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":251,"manageAffiliations":252,"indexDatabases":253,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":249,"title":250},{"VOID":13},{"EN":15},[],[],[],{"volume":255,"pages":256,"issue":258},{"VOID":92},{"VOID":257},"828-843",{"VOID":96},{"id":260,"createTime":261,"updateTime":262,"relativeEntities":263,"slug":264,"properties":265,"entityType":43,"verifyStatus":44,"verifyTime":262,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":51,"primaryUrl":276,"fullTextUrl":277,"authors":278,"publicationType":80,"publisherRelationship":311,"citationCount":10,"citationInfo":10,"publishDate":150,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"e95c12cb-c82c-471e-aabd-3934041ca3e9","2023-12-25T00:47:45.650+00:00","2025-02-09T16:26:46.816+00:00",[],"Adaptive-bandwidth-reservation-and-admission-control-in-QoS-sensitive-cellular-networks",{"references":266,"keywords":268,"abstract":270,"title":272,"doi":274},{"VOID":267},"10.1109\u002FICC.1999.765377\nhong, 1986, Traffic Model and Performance Analysis for Cellular Mobile Radio Telephone Systems with Prioritized and Nonprioritized Procedures, IEEE Trans Vehicular Technology, 35, 77, 10.1109\u002FT-VT.1986.24076\n10.1109\u002FVETEC.1996.503446\n2002\nfang, 1999, A New Mobility Model and Its Application in the Channel Holding Time Characterization in PCS Networks, Proc IEEE INFOCOM '99, 10.1109\u002FINFCOM.1999.749248\nchoi, 1997, Uplink CDMA Systems with Diverse QoS Guarantees for Heterogeneous Traffic, Proc ACM\u002FIEEE MobiCom '97, 120, 10.1145\u002F262116.262140\ncollins, 2001, 3G Wireless Networks\nlu, 1996, Adaptive Resource Management Algorithms for Indoor Mobile Computing Environments, Proc ACM SIGCOMM '96, 231\nluo, 1999, A Dynamic Pre-Reservation Scheme for Handoffs with GoS Guarantee in Mobile Networks, Proc IEEE Int'l Symp Computers and Comm\n10.1109\u002F49.490422\n10.1109\u002F25.775369\nzhao, 1997, Vehicle Location and Navigation Systems\n10.1109\u002FTCOMM.1994.580218\n10.1007\u002FBF01201054\n10.1109\u002F90.554717\nviterbi, 1995, CDMA Principles of Spread Spectrum Communication\n10.1109\u002FINFCOM.1997.631120\nahmadi, 1996, Design Issues in Wireless LANs, J High-Speed Networks, 5, 87, 10.3233\u002FJHS-1996-5107\npapoulis, 1991, Probability random variables and stochastic processes\n10.1109\u002F90.234856\nramjee, 1996, On Optimal Call Admission Control in Cellular Networks, Proc IEEE INFOCOM '96, 43, 10.1109\u002FINFCOM.1996.497876\n10.1109\u002FINFCOM.1997.631122",{"EN":269},"Programmable control,Adaptive control,Bandwidth,Admission control,Land mobile radio cellular systems,Quality of service,Maintenance,Aggregates,History,Navigation",{"EN":271},"How to keep the probability of hand-off drops within a prespecified limit is a very important quality-of-service (QoS) issue in cellular networks because mobile users should be able to maintain ongoing sessions even during their hand-off from one cell to another. We design and evaluate predictive and adaptive schemes for bandwidth reservation for the hand-offs of ongoing sessions and the admission control of new connections. We first develop a method to estimate user mobility based on an aggregate history of hand-offs observed in each cell. This method is then used to probabilistically predict mobiles' directions and hand-off times in a cell. For each cell, the bandwidth to be reserved for hand-offs is calculated by estimating the total sum of tractional bandwidths of the expected hand-offs within a mobility-estimation time window. Three different admission-control schemes for new connection requests using this bandwidth reservation are proposed. We also consider variations that utilize the path\u002Flocation information available from the car navigation system or global positioning system. Finally, we evaluate the performance of the proposed schemes extensively to show that they meet our design goal and outperform the static reservation scheme under various scenarios.",{"EN":273},"Adaptive bandwidth reservation and admission control in QoS-sensitive cellular networks",{"VOID":275},"10.1109\u002FTPDS.2002.1036063","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1036063\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1036063",[279,294],{"id":280,"sortIndex":51,"researcher":10,"roles":281,"affiliations":282,"properties":291},"1b82290f-cc45-4d87-8615-3eeb7670e5c1",[53],[283],{"id":10,"sortIndex":56,"affiliation":284,"properties":10},{"id":285,"createTime":286,"updateTime":286,"relativeEntities":287,"slug":10,"properties":288,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"d75a0c7d-3700-4b02-bb6a-391be34d331c","2023-12-25T00:47:45.674+00:00",[],{"title":289},{"VI":290},"Real-Time Computing Laboratory, EECS Department, University of Michigan, Ann Arbor, MI, USA",{"title":292},{"VI":293},"K.G. Shin",{"id":295,"sortIndex":56,"researcher":10,"roles":296,"affiliations":297,"properties":308},"c9172a4a-b841-4046-85f8-6472cf557e3e",[53],[298],{"id":10,"sortIndex":56,"affiliation":299,"properties":10},{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"08cc8856-1337-4c0a-b427-78f6a4ab81a5","2023-12-25T00:47:45.664+00:00","2025-06-11T21:46:32.488+00:00",[],"Philips-Research-Wireless-Communications-and-Networking-NY-USA",{"title":306},{"VI":307},"Philips Research, Wireless Communications and Networking, NY, USA",{"title":309},{"VI":310},"Sunghyun Choi",{"url":276,"publisher":312,"properties":320},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":313,"slug":10,"properties":314,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":317,"manageAffiliations":318,"indexDatabases":319,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":315,"title":316},{"VOID":13},{"EN":15},[],[],[],{"volume":321,"pages":322,"issue":324},{"VOID":92},{"VOID":323},"882-897",{"VOID":149},{"id":326,"createTime":327,"updateTime":328,"relativeEntities":329,"slug":330,"properties":331,"entityType":43,"verifyStatus":44,"verifyTime":328,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":51,"primaryUrl":342,"fullTextUrl":343,"authors":344,"publicationType":80,"publisherRelationship":392,"citationCount":10,"citationInfo":10,"publishDate":150,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"356d1585-44cf-4aee-9279-6e7bae51a0ca","2023-12-25T00:48:57.302+00:00","2024-12-30T16:17:37.897+00:00",[],"Scalable-stability-detection-using-logical-hypercube",{"references":332,"keywords":334,"abstract":336,"title":338,"doi":340},{"VOID":333},"10.1109\u002FISADS.1995.398975\n10.1145\u002F138873.138877\n2002\n10.1109\u002F90.532861\nbabaoglu, 1994, Relacs: A Communication Infrastructure for Constructing Reliable Applications in Large-Scale Distributed Systems\n10.1016\u002FS0166-218X(00)00386-3\nmanor, 1999, Scalable Multicast in a Logical Hypercube\n10.1145\u002F41457.37515\ncalvert, 2002\nmalloth, 1995, Phoenix: A Toolkit for Building Fault-Tolerant Distributed Application in Large Scale\n10.1109\u002FFTCS.1991.146672\nliebeherr, 1999, HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology, Proc First Int'l Workshop Networked Group Comm (NGC '99), 72\n10.1016\u002F0166-218X(94)90176-7\nleighton, 1992, Introduction to Parallel Algorithms and Architectures\n10.1109\u002F49.564138\n2001\n10.1145\u002F227210.227226\nmccanne, 2002\n10.1145\u002F258492.258523\n10.1007\u002F3-540-55599-4_84\n10.1145\u002F227210.227227\n10.1109\u002FDMCC.1991.633174\nguo, 1998, Scalable Message Stability Detection Protocols\n10.1109\u002F12.2234\nvan jacobson, 1995, A Reliable Multicast Framework for Light-Weight Sessions and Application Level Framing, Proc ACM SIGCOMM '95\ntanenbaum, 1996, Computer Networks third ed\n10.1145\u002F383059.383071\n10.1145\u002F227210.227229\n10.1145\u002F248156.248166\n10.1137\u002F0221026\nzhao, 2001, Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing\n10.1109\u002F12.4611\nguo, 1997, Hierarchical Message Stability Tracing Protocols\n10.1109\u002FINFCOM.2000.832256\njaja, 1992, An Introduction to Parallel Algorithms\nhayden, 1998, The Ensemble System",{"EN":335},"Stability,Hypercubes,Scalability,Network topology,Multicast protocols,Telecommunication network reliability,Middleware,Analytical models,Intersymbol interference,Communication standards",{"EN":337},"This paper proposes to use a logical hypercube structure for detecting message stability in distributed systems. In particular, a stability detection protocol that uses such a superimposed logical structure is presented, and its scalability is compared with other known stability detection protocols. The main benefits of the logical hypercube approach are scalability, fault-tolerance, and refraining from overloading a single node or link in the system. These benefits become evident both by an analytical comparison and by simulations. Another important feature of the logical hypercube approach is that the performance of the protocol is in general not sensitive to the topology of the underlying physical network.",{"EN":339},"Scalable stability detection using logical hypercube",{"VOID":341},"10.1109\u002FTPDS.2002.1036070","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1036070\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1036070",[345,362,377],{"id":346,"sortIndex":56,"researcher":10,"roles":347,"affiliations":348,"properties":359},"7127f7bf-6536-4ba0-9011-1e2875cc5e9e",[53],[349],{"id":10,"sortIndex":56,"affiliation":350,"properties":10},{"id":351,"createTime":352,"updateTime":353,"relativeEntities":354,"slug":355,"properties":356,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"e55d2528-140a-482b-ad28-17003adb3aa5","2024-01-16T07:59:08.577+00:00","2024-09-19T12:11:26.612+00:00",[],"Department-of-Computer-Science-Technion-Israel-Institute-of-Technology-Haifa-Israel",{"title":357},{"VI":358},"Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel",{"title":360},{"VI":361},"R. Friedman",{"id":363,"sortIndex":18,"researcher":10,"roles":364,"affiliations":365,"properties":374},"61b3a75f-17b4-46f4-8912-948e5c36164e",[53],[366],{"id":10,"sortIndex":56,"affiliation":367,"properties":10},{"id":368,"createTime":369,"updateTime":369,"relativeEntities":370,"slug":10,"properties":371,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"6586b3ca-9da6-44d4-a6ff-fc1a4c6fc3aa","2023-12-25T00:48:57.338+00:00",[],{"title":372},{"VI":373},"Bell Laboratories Networking Research Laboratories, Holmdel, NJ, USA",{"title":375},{"VI":376},"K. Guo",{"id":378,"sortIndex":51,"researcher":10,"roles":379,"affiliations":380,"properties":389},"3e68e772-a911-42f4-84e8-b6b0355b62aa",[53],[381],{"id":10,"sortIndex":56,"affiliation":382,"properties":10},{"id":383,"createTime":384,"updateTime":384,"relativeEntities":385,"slug":10,"properties":386,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"648b64b2-20b2-44ce-a819-62f895ce80de","2023-12-25T00:48:57.329+00:00",[],{"title":387},{"VI":388},"Intel, Inc., Haifa, Israel",{"title":390},{"VI":391},"S. Manor",{"url":342,"publisher":393,"properties":401},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":394,"slug":10,"properties":395,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":398,"manageAffiliations":399,"indexDatabases":400,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":396,"title":397},{"VOID":13},{"EN":15},[],[],[],{"volume":402,"pages":403,"issue":405},{"VOID":92},{"VOID":404},"972-984",{"VOID":149},{"id":407,"createTime":408,"updateTime":409,"relativeEntities":410,"slug":411,"properties":412,"entityType":43,"verifyStatus":44,"verifyTime":409,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":51,"primaryUrl":423,"fullTextUrl":424,"authors":425,"publicationType":80,"publisherRelationship":468,"citationCount":10,"citationInfo":10,"publishDate":150,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"d354b2b2-0d3e-4ec8-850f-1cdde9606c0d","2023-12-25T00:48:26.936+00:00","2024-12-08T15:20:28.273+00:00",[],"A-study-of-adaptive-forward-error-correction-for-wireless-collaborative-computing",{"references":413,"keywords":415,"abstract":417,"title":419,"doi":421},{"VOID":414},"liang, 1999, Java Native Interface Programmer's Guide and Specification\ntang, 2001, MX: A Tool for Emulation and Simulation of Distributed Applications and Protocols\no'hara, 1999, IEEE 802 11 Handbook A Designer's Companion\n10.1145\u002F263876.263881\n10.1145\u002F99508.99566\n10.1145\u002F320297.320318\n10.1007\u002F3-540-45518-3_6\n10.1145\u002F584017.584020\n10.1109\u002FSAINT.2001.905179\nfloyd, 1995, A Reliable Multicast Framework for Light-Weight Sessions and Applications Level Framing, Proc Sigcomm '95, 342\nkermode, 1998, Scoped Hybrid Automatic Repeat ReQuest with Forward Error Correction (SHARQFEC), Proc ACM Sigcomm, 10.1145\u002F285243.285289\ngemmell, 1998, A Scalable Multicast Architecture for One-to-Many Telepresentations, Proc IEEE Int'l Conf Multimedia Computing Systems, 128, 10.1109\u002FMMCS.1998.693632\n10.1109\u002FICDCS.1999.776533\narango, 2000, VGuide: Design and Performance Evaluation of a Synchronous Collaborative Virtual Reality Application, Proc IEEE Int'l Conf Multimedia and Expo, 10.1109\u002FICME.2000.869574\nkoifman, 1996, RAMP: A Reliable Adaptive Multicast Protocol, Proc IEEE InfoCom, 1442, 10.1109\u002FINFCOM.1996.493093\n10.1109\u002F49.564137\n10.1109\u002FMILCOM.2000.905017\n10.1109\u002FWCNC.2000.904675\n10.1109\u002FISCC.2000.860703\nhuitema, 1996, The Case for Packet Level FEC, Proc IFIP 5th Int'l Workshop Protocols for High-Speed Networks (PfHSN '96), 110\n10.1109\u002F90.720869\n10.1109\u002F90.650137\n10.1109\u002F90.650139\n10.1023\u002FA:1019163202314\n10.1109\u002F12.580423\n10.1109\u002FINFCOM.1999.751463\n10.1109\u002FWCNC.1999.796938",{"EN":416},"Forward error correction,Collaboration,Wireless LAN,Multicast protocols,Computer applications,Computer networks,Application software,Redundancy,Network servers,Software architecture",{"EN":418},"This paper addresses the problem of reliably multicasting Web resources across wireless local area networks (WLANs) in support of collaborative computing applications. An adaptive forward error correction (FEC) protocol is described, which adjusts the level of redundancy in the data stream in response to packet loss conditions. The proposed protocol is intended for use on a proxy server that supports mobile users on a WLAN. The software architecture of the proxy service and the operation of the adaptive FEC protocol are described. The performance of the protocol is evaluated using both experimentation on a mobile computing testbed as well as simulation. The results of the performance study show that the protocol can quickly accommodate worsening channel characteristics in order to reduce delay and increase throughput for reliable multicast channels.",{"EN":420},"A study of adaptive forward error correction for wireless collaborative computing",{"VOID":422},"10.1109\u002FTPDS.2002.1036067","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1036067\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1036067",[426,441,453],{"id":427,"sortIndex":56,"researcher":10,"roles":428,"affiliations":429,"properties":438},"785a4f2c-9ab6-49d6-a52e-77d5ddde6d7e",[53],[430],{"id":10,"sortIndex":56,"affiliation":431,"properties":10},{"id":432,"createTime":433,"updateTime":433,"relativeEntities":434,"slug":10,"properties":435,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"470cefca-8669-41dd-9431-26fe1e59e4ce","2023-12-25T00:48:27.277+00:00",[],{"title":436},{"VI":437},"The Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA",{"title":439},{"VI":440},"P.K. McKinley",{"id":442,"sortIndex":51,"researcher":10,"roles":443,"affiliations":444,"properties":450},"e64af305-8baf-477a-a370-48d707f07bf2",[53],[445],{"id":10,"sortIndex":56,"affiliation":446,"properties":10},{"id":432,"createTime":433,"updateTime":433,"relativeEntities":447,"slug":10,"properties":448,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},[],{"title":449},{"VI":437},{"title":451},{"VI":452},"Chiping Tang",{"id":454,"sortIndex":18,"researcher":10,"roles":455,"affiliations":456,"properties":465},"be543824-4362-43cd-b9e6-283c8dec93ff",[53],[457],{"id":10,"sortIndex":56,"affiliation":458,"properties":10},{"id":459,"createTime":460,"updateTime":460,"relativeEntities":461,"slug":10,"properties":462,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"2ce31cb4-d0cc-49e8-95ef-85d7775cfed0","2023-12-23T22:34:54.315+00:00",[],{"title":463},{"VI":464},"Lucent Technologies, Bell Laboratories Innovations, Holmdel, NJ, USA",{"title":466},{"VI":467},"A.P. Mani",{"url":423,"publisher":469,"properties":477},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":470,"slug":10,"properties":471,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":474,"manageAffiliations":475,"indexDatabases":476,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":472,"title":473},{"VOID":13},{"EN":15},[],[],[],{"volume":478,"pages":479,"issue":481},{"VOID":92},{"VOID":480},"936-947",{"VOID":149},{"id":483,"createTime":484,"updateTime":485,"relativeEntities":486,"slug":487,"properties":488,"entityType":43,"verifyStatus":44,"verifyTime":485,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56,"primaryUrl":499,"fullTextUrl":500,"authors":501,"publicationType":80,"publisherRelationship":531,"citationCount":10,"citationInfo":10,"publishDate":97,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"36f2d697-a2f8-4a1c-9d12-4b34334cafc8","2023-12-22T17:52:41.847+00:00","2025-01-17T15:10:42.869+00:00",[],"On-load-balancing-for-distributed-multiagent-computing",{"references":489,"keywords":491,"abstract":493,"title":495,"doi":497},{"VOID":490},"2002\n10.1109\u002F4434.708255\n10.1142\u002FS0218843096000051\n10.1007\u002F978-3-662-03678-5\n10.1145\u002F344588.344618\nljunberg, 1992, The OASIS Air Traffic Management System, Proc Second Pacific Rim Int'l Conf AI (PRICAI-92)\n10.1109\u002FDCS.1988.12509\n10.1109\u002F32.83908\nhuhns, 1994, Distributed Artificial Intelligence for Information Systems\nhwang, 1998, Scalable Parallel Computing Technology Architecture Programming\ngary, 1979, Computers and Intractability A Guide to the Theory of NP-Completeness\n10.1109\u002F2.920610\nsenator, 1995, The FinCEN Artificial Intelligence System: Identifying Potential Money Laundering from Reports of Large Cash Transactions, AI Magazine, 16, 21\n10.1145\u002F125826.126208\n10.1145\u002F367211.367268\n10.1109\u002F32.99188\npfister, 1998, In Search of Clusters\n2002\n10.1109\u002FMS.1984.234713\nshirazi, 1995, Scheduling and Load Balancing in Parallel and Distributed Systems\n10.1145\u002F367211.367251\n10.1109\u002F2.179115\nfranklin, 1996, Is it an Agent, or just a Program?: A Taxonomy for Autonomous Agents, Proc Third Int'l Workshop Agent Theories Architecture and Languages\nschaerf, 1995, Adaptive Load Balancing: A Study in Multi-Agent Learning, J Artificial Intelligence Research, 10.1613\u002Fjair.121\n10.1109\u002F32.4634\nbryant, 1981, A Stable Distributed Scheduling Algorithm, Proc Second Int'l Conf Distributed Computing Systems\n10.1109\u002FHICSS.1999.772634\nnuttall, 1997, Cluster Load Balancing using Process Migration\nni, 1985, a distributed drafting algorithm for load balancing, IEEE Transactions on Software Engineering, se 11, 1153, 10.1109\u002FTSE.1985.231863\n10.1145\u002F79173.79181\n10.1016\u002F0376-5075(84)90048-5\nxu, 1997, Load Balancing in Parallel Computers Theory and Practice\nwilliams, 1994, Dynamic Load Sharing within Workstation Clusters\nzhou, 1987, Performance Studies of Dynamic Load Balancing in Distributed Systems, 10.21236\u002FADA197130",{"EN":492},"Load management,Distributed computing,Multiagent systems,Workstations,Software agents,Computer networks,Humans,Measurement,Clustering algorithms,Software systems",{"EN":494},"Multiagent computing on a cluster of workstations is widely envisioned to be a powerful paradigm for building useful distributed applications. The agents of the system span across all the machines of a cluster. Just like the case of traditional distributed systems, load balancing becomes an area of concern. With different characteristics between ordinary processes and agents, it is both interesting and useful to investigate whether conventional load-balancing strategies are also applicable and sufficient to cope with the newly emerging needs, such as coping with temporally continuous agents, devising a performance metric for multiagent systems, and taking into account the vast amount of communication and interaction among agent. This paper discusses the above issues with reference to agent properties and load balancing techniques and outlines the space of load-balancing design choices in the arena of multiagent computing. In view of the special agent characteristics, a novel communication-based load-balancing algorithm is proposed, implemented, and evaluated. The proposed algorithm works by associating a credit value with each agent. The credit of an agent depends on its affinity to a machine, its current workload, its communication behavior, and mobility, etc. When a load imbalance occurs, the credits of all agents are examined and an agent with a lower credit value is migrated to relatively lightly loaded machine in the system. Quasi-simulated experiments of this algorithm show load-balancing improvement compared with conventional workload-oriented load-balancing schemes.",{"EN":496},"On load balancing for distributed multiagent computing",{"VOID":498},"10.1109\u002FTPDS.2002.1028436","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1028436\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1028436",[502,519],{"id":503,"sortIndex":56,"researcher":10,"roles":504,"affiliations":505,"properties":516},"9ac3a4af-05be-4837-93b9-0e7b3e094e17",[53],[506],{"id":10,"sortIndex":56,"affiliation":507,"properties":10},{"id":508,"createTime":509,"updateTime":510,"relativeEntities":511,"slug":512,"properties":513,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"21f53f36-af44-4afb-803c-59ec7c4163c7","2023-12-11T12:10:32.937+00:00","2024-12-30T11:12:24.487+00:00",[],"Department-of-Electrical-and-Electronic-Engineering-University-of-Hong-Kong-Hong-Kong-China",{"title":514},{"VI":515},"Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong, China",{"title":517},{"VI":518},"Ka-Po Chow",{"id":520,"sortIndex":51,"researcher":10,"roles":521,"affiliations":522,"properties":528},"f6dd6275-6181-47ce-96ef-318c0799675a",[53],[523],{"id":10,"sortIndex":56,"affiliation":524,"properties":10},{"id":508,"createTime":509,"updateTime":510,"relativeEntities":525,"slug":512,"properties":526,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},[],{"title":527},{"VI":515},{"title":529},{"VI":530},"Yu-Kwong Kwok",{"url":499,"publisher":532,"properties":540},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":533,"slug":10,"properties":534,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":537,"manageAffiliations":538,"indexDatabases":539,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":535,"title":536},{"VOID":13},{"EN":15},[],[],[],{"volume":541,"pages":542,"issue":544},{"VOID":92},{"VOID":543},"787-801",{"VOID":96},{"id":546,"createTime":547,"updateTime":548,"relativeEntities":549,"slug":550,"properties":551,"entityType":43,"verifyStatus":44,"verifyTime":548,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56,"primaryUrl":562,"fullTextUrl":563,"authors":564,"publicationType":80,"publisherRelationship":595,"citationCount":10,"citationInfo":10,"publishDate":97,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"b2b31be9-b87b-4334-8598-109c14fba2c6","2023-12-22T17:52:51.728+00:00","2024-12-09T12:14:35.428+00:00",[],"Learning-to-classify-parallel-input-output-access-patterns",{"references":552,"keywords":554,"abstract":556,"title":558,"doi":560},{"VOID":553},"lei, 1997, An Analytical Approach to File Prefetching, Proc USENIX 1997 Ann Technical Conf, 275288\n10.1007\u002FBF01113694\n10.1016\u002F0009-2614(95)00655-N\nkroeger, 1996, Predicting File-System Actions from Prior Events, Proc Usenix 1996 Ann Technical Conf, 319328\n10.1007\u002FBF01277519\n10.1109\u002F5.18626\n10.1109\u002FICDCS.1990.89275\nkleinrock, 1975, Queueing Systems, 1\n10.1145\u002F258612.258680\n10.1109\u002FHPDC.1996.546173\n1991, Paragon XP\u002FS Product Overview\n10.1145\u002F224538.224638\n10.1016\u002F0004-3702(89)90049-0\nmadhyastha, 1992, Porsonify: A Portable System for Data Sonification\n10.1006\u002Fjcph.1995.1208\npalmer, 1991, Fido: A Cache that Learns to Fetch, Proc Int Conf On Very Large Data Bases, 255262\nhenderson, 1994, Unstructured Spectral Element Methods: Parallel Algorithms and Simulations\n10.1145\u002F224056.224064\n10.1109\u002FPDIS.1991.183096\npool, 1996, Scalable I\u002FO Initiative\ngriffioen, 1994, Reducing File System Latency Using a Predictive Approach, Proc USENIX Summer Technical Conf, 197207\ncrandall, 1995, Characterization of a Suite of Input\u002FOutput Intensive Applications, Proc Supercomputing '95\ncharniak, 1993, Statistical Language Learning",{"EN":555},"File systems,Pattern classification,Hidden Markov models,Pattern matching,Adaptive systems,Neural networks,Feedforward neural networks,Pattern recognition,Interleaved codes",{"EN":557},"Input\u002Foutput performance on current parallel file systems is sensitive to a good match of application access patterns to file system capabilities. Automatic input\u002Foutput access pattern classification can determine application access patterns at execution time, guiding adaptive file system policies. In this paper, we examine and compare two novel input\u002Foutput access pattern classification methods based on learning algorithms. The first approach uses a feedforward neural network previously trained on access pattern benchmarks to generate qualitative classifications. The second approach uses hidden Markov models trained on access patterns from previous executions to create a probabilistic model of input\u002Foutput accesses. In a parallel application, access patterns can be recognized at the level of each local thread or as the global interleaving of all application threads. Classification of patterns at both levels is important for parallel file system performance; we propose a method for forming global classifications from local classifications. We present results from parallel and sequential benchmarks and applications that demonstrate the viability of this approach.",{"EN":559},"Learning to classify parallel input\u002Foutput access patterns",{"VOID":561},"10.1109\u002FTPDS.2002.1028437","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1028437\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1028437",[565,580],{"id":566,"sortIndex":56,"researcher":10,"roles":567,"affiliations":568,"properties":577},"3c0f37a4-0203-4718-b7a7-c825c5cbe853",[53],[569],{"id":10,"sortIndex":56,"affiliation":570,"properties":10},{"id":571,"createTime":572,"updateTime":572,"relativeEntities":573,"slug":10,"properties":574,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"6730a220-39f2-475b-8d1a-1b526e02cfa8","2024-01-28T09:37:42.958+00:00",[],{"title":575},{"VI":576},"Department of Computer Engineering, University of California, Santa Cruz, CA, USA",{"title":578},{"VI":579},"T.M. Madhyastha",{"id":581,"sortIndex":51,"researcher":10,"roles":582,"affiliations":583,"properties":592},"ac1eea42-b70a-46b3-af4d-5dc2eb3f7a9a",[53],[584],{"id":10,"sortIndex":56,"affiliation":585,"properties":10},{"id":586,"createTime":587,"updateTime":587,"relativeEntities":588,"slug":10,"properties":589,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"a2326225-e923-4da9-b160-4c50b496a3a3","2023-12-22T17:52:51.752+00:00",[],{"title":590},{"VI":591},"Department of Computer science, University of Illinois, Urbana, IL, USA",{"title":593},{"VI":594},"D.A. Reed",{"url":562,"publisher":596,"properties":604},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":597,"slug":10,"properties":598,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":601,"manageAffiliations":602,"indexDatabases":603,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":599,"title":600},{"VOID":13},{"EN":15},[],[],[],{"volume":605,"pages":606,"issue":608},{"VOID":92},{"VOID":607},"802-813",{"VOID":96},{"id":610,"createTime":611,"updateTime":612,"relativeEntities":613,"slug":614,"properties":615,"entityType":43,"verifyStatus":44,"verifyTime":612,"verifyNote":45,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56,"primaryUrl":626,"fullTextUrl":627,"authors":628,"publicationType":80,"publisherRelationship":657,"citationCount":10,"citationInfo":10,"publishDate":97,"publishYear":98,"citationAnalyzeStatus":17,"lastCitationAnalyze":10,"indexDatabases":10,"openAccess":10,"references":10,"isForceReanalyzing":99},"84c822c4-bc77-4316-a441-0017792edb24","2023-12-22T17:52:37.494+00:00","2025-01-29T12:11:11.498+00:00",[],"On-the-asymptotical-optimality-of-multilayered-decentralized-consensus-protocol",{"references":616,"keywords":618,"abstract":620,"title":622,"doi":624},{"VOID":617},"lin, 2000, An Asymptotically Optimal Multi-Layered Decentralized Consensus Protocol with an Initiator, Proc 20th IEEE Int'l Conf Distributed Computing Systems, 280\n10.1109\u002F71.282556\n10.1109\u002FTSE.1986.6312956\n10.1109\u002F12.29465\n10.1109\u002FTC.1984.1676437\n10.1109\u002FRELDIS.1998.740510\n10.1109\u002F2.73\n10.1002\u002Fnet.3230180406\nchen, 1993, Decentralized Consensus Protocols with Multi-Port Communication, Proc 13th Int'l Conf Distributed Computing Systems\n10.1109\u002FICDCS.1992.235012\n10.1109\u002F71.494631\n10.1145\u002F226643.226647\nhadzilacos, 1990, Message-Optimal Protocols for Byzantine Agreement\n10.1109\u002F71.569655\n10.1145\u002F5505.5508\n10.1109\u002FISPAN.1997.645083\nvenkataraman, 1986, Simultaneous Broadcasting in Multiprocessor Networks, Proc Int'l Conf Parallel Processing, 555\n10.1109\u002FDCS.1988.12522",{"EN":619},"Protocols,Performance analysis,Distributed computing,Message passing,Distributed processing,Availability,Costs,Clocks,Synchronization,Broadcasting",{"EN":621},"A decentralized consensus protocol refers to a process for all nodes in a distributed system to collect the information\u002Fstatus from every other node and reach a consensus among them. Two classes of decentralized consensus protocols have been studied before: the one without an initiator and the one with an initiator. While the one without an initiator has been well studied in the literature, it is noted that the prior protocols with an initiator mainly relied upon the one without an initiator and thus did not fully exploit the intrinsic properties of having an initiator. By exploiting the concept of multilayered execution, we develop in this paper an efficient multilayered decentralized consensus protocol for a distributed system with an initiator. By adapting itself to the number of nodes in the system, the proposed protocol can determine a proper layer for execution and reach the consensus in the minimal numbers of message steps while incurring a much smaller number of messages than required by prior works. Several illustrative examples are given and performance analysis of the proposed algorithm is conducted to provide many insights into the problem studied. It is shown that the decentralized consensus protocols developed in this paper for the case of having an initiator significantly outperform prior schemes. Specifically, it is proven that (1) the ratio of the average number of messages incurred by the proposed algorithm to that by the prior method approaches zero as the number of nodes increases and (2) the proposed algorithm is asymptotically optimal in the sense that the message number required by the proposed algorithm and that of the optimal one are asymptotically of the same complexity with respect to the number of nodes in the system, showing the very important advantage of the proposed algorithm.",{"EN":623},"On the asymptotical optimality of multilayered decentralized consensus protocol",{"VOID":625},"10.1109\u002FTPDS.2002.1028435","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1028435\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1028435",[629,645],{"id":630,"sortIndex":51,"researcher":10,"roles":631,"affiliations":632,"properties":642},"23c6bc34-6cc8-47f6-9874-0fdeaa0244aa",[53],[633],{"id":10,"sortIndex":56,"affiliation":634,"properties":10},{"id":635,"createTime":636,"updateTime":636,"relativeEntities":637,"slug":638,"properties":639,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},"e2d40322-2457-4a6a-9c55-7714fe148070","2024-04-14T11:10:17.398+00:00",[],"Electrical-Engineering-Department-National-Taiwan-University-Taipei-Taiwan",{"title":640},{"EN":641},"Electrical Engineering Department, National Taiwan University, Taipei, Taiwan",{"title":643},{"VI":644},"Ming-Syan Chen",{"id":646,"sortIndex":56,"researcher":10,"roles":647,"affiliations":648,"properties":654},"27c40cac-27ad-455d-b9c4-d4e97b3e4c81",[53],[649],{"id":10,"sortIndex":56,"affiliation":650,"properties":10},{"id":635,"createTime":636,"updateTime":636,"relativeEntities":651,"slug":638,"properties":652,"entityType":64,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":56},[],{"title":653},{"EN":641},{"title":655},{"VI":656},"Cheng-Ru Lin",{"url":626,"publisher":658,"properties":666},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":659,"slug":10,"properties":660,"entityType":16,"verifyStatus":17,"verifyTime":10,"verifyNote":10,"syncStatus":17,"languages":10,"translateLanguages":10,"viewCount":18,"subjectFields":663,"manageAffiliations":664,"indexDatabases":665,"url":10,"thumbnailPath":10,"statistic":10,"gsStatistic":10,"type":10,"analyzePriority":10},[],{"issn":661,"title":662},{"VOID":13},{"EN":15},[],[],[],{"volume":667,"pages":668,"issue":670},{"VOID":92},{"VOID":669},"769-786",{"VOID":96}]