Makoto Sato, Takashi Hirooka, K. Wada, F. Yamamoto
{"title":"Program partitioning optimizations in an HPF prototype compiler","authors":"Makoto Sato, Takashi Hirooka, K. Wada, F. Yamamoto","doi":"10.1109/CMPSAC.1996.542436","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542436","url":null,"abstract":"Two kinds of program partitioning optimizations are proposed. The first extends program partitioning using array subscript functions to deal with two cases about array elements on the left hand side of assignment statements in the loop: (a) the same loop control variables exist in different dimensions, (b) plural loop control variables exist in one dimension. The second removes statement guards generated in a loop by program partitioning in two cases about loop iteration ranges of statements in the loop: (c) ranges of plural statements for one processor are potentially different, (d) ranges of one statement for plural processors are potentially different. The first is proved to be efficient for the BEM program. The second is implemented in a simplified way in our HPF prototype compiler, and compiler output to Shallow Water program has as good performance as a hand optimized one.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666868","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}
H. Huang, W. Tsai, S. Bhattacharya, Xiaoping Chen, Yamin Wang, Jianhua Sun
{"title":"Business rule extraction from legacy code","authors":"H. Huang, W. Tsai, S. Bhattacharya, Xiaoping Chen, Yamin Wang, Jianhua Sun","doi":"10.1109/CMPSAC.1996.544158","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544158","url":null,"abstract":"Business rules are operational rules that business organizations follow to perform various activities. Over time, business rules evolve and the software that implemented them are also changed. As the encompassing software becomes large and aged the business rules embedded are difficult to extract and understand. Furthermore, the encompassing software is changed without changing the corresponding documents, so the business organization often trusts the code more than any other documents. It is possible to use a generic tool to extract business rules, but this can be an expensive exercise. The paper proposes a tailored solution approach to the business rule extraction problem, which combines variable classifications, program slicing, and hierarchical abstraction among other maintenance techniques. The proposed approach has been implemented as a system and successfully experimented with a number of industrial programs. The prototype has been demonstrated at several industrial software maintenance sites since June 1995.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127518260","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}
R. Paul, Y. Shinagawa, Young Francis Day, M. F. Khan, A. Ghafoor
{"title":"Object-oriented framework for metrics guided risk management","authors":"R. Paul, Y. Shinagawa, Young Francis Day, M. F. Khan, A. Ghafoor","doi":"10.1109/CMPSAC.1996.542434","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542434","url":null,"abstract":"We present a framework for managing large software projects using metrics. The collection and analysis of metrics data serve as a consistent mechanism for risk identification and quality management. The crux of this mechanism is the temporal modeling of metrics data. We present a comprehensive set of temporal operators which serve as the building block for the formal specification of users' views of risk and quality. The notion of temporal inheritance can be used to define an object oriented query language.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128309167","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 issues in information system reengineering","authors":"William W. Song","doi":"10.1109/CMPSAC.1996.544586","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544586","url":null,"abstract":"We address the problem of how to apply schema integration techniques in legacy system migration, since some issues in the legacy concept: legacy system migration and reengineering are closely related to schema integration methods. The importance of introducing integration issues to legacy system migration is two-fold. (1) To adapt legacy systems to a modern environment requires the integration (harmonization) of requirements for both legacy and modern systems. (2) Because a legacy information system is very large, it has to be decomposed into a number of smaller, relatively independent units in order to make migration easier to the target system. These decomposed units should be reintegrated again after the migration process. This situation becomes more complex and difficult when the legacy system was designed and modified using several requirements and data modelling methods. We pose the initial integration problems regarding these aspects: requirement and function schema integration, and database schema integration.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128355657","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":"Extracting parallelism in nested loops","authors":"W. Song, D. S. Park, B. S. Kim, Y.-H. Kong","doi":"10.1109/CMPSAC.1996.542424","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542424","url":null,"abstract":"Parallelization of sequential programs primarily focuses on loop structures since the array index variables in a loop usually exhibit data dependency among them. When the data dependency relation is constant in terms of distance, several compile time parallelization methods were introduced. On the other hand, when the data dependency relation varies in distance, the compile time extraction of parallelism is more complicated. We propose a generalized parallelism extraction scheme for nested loops. This method automatically converts a sequential loop into a nested parallel DOALL loop at compile time. Moreover, this algorithm can be applicable where the dependency relation is both constant and varying in distance. Our test results show the proposed scheme is superior to conventional methods when sufficiently large number of processors are provided.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374729","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":"SOPView: a visual query and object browsing environment for SOP OODBMS","authors":"S. Chang, Sukho Lee, Hyoung-Joo Kim","doi":"10.1109/CMPSAC.1996.544591","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544591","url":null,"abstract":"SOPView is a graphical user environment for SOP OODBMS. SOPView supports the frame-based visual specification of object-oriented database query elements such as target classes, projections, conditional predicates, and path expressions. SOPView also provides a browsing method which consists of components such as visualization structure, synchronized browsing, and intermediate reference set query in order for users to understand and access the complex reference hierarchy in object-oriented databases with ease.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131025981","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":"Multimedia on the Internet","authors":"P. Shah","doi":"10.1109/CMPSAC.1996.544152","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544152","url":null,"abstract":"Summary form only given. Sun is a strong supporter of open standards and therefore believes in cross-platform interoperability. The web is the universal interface to world's digital library. The biggest component of multimedia is video. Compliance of video with international standards based on ISO/MPEG specifications is very important in terms of facilitating interoperability. The standardized universal interface provides broadcast capability: publish once, reach millions. For worldwide interoperability of video communication, it is essential that there is a strict adherence to the profile architecture that has been developed by the MPEG Requirements Committee. Today's multimedia applications require reliable, on time delivery of data to one or more hosts simultaneously. In order to provide this capability, multicasting and quality of service guarantees must be incorporated into the network infrastructure. RSVP (reservation setup protocol) is a network control protocol that allows Internet applications to obtain special quality-of-service (QoS) for their dataflows. This will generally (but not necessarily) require reserving resources along the datapaths and providing some mechanism for packet scheduling in the routers. RSVP is a component of the future \"integrated services\" Internet, which will provide both best effort and real-time qualities of service. When an application in a host (end system) requests a specific QoS for its datastream, RSVP is used to deliver the request to each router along the path(s) of the datastream and to maintain router and host state to provide the requested service.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132972214","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":"Scheduling algorithms for N-version programming scheme","authors":"O. Abulnaja, S. Hosseini, K. Vairavan","doi":"10.1109/CMPSAC.1996.544161","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544161","url":null,"abstract":"For critical computer applications, N-version Programming (NVP) is used for software fault tolerance. However, software redundancy which is employed in NVP results in system performance degradation. We propose software fault-tolerant scheduling policies based on both fully N-version programming and semi N-version programming models of computation. Further we study the performance of the system under the proposed scheduling policies.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134508612","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}
Chih-Kai Chang, Gwo-Dong Chen, Baw-Jhiune Liu, K. Ou
{"title":"A language for developing collaborative learning activities on World Wide Web","authors":"Chih-Kai Chang, Gwo-Dong Chen, Baw-Jhiune Liu, K. Ou","doi":"10.1109/CMPSAC.1996.545882","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.545882","url":null,"abstract":"The World Wide Web (WWW) is in widespread use. People in different places can read hypermedia information through a computer network. Therefore, many educators have tried to develop a distance learning system on WWW so that people in different places can learn. However, some learning activities, such as discussion, collaboration, and conference, are difficult to implement on WWW for teachers who are not computer science majors. We propose a methodology by which teachers can build their collaborative learning activities on WWW effortlessly. The specification language, called Learning Activities Description (LAD), is devised for teachers to specify their learning activities and styles. Our system can generate the required programs according to the LAD specification. Therefore, designing learning activities using LAD can be as easy as designing courseware using HTML.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133754857","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":"Process model reuse to promote organizational learning in software development","authors":"E. Ellmer, D. Merkl, G. Quirchmayr, Min Tjoa","doi":"10.1109/CMPSAC.1996.542290","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542290","url":null,"abstract":"Software development often suffers from well-known problems such as wrong schedules and cost estimations, low productivity, and low product quality. In order to overcome these problems we suggest adapting the concepts of \"organizational memory\" and \"organizational learning\" and we argue in favor of establishing a reuse culture of software process models. We introduce an approach based on the process definition/instantiation/enaction paradigm and on the reuse of explicit software process descriptions (process models). The key features of our approach are the division of process descriptions into a goal-oriented process definition document and a formal implementation-oriented process model on the one hand and the use of an artificial neural network, more precisely a self-organizing map, for classification and retrieval purposes on the other. We present an exposition of our approach and discuss the promising results of an experiment in structuring a software process library and retrieving reuse candidates for upcoming projects.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125177173","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}