Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48103
K. Goswami, R. K. Iyer, M. Devarakonda
Predicted task resource usage provides a basis for developing two centralized load-sharing policies: MinQ and MinResp. Trace-driven simulations are used to compare MinQ and MinResp against Centex, an efficient centralized scheme. Experimental results show that the use of prediction makes MinQ and MinResp significantly less sensitive to the status update rate than Centex. Consequently, the proposed algorithms perform better than Centex at slower update rates and are capable of handling larger workloads. The prediction-based policies are also highly effective for load-sharing in environments with widely varying CPU requirements. Using a real trace file,with an equal number of large and small tasks, MinResp consistently produced mean response times that were 9% to 35% lower than those of Centex.<>
{"title":"Load sharing based on task resource prediction","authors":"K. Goswami, R. K. Iyer, M. Devarakonda","doi":"10.1109/HICSS.1989.48103","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48103","url":null,"abstract":"Predicted task resource usage provides a basis for developing two centralized load-sharing policies: MinQ and MinResp. Trace-driven simulations are used to compare MinQ and MinResp against Centex, an efficient centralized scheme. Experimental results show that the use of prediction makes MinQ and MinResp significantly less sensitive to the status update rate than Centex. Consequently, the proposed algorithms perform better than Centex at slower update rates and are capable of handling larger workloads. The prediction-based policies are also highly effective for load-sharing in environments with widely varying CPU requirements. Using a real trace file,with an equal number of large and small tasks, MinResp consistently produced mean response times that were 9% to 35% lower than those of Centex.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820851","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48082
P.Y. Wang, S. Seidman, M. D. Rice, T.E. Gerasch
DAPL is a data-parallel programming language that allows the programmer to define geometric organizations of virtual processors, called objects, that are machine-independent. These organizations can be built up from members of a collection of fundamental geometric types provided by the language. Each fundamental type has a set of associated primitives that may be invoked for data movement within objects. Alternatively, object types can be defined that have nonregular data communication patterns, and objects or virtual processors can be allocated dynamically. Information can also be transferred between objects. Typical SIMD operations such as broadcasting, reduction, processor selection, data aggregation, and parallel input/output are supported by DAPL. Several application programs are presented to illustrate the flexibility and power of the language.<>
{"title":"An object-method programming language for data parallel computation","authors":"P.Y. Wang, S. Seidman, M. D. Rice, T.E. Gerasch","doi":"10.1109/HICSS.1989.48082","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48082","url":null,"abstract":"DAPL is a data-parallel programming language that allows the programmer to define geometric organizations of virtual processors, called objects, that are machine-independent. These organizations can be built up from members of a collection of fundamental geometric types provided by the language. Each fundamental type has a set of associated primitives that may be invoked for data movement within objects. Alternatively, object types can be defined that have nonregular data communication patterns, and objects or virtual processors can be allocated dynamically. Information can also be transferred between objects. Typical SIMD operations such as broadcasting, reduction, processor selection, data aggregation, and parallel input/output are supported by DAPL. Several application programs are presented to illustrate the flexibility and power of the language.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115358858","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48072
M. Glaser, C. Kordecki, U. Rembold
HEROS (hierarchically extendible real-time operating system), which was developed and implemented for the control and supervision of robots, is described. It allows the dynamic creation of processes and their management. The processes in HEROS have no knowledge of their mutual existence and possess no global kernel routines or variables. The interprocess communication and synchronization is accomplished through a channel mechanism, using simple and effective functional calls. The uncoupling of processes attained through the channel concept enables the tasks to be defined and implemented independently and to be operated in parallel. HEROS is composed of several clusters connected through a local area network (LAN). Each cluster consists of several conventional single-board computers, a global memory, and a network controller.<>
{"title":"A concept for distributed control systems","authors":"M. Glaser, C. Kordecki, U. Rembold","doi":"10.1109/HICSS.1989.48072","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48072","url":null,"abstract":"HEROS (hierarchically extendible real-time operating system), which was developed and implemented for the control and supervision of robots, is described. It allows the dynamic creation of processes and their management. The processes in HEROS have no knowledge of their mutual existence and possess no global kernel routines or variables. The interprocess communication and synchronization is accomplished through a channel mechanism, using simple and effective functional calls. The uncoupling of processes attained through the channel concept enables the tasks to be defined and implemented independently and to be operated in parallel. HEROS is composed of several clusters connected through a local area network (LAN). Each cluster consists of several conventional single-board computers, a global memory, and a network controller.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128382376","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48109
W. Scacchi
The current state of the art in software productivity measurement is examined. A framework for understanding software productivity and some fundamentals of measurement are described. Selected studies of software productivity are surveyed, and challenges involved in measuring software productivity are identified. Alternatives for understanding software productivity that attempt to overcome the limitations of current approaches are discussed.<>
{"title":"Understanding software productivity: a comparative empirical review","authors":"W. Scacchi","doi":"10.1109/HICSS.1989.48109","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48109","url":null,"abstract":"The current state of the art in software productivity measurement is examined. A framework for understanding software productivity and some fundamentals of measurement are described. Selected studies of software productivity are surveyed, and challenges involved in measuring software productivity are identified. Alternatives for understanding software productivity that attempt to overcome the limitations of current approaches are discussed.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128705138","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48111
E. Sibley
Many information system endeavors fail (in terms of cost overruns, late delivery, or absolute inability to meet real needs). This is primarily still a matter of lack of effective communication by the various participants. Some possible improvements are discussed. They include: (1) adoption of engineering practice over all concepts, such as performance and safety, in the early stages of the definition; (2) use of a layered approach, where the design progresses in a top-down fashion, with few constraints at the start and assertion of more constraints until the definition is formal at completion; (3) better interaction and diagnostics among the various definition parts.<>
{"title":"A layered approach to very large system specification","authors":"E. Sibley","doi":"10.1109/HICSS.1989.48111","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48111","url":null,"abstract":"Many information system endeavors fail (in terms of cost overruns, late delivery, or absolute inability to meet real needs). This is primarily still a matter of lack of effective communication by the various participants. Some possible improvements are discussed. They include: (1) adoption of engineering practice over all concepts, such as performance and safety, in the early stages of the definition; (2) use of a layered approach, where the design progresses in a top-down fashion, with few constraints at the start and assertion of more constraints until the definition is formal at completion; (3) better interaction and diagnostics among the various definition parts.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124090931","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48076
K. Shin, Yogesh K. Muthuswamy
High-speed message communications is addressed. Each node in the system consists of multiple processors interconnected by a broadcast bus, but the individual nodes are interconnected by an arbitrary network. The concept of a poll number is proposed to control the access to an intranode bus, minimizing the probability of real-time messages missing their deadlines. When a task generates a time-constrained message, a poll number associated with the message is computed on the basis of the message deadline and the task priority. When the bus is free, the various tasks at a node which desire to use the bus write the poll number onto the bus and read it back, one bit at a time, starting from the most significant bit. If at any time the bit read back is different from the bit written, then that particular task drops out of the competition for the bus. The mechanism provides for not only decentralized control of the intranode bus, but also a high degree of flexibility in scheduling messages by different ways of generating poll numbers. The probability of a message missing its deadline in a token bus is found to be much higher than in a polled bus.<>
{"title":"Message communications in a distributed real-time system with a polled bus","authors":"K. Shin, Yogesh K. Muthuswamy","doi":"10.1109/HICSS.1989.48076","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48076","url":null,"abstract":"High-speed message communications is addressed. Each node in the system consists of multiple processors interconnected by a broadcast bus, but the individual nodes are interconnected by an arbitrary network. The concept of a poll number is proposed to control the access to an intranode bus, minimizing the probability of real-time messages missing their deadlines. When a task generates a time-constrained message, a poll number associated with the message is computed on the basis of the message deadline and the task priority. When the bus is free, the various tasks at a node which desire to use the bus write the poll number onto the bus and read it back, one bit at a time, starting from the most significant bit. If at any time the bit read back is different from the bit written, then that particular task drops out of the competition for the bus. The mechanism provides for not only decentralized control of the intranode bus, but also a high degree of flexibility in scheduling messages by different ways of generating poll numbers. The probability of a message missing its deadline in a token bus is found to be much higher than in a polled bus.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124314381","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48029
J. Lyle, K. Gallagher
The authors use M. Weisers (1984) technique, to approximate the notion of direct-sum decomposition for the flowgraph representation of a program. Given a program slice, they define its complement and demonstrate how to obtain it; the slices and complements are used to define the components of the decomposition. These components are independent in the sense that they are executable projections of a subset of the program's specification and can have nonempty intersections. The authors characterize those projections that give a nontrivial decomposition and demonstrate how to extend any given projection to a maximal component with respect to the decomposition. Statements and variables within the components are characterized according to their appearance in other components. Variables and/or statements that appear in more than one component can be combined into one component that will completely delineate influence in the source. The decomposition yields a method and guidelines for maintainers to use so that changes can be assured to be completely contained in the modules under consideration and there are no undetected linkages between the modified and unmodified code.<>
{"title":"A program decomposition scheme with applications to software modification and testing","authors":"J. Lyle, K. Gallagher","doi":"10.1109/HICSS.1989.48029","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48029","url":null,"abstract":"The authors use M. Weisers (1984) technique, to approximate the notion of direct-sum decomposition for the flowgraph representation of a program. Given a program slice, they define its complement and demonstrate how to obtain it; the slices and complements are used to define the components of the decomposition. These components are independent in the sense that they are executable projections of a subset of the program's specification and can have nonempty intersections. The authors characterize those projections that give a nontrivial decomposition and demonstrate how to extend any given projection to a maximal component with respect to the decomposition. Statements and variables within the components are characterized according to their appearance in other components. Variables and/or statements that appear in more than one component can be combined into one component that will completely delineate influence in the source. The decomposition yields a method and guidelines for maintainers to use so that changes can be assured to be completely contained in the modules under consideration and there are no undetected linkages between the modified and unmodified code.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133996710","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.47991
M. Kellner, G. Hansen
Experiences in applying a specific modeling approach and technology to a portion of a software support process used by the US Air Force are related. The modeling approach is discussed in the context of examples drawn from the model developed. A view of the primary objectives of software process modeling, which formed the basis of the approach used, is set forth. The usefulness of the model is evaluated, and general lessons are drawn from the modeling effort.<>
{"title":"Software process modeling: a case study","authors":"M. Kellner, G. Hansen","doi":"10.1109/HICSS.1989.47991","DOIUrl":"https://doi.org/10.1109/HICSS.1989.47991","url":null,"abstract":"Experiences in applying a specific modeling approach and technology to a portion of a software support process used by the US Air Force are related. The modeling approach is discussed in the context of examples drawn from the model developed. A view of the primary objectives of software process modeling, which formed the basis of the approach used, is set forth. The usefulness of the model is evaluated, and general lessons are drawn from the modeling effort.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132540530","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48092
C. Chow, D. Nelson, M. Adachi
A heterogeneous intelligent network is described that was designed and implemented to allow multimedia realtime communications and messaging among local area network workstations with logically associated speakerphones and ISDN (integrated-services digital network) voice/data terminals with transparent tablets on top of bit-map screens and stylus pens. The architecture, presentation, editing, storage, and retrieval of multimedia documents in these two different kinds of terminals are examined. The messages and protocol conversion facilities used for multimedia communications are presented, as are the lessons learned in internetworking a local area network with an ISDN.<>
{"title":"Multimedia communications on a heterogeneous network","authors":"C. Chow, D. Nelson, M. Adachi","doi":"10.1109/HICSS.1989.48092","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48092","url":null,"abstract":"A heterogeneous intelligent network is described that was designed and implemented to allow multimedia realtime communications and messaging among local area network workstations with logically associated speakerphones and ISDN (integrated-services digital network) voice/data terminals with transparent tablets on top of bit-map screens and stylus pens. The architecture, presentation, editing, storage, and retrieval of multimedia documents in these two different kinds of terminals are examined. The messages and protocol conversion facilities used for multimedia communications are presented, as are the lessons learned in internetworking a local area network with an ISDN.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132310018","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48047
N. Chapin
An entropy metric that can be calculated from readily available data for existing software is presented. Commercially available software provides data on the message flow in software, which are used to calculate changes in the entropy loading during software maintenance. Since entropy increases indicate increases in the disorder of the software system, entropy loading can be used as a metric in software maintenance.<>
{"title":"An entropy metric for software maintainability","authors":"N. Chapin","doi":"10.1109/HICSS.1989.48047","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48047","url":null,"abstract":"An entropy metric that can be calculated from readily available data for existing software is presented. Commercially available software provides data on the message flow in software, which are used to calculate changes in the entropy loading during software maintenance. Since entropy increases indicate increases in the disorder of the software system, entropy loading can be used as a metric in software maintenance.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132369031","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：