{"title":"Channel assignment on strongly-simplicial graphs","authors":"A. Bertossi, M. C. Pinotti, Romeo Rizzi","doi":"10.1109/IPDPS.2003.1213408","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213408","url":null,"abstract":"Given a vector (/spl delta//sub 1/, /spl delta/2,..., /spl delta//sub t/) of non increasing positive integers, and an undirected graph G = (V, E), an L(/spl delta//sub 1/, /spl delta/2,..., /spl delta//sub t/)-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that |f(u) - f (v)| /spl ges/ /spl delta//sub i/, if d(u, v) = i, 1 /spl les/ i /spl les/ t, where d(u,v) is the distance (i.e. the minimum number of edges) between the vertices u and v. This paper presents efficient algorithms for finding optimal L(1,..., 1)-colorings of trees and interval graphs. Moreover, efficient algorithms are also provided for finding approximate L(/spl delta//sub 1/, 1,..., 1)-colorings of trees and interval graphs, as well as approximate L(/spl delta//sub 1/, /spl delta//sub 2/) colorings of unit interval graphs.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122286609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximate search engine optimization for directory service","authors":"Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee","doi":"10.1109/IPDPS.2003.1213439","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213439","url":null,"abstract":"Today, in many practical e-commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short strings is not the same as searching within longer strings. General search engines try their best to scan all long strings (or articles) quickly, and find out the places that match the search conditions. Some great online search algorithms (such as \"agrep\" as used inside glimpse, or \"cgrep \" as used inside compressed indices, or 'NR-grep') are proposed for searching without any indices in the sub-linear time O(n). However, for short strings (n is small), the practical performance of algorithms of O(n) and O(n) are much the same. Therefore, suitable indices are necessary to optimize the performance of the search engine. On the other hand, directory services are more and more important because of its optimization for searching data. The data stored in directory servers are almost short strings. The approximate search engine for directory service must take the properties of short strings into considerations. In our previous research, we have designed one approximate search engine especially for short strings by using filters to filter out the possible short strings, and then checking for the answers. However the performance of the previous search engine needs to be enhanced. In this paper, we propose new architecture and algorithm to optimize the performance of searching for directory service.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125714424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive fault tolerant systems: reflective design and validation","authors":"M. Killijian, J. Fabre","doi":"10.1109/IPDPS.2003.1213387","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213387","url":null,"abstract":"Reflection has been used with some success, since quite a few years now, for dealing with separation of concerns and transparency of fault-tolerance mechanisms for the application. Nevertheless, it has also shown some concern regarding the control of fine-grain information such as thread control or other deep aspects of the platform. We propose here the use of a new concept, called multi-level reflection, for firstly solving these issues, but also for introducing more adaptation into fault-tolerant reflective architectures. We also discuss some essential validation issues of reflective systems, which are still a challenge for future research.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121131616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Specification of a gas station using a formalism integrating formal datatypes within state diagrams","authors":"C. Attiogbe, Gwen Salaün, P. Poizat","doi":"10.1109/IPDPS.2003.1213436","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213436","url":null,"abstract":"In this paper, we propose a generic approach for integrating data types expressed using formal specification languages within state diagrams. Our main motivations are (i) to be able to model dynamic aspects of complex systems with graphical user-friendly languages, and (ii) to be able to specify in a formal way and at a high abstraction level the data types pertaining to the static aspects of such systems. The dynamic aspects may be expressed using state diagrams (such as UML or SDL) and the static aspects may be expressed using either algebraic specifications or state oriented specifications (such as Z or B). Our approach introduces a flexible use of data types. It also may take into account different semantics for the state diagrams. We herein focus on a case study to demonstrate the pragmatism of our approach.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"558 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116241580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. E. Gómez, J. Flich, A. Robles, P. López, J. Duato
{"title":"VOQ/sub SW/: a methodology to reduce HOL blocking in InfiniBand networks","authors":"M. E. Gómez, J. Flich, A. Robles, P. López, J. Duato","doi":"10.1109/IPDPS.2003.1213134","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213134","url":null,"abstract":"InfiniBand is a new switch-based standard interconnect for communication between processor nodes and I/O devices as well as for interprocessor communication. InfiniBand architecture allows switches to support up to 15 virtual lanes per port for data traffic. To route packets through a given virtual lane (VL), packets are labeled with a certain service level (SL) at injection time, and SLtoVL mapping tables are used at each switch to determine the VL to be used. Many previous works in the literature have shown that separate virtual lanes are able to reduce the influence of the well-known head-of-line (HOL) blocking effect on network performance. However, using virtual lanes to form separate virtual networks is not enough to eliminate the HOL blocking problem. Alternative solutions such as Virtual Output Queuing (VOQ) are able to eliminate it at the expense of modifying the switch buffer organization. In this paper, we propose an effective strategy to implement the VOQ scheme in IBA switches by using virtual lanes. This strategy does not require to modify the switch architecture, simply SL to VL tables must be properly filled. Evaluation results show that our proposed VOQ scheme is able to outperform the results obtained with the virtual network approach using the same number of resources. Moreover, the methodology proposed to implement the VOQ scheme in IBA only requires a small number of resources in order to significantly improve network throughput.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116536514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrating safety analysis into formal specification of dependable systems","authors":"E. Troubitsyna","doi":"10.1109/IPDPS.2003.1213394","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213394","url":null,"abstract":"This paper presents and validates a novel approach to a formal specification of software for dependable systems. The approach incorporates results of statecharts and failure mode and effect analysis (FMEA) in the development of formal specifications of fail-safe systems. We use the action system formalism as our specification framework. Within the framework we define a general model of a safety-critical fail-safe system. Statecharts facilitate construction of a formal specification by structuring informal functional requirements and formalizing safety requirements resulted from FMEA. The approach is validated by a case study - a derivation of formal specification of a conveyor system.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123827706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Web services - control meets collaboration","authors":"Cristina Buchholz","doi":"10.1109/IPDPS.2003.1213194","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213194","url":null,"abstract":"In the context of open processes spanning across company boundaries, secure data access is a central aspect of doing business. Identity Management claims the top position among the tools that close the security gap. Driven by the use cases legal provability, digital rights management and process audit, we have designed an identity management system based on the trust management model.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124949337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Borra, A. Muthukaruppan, S. Suresh, V. Kamakoti
{"title":"A parallel genetic approach to the placement problem for field programmable gate arrays","authors":"S. Borra, A. Muthukaruppan, S. Suresh, V. Kamakoti","doi":"10.1109/IPDPS.2003.1213340","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213340","url":null,"abstract":"This paper introduces the concept of \"parallel genetic algorithms\", to provide a solution for the placement problem for field programmable gate arrays, that complements routing to enhance the performance of the circuit implemented by the field programmable gate array. We propose to utilize the concept of parallelism to genetic algorithms to transform a set of initial populations of random placements to a final set of populations that contain solutions approximating the optimal one. The fundamental concept of this paper lies in sharing the good solutions among different processes, which may help the genetic algorithm to evolve its population in a more lucrative manner. In conjunction with the migration phase, we employ various genetic operators and the chosen fitness function, to expedite the transformation of the initial population towards the optimal solution. We have simulated the suggested method on a 64-node SGI Origin-2000 platform and the results are extremely encouraging, even for circuits with very large number of nets.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125303600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Parallel cellular programming for developing massively parallel emergent systems","authors":"D. Talia","doi":"10.1109/IPDPS.2003.1213478","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213478","url":null,"abstract":"In an emergent system higher level properties cannot be deduced to its simpler constitutes or its origins. The global behavior of an emergent system emerges from the single elements evolution and interaction. Emergent phenomena and systems need to be programmed by using paradigms that allow for expressing the behavior and interaction of a very large number of single simple elements. The cellular automata model is a nature inspired parallel computational model that can be used for modeling and simulation of emergent phenomena and systems. Because of their inherent parallelism, cellular automata can be used to model large scale emergent systems on parallel computers. The use of parallel cellular languages and environments can provide useful tools for the development of massively parallel emergent systems. This paper describes the cellular automata approach for developing large scale scalable emergent systems and discusses practical parallel cellular automata tools for programming emergence. Examples of emergent systems programmed in CARPET are discussed and their performance is evaluated on a Linux cluster.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125218255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integration of a CAN-based connection-oriented communication model into Real-Time CORBA","authors":"Stefan Lankes, A. Jabs, T. Bemmerl","doi":"10.1109/IPDPS.2003.1213239","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213239","url":null,"abstract":"The Real-Time CORBA and minimumCORBA specifications are important steps towards defining standard-based middleware which can satisfy real-time requirements in an embedded system. These requirements can only be fulfilled if the middleware utilizes the features of a real-time network. The controller area network (CAN) is one of the most important networks in the field of real-time embedded systems. Consequently, this paper presents a CAN-based connection-oriented point-to-point communication model and its integration into Real-Time CORBA. In order to make efficient use of the advantages of CAN, we present an inter-ORB protocol, which uses smaller message headers for CAN and maps the CAN priorities to a band of CORBA priorities. We also present design and implementation details with some preliminary performance results.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132776131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}