SWENET, the network community for softwareengineering education, is an NSF funded project to develop curriculum modules of value to faculty members desiring to incorporate softwareengineering concepts in new or exis...
详细信息
SWENET, the network community for softwareengineering education, is an NSF funded project to develop curriculum modules of value to faculty members desiring to incorporate softwareengineering concepts in new or existing courses. By design, the modules are self-contained instructional units ranging from a single lecture to approximately one week of course material. In this way, instructors can adopt, adapt, and arrange modules as appropriate to their courses. This presentation will provide an update on the status of the project including a report of current progress and problems encountered. The session will also address the future of the course materials collection and solicit input on ways to provide ongoing support to the community of softwareengineering researchers.
Grid computing focuses on aggregating resources (e.g., processor cycles, disk storage and contents) from a large-scale computing environment. It intends to deliver high-performance distributed platforms for computatio...
详细信息
ISBN:
(纸本)0769521185
Grid computing focuses on aggregating resources (e.g., processor cycles, disk storage and contents) from a large-scale computing environment. It intends to deliver high-performance distributed platforms for computationand/or data-intensive applications. In this paper, we study the enabling techniques for Grid computing for high-performance computing. Our goals are to: (1) understand the design of these key components; (2) set up a Grid computing platform; (3) learn how to create Grid-enabled high-performance applications; and (4) share experiences on constructing such platforms and applications from the status of Taiwan.
Adaptive algorithms are increasingly acknowledged in leading parallel and distributed research. In the past, algorithms were manually tuned to be executed efficiently on a particular architecture. However, interest ha...
ISBN:
(纸本)9783540241287
Adaptive algorithms are increasingly acknowledged in leading parallel and distributed research. In the past, algorithms were manually tuned to be executed efficiently on a particular architecture. However, interest has shifted towards algorithms that can adapt themselves to the computational resources. A cost model representing the behavior of the system (i.e. system parameters) and the algorithm (i.e algorithm parameters) plays an important role in adaptive parallel algorithms. In this paper, we contribute a computational model based on Bulk Synchronous Parallel processing that predicts performance of a parallelized split-step Fourier transform. We extracted the system parameters of a cluster (upon which our algorithm was executed) and showed the use of an algorithmic parameter in the model that exhibits optimal behavior. Our model can thus be used for the purpose of self-adaption.
The current debate about the teaching of data structures is hampered because, as a community, we usually debate specifics about data structure implementations and libraries, when the real level of disagreement remains...
详细信息
The current debate about the teaching of data structures is hampered because, as a community, we usually debate specifics about data structure implementations and libraries, when the real level of disagreement remains implicit - the intent behind our teaching. This paper presents a phenomenographic study of the intent of CS educators for teaching data structures in CS2. Based on interviews with Computer science educators and analysis of CS literature, we identified five categories of intent: developing transferable thinking, improving students' programming skills, knowing "what's under the hood", knowledge of software libraries, and component thinking. The CS community needs to first debate at the level of these categories before moving to more specific issues. This study also serves as an example of how phenomenographic analysis can be used to inform debate on syllabus design in general. Copyright 2004 ACM.
The teracluster LSSC-II installed at the State Key Laboratory of Scientific and engineeringcomputing, Chinese Academy of sciences is one of the most powerful PC clusters in China. It has a peek performance of 2Tflops...
详细信息
The teracluster LSSC-II installed at the State Key Laboratory of Scientific and engineeringcomputing, Chinese Academy of sciences is one of the most powerful PC clusters in China. It has a peek performance of 2Tflops. With a Linpack performance of 1.04Tflops, it is ranked at the 43rd place in the 20th TOP500 List (November 2002), 51st place in the 21st TOP500 List (June 2003), and the 82nd place in the 22nd TOP500 List (November 2003) with a new Linpack performance of 1.3Tflops. In this paper, we present some design principles of this cluster, as well as its applications in some large-scale numerical simulations.
Program slicing is widely used in applications such as program comprehension, software testing, debugging, measurement, and reengineering. This paper proposes a new approach for program slicing, called modular monadic...
详细信息
ISBN:
(纸本)0769522092
Program slicing is widely used in applications such as program comprehension, software testing, debugging, measurement, and reengineering. This paper proposes a new approach for program slicing, called modular monadic slicing, basing on modular monadic semantics of the program analysed. We abstract the computation of program slicing as a language-independence entity: slice monad transformer. On the basis of this, we present and illustrate modular monadic dynamic and static slice algorithms in detail. We conclude that modular monadic slicing has excellent flexibility and reusability properties comparing with the existing program slicing algorithms. It computes program slices on abstract syntax directly without intermediate structures such as dependence graphs
Adaptive algorithms are increasingly acknowledged in leading parallel and distributed research. In the past, algorithms were manually tuned to be executed efficiently on a particular architecture. However, interest ha...
详细信息
This paper proposes to model each cell of future wireless networks as a G/G/c/c queueing system. As such a model has not been explicitly addressed in the literature, we apply maximum entropy principles to evaluate bot...
详细信息
This paper proposes to model each cell of future wireless networks as a G/G/c/c queueing system. As such a model has not been explicitly addressed in the literature, we apply maximum entropy principles to evaluate both traffic distribution and blocking probability within each cell. Analysis of numerical results enables to specify the conditions under which the system offers good quality of service in terms of blocking probability. More specifically, such an analysis reveals that coefficient of variation of call arrivals has more impact over the blocking probability than coefficient of variation of channel holding time.
Functional dependencies are a popular and useful extension to Haskell style type classes. In this paper, we give a reformulation of functional dependencies in terms of Constraint Handling Rules (CHRs). In previous wor...
详细信息
暂无评论