{"title":"The global fault-tolerance of interconnection networks","authors":"Hovhannes A. Harutyunyan, C. D. Morosan","doi":"10.1109/SNPD-SAWN.2006.70","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.70","url":null,"abstract":"In this paper, we introduce a new concept in fault-tolerance, namely the global fault-tolerance of interconnection networks. We pose the problem of characterizing the fault-tolerance of an interconnection network, modelled as an undirected unweighted graph, by a scalar, in a global manner. This can be achieved by defining an adequate metric. In this paper, we propose such a metric and we apply it on two comparative analysis: for three infinite families of minimum broadcast graphs (hypercubes, recursive circulants, and Knodel graphs), and for five families of hypercubic graphs (butterfly, wrapped butterfly, shuffle exchange, de Bruijn, and cube connected cycles)","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127341660","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":"Using Tools in Teaching University Courses in Information Technology","authors":"Yulia Nemchinova, H. Sayani","doi":"10.1109/SNPD-SAWN.2006.76","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.76","url":null,"abstract":"Information technology professionals are expected to have working knowledge and skills as today's college graduates. While building a solid theoretical foundation in computer science or related disciplines is a must, the ability to use related tools is becoming critical as well. In software development, various software tools are routinely used in system design and development. While applied knowledge is highly desirable for information technology graduates, teaching software development while incorporating tools in the learning process is currently very uncommon, and existing educational practices discourage bringing tools into academia. We believe that establishing a framework at the university for implementing tools for teaching will help students understand the role of tools and strengthen their fundamental knowledge","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123577032","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":"New Generalized Cellular Automata to a Class of Optimization Problems","authors":"D. Shuai, Liangjun Huang, Qing Shuai","doi":"10.1109/SNPD-SAWN.2006.53","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.53","url":null,"abstract":"This paper presents a new generalized cellular automata (GCA) approach to effectively solve a class of optimization problems subject to a binary constraint matrix. In contrast to the Hopfield-type neural network (HNN) and cellular neural network (CNN), the proposed GCA approach has the pyramid architecture and evolutionary dynamics related to multi-granularity macro-cells. This paper discusses the GCA's dynamics, algorithm and properties. The simulations on the travelling salesman problems (TSP) and the fast packet switching problems (FPSP) show that the GCA approach has advantages over the HNN and CNN methods in terms of the solution quality, optimal ratio, convergence speed, real-time performance, interconnection complexity, and parameter selection","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127695121","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":"Minimizing Multicast Communication Latency in WAN-Based Environment","authors":"K. Silawarawet, N. Nupairoj","doi":"10.1109/SNPD-SAWN.2006.50","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.50","url":null,"abstract":"The critical problem for multicasting is to find optimal multicast tree. Most popular multicast algorithms over WAN are usually based on either Dijkstra's shortest path tree or Steiner tree, which assume that sender can send a message to the next destination node right away. This can lead to a non-optimal multicast tree as it ignores gap parameter in LogP model. From our preliminary study, we found that gap is very significant especially in WAN. In this paper, we take gap into consideration and propose a minimization technique, which apply gap parameters to Dijkstra's shortest path algorithm to construct minimized shortest path trees. We compare the multicast latency of normal Dijkstra's shortest path multicast tree and our minimized multicast tree with simulation. The results show that multicast tree based on our proposed algorithm can clearly out-perform the multicast tree based on Dijkstra's algorithm. Our results further indicate that our proposed algorithm can perform very well when message size is large with lots of nodes","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126515847","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":"Applying Dynamic Change Impact Analysis in Component-based Architecture Design","authors":"Tie Feng, Jonathan I. Maletic","doi":"10.1109/SNPD-SAWN.2006.21","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.21","url":null,"abstract":"Change impact analysis plays an important role in maintenance and evolution of component-based software architecture. Viewing component replacement as a change to composition-based software architecture, this paper proposes a component interaction trace based approach to support dynamic change impact analysis at software architecture level. Given an architectural change, our approach determines the architecture elements causing the change and impacted by the change. Firstly, component-based software architecture and component interaction trace are defined. An algorithm for generating component interaction trace from static structure model of software architecture and UML sequence diagram is provided. Secondly, the taxonomy of changes on composition-based software architecture is presented, according to which a set of impact rules are suggested to determine the transfer of the changes in component and among components. Thirdly, by performing slicing on component interaction traces according to impact rules, the impact analysis results are obtained. Finally, the architecture design of SOCIAT, a tool supporting our approach, is developed and explained","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131779953","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":"Routing Problems in Incomplete Pancake Graphs","authors":"K. Kaneko","doi":"10.1109/SNPD-SAWN.2006.61","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.61","url":null,"abstract":"A pancake graph was proposed as a topology for interconnection networks of parallel computers, and it has a merit that it can connect many nodes with small diameter and small degree. However, the number of nodes in a pancake graph must be equal to the factorial of an integer, which causes a demerit that it lacks incremental expandability. Hence, in this paper, we propose a graph, an incomplete pancake graph, that is obtained by deleting some of sub graphs of a pancake graph, and we give algorithms for the problems of the simple routing, the Hamiltonian cycle, the Hamiltonian path, and the container in incomplete pancake graphs","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122088028","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":"Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions","authors":"P. Diaz-Gomez, Dean Frederick Hougen","doi":"10.1109/SNPD-SAWN.2006.41","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.41","url":null,"abstract":"Hunting for snakes of maximum length in hypercubes has been addressed with non-heuristic methods for hypercubes of dimension less than eight. Above that dimension the problem is intractable because the search grows exponentially with the dimension, which make it an NP-hard problem. Heuristic methods, like genetic algorithms, have been used to solve this kind of problem. We propose different fitness functions to find snakes in hypercubes of dimension greater than three and pose some open questions regarding the number of maximum length snakes in a hypercube of dimension d","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130848707","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":"Data-Logging and Supervisory Control in Wireless Sensor Networks","authors":"Aditya N. Das, F. Lewis, D. Popa","doi":"10.1109/SNPD-SAWN.2006.28","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.28","url":null,"abstract":"Wireless sensor networks (WSN) are increasingly used in a multitude of applications such as environmental and structural health monitoring, and condition-based maintenance. Even though the sensors collect a vast amount of data, only a tiny fraction of this data may be useful. This paper introduces and implements a data-logging & supervisory control architecture to manage the information gathered by the WSN and make decisions based on this information. We present an application module which would be able to effectively manipulate the sensor data and to support a discrete event controller (DEC). The DEC is responsible for generating rule-based tasks in order to address information-centric issues such as data-logging, alarm & event reporting and security. A combined data-logging and supervisory control framework (DSC) is proposed to address data pre-processing challenges such as acquiring and recording signals, online analysis, offline analysis, report generation, and data sharing","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123289195","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":"Addressing Unbounded Parallelism in Verification of Software Components","authors":"J. Adámek","doi":"10.1109/SNPD-SAWN.2006.15","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.15","url":null,"abstract":"To use verification tools for reliability analysis of a software component, it is desirable to specify the behavior of the component by a finite-state model. This is often impossible at design time if the component practices unbounded parallelism. In that case, the behavior of the component widely depends on the environment the component is instantiated in. Unfortunately, covering all possible environments results in an infinite-state model. In this paper, we introduce a solution based on the concept of template-to-model transformation: at design time, a developer describes the behavior of the component by a behavior template, which is automatically transformed into a concrete behavior model when the component is instantiated in an environment. As the concrete behavior model is finite-state, it is a suitable input for verification tools","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132363779","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}
Long He, R. Karne, A. Wijesinha, Sandeep Girumala, Gholam H. Khaksari
{"title":"Design Issues in a Bare PC Web Server","authors":"Long He, R. Karne, A. Wijesinha, Sandeep Girumala, Gholam H. Khaksari","doi":"10.1109/SNPD-SAWN.2006.33","DOIUrl":"https://doi.org/10.1109/SNPD-SAWN.2006.33","url":null,"abstract":"We present a bare PC Web server design that runs on any Intel 386 based PC without any hard disk and other supporting software. This server design is based on simplicity and minimal functionality. We identify design issues related to such server and provide our preliminary performance measurements in comparison with IIS and Apache servers. We have found that our Web server performs comparable to commercial servers and it can be enhanced to perform even better when it is optimized for certain design factors. This work also has motivated us to pursue further research in building bare PC Web servers that can be scalable to run large applications. In addition, as the Web server is self-contained with all necessary code, it inherently provides ubiquity on the network, which allows for moving the server dynamically on the network during emergency and catastrophic situations. Furthermore, bare PC software may also provide alternate ways of building secure systems for critical applications","PeriodicalId":385151,"journal":{"name":"Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126996602","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}