Proceedings of the Eighth Annual Software Engineering Workshop

The four major topics of discussion included: the NASA Software Engineering Laboratory, software testing, human factors in software engineering and software quality assessment. As in the past years, there were 12 position papers presented (3 for each topic) followed by questions and very heavy participation by the general audience

Large scale ab-initio simulations of dislocations

We present a novel methodology to compute relaxed dislocations core configurations, and their energies in crystalline metallic materials using large-scale ab-intio simulations. The approach is based on MacroDFT, a coarse-grained density functional theory method that accurately computes the electronic structure with sub-linear scaling resulting in a tremendous reduction in cost. Due to its implementation in real-space, MacroDFT has the ability to harness petascale resources to study materials and alloys through accurate ab-initio calculations. Thus, the proposed methodology can be used to investigate dislocation cores and other defects where long range elastic effects play an important role, such as in dislocation cores, grain boundaries and near precipitates in crystalline materials. We demonstrate the method by computing the relaxed dislocation cores in prismatic dislocation loops and dislocation segments in magnesium (Mg). We also study the interaction energy with a line of Aluminum (Al) solutes. Our simulations elucidate the essential coupling between the quantum mechanical aspects of the dislocation core and the long range elastic fields that they generate. In particular, our quantum mechanical simulations are able to describe the logarithmic divergence of the energy in the far field as is known from classical elastic theory. In order to reach such scaling, the number of atoms in the simulation cell has to be exceedingly large, and cannot be achieved with the state-of-the-art density functional theory implementations

SIM-DSP: A DSP-Enhanced CAD Platform for Signal Integrity Macromodeling and Simulation

Macromodeling-Simulation process for signal integrity verifications has become necessary for the high speed circuit system design. This paper aims to introduce a “VLSI Signal Integrity Macromodeling and Simulation via Digital Signal Processing Techniques” framework (known as SIM-DSP framework), which applies digital signal processing techniques to facilitate the SI verification process in the pre-layout design phase. Core identification modules and peripheral (pre-/post-)processing modules have been developed and assembled to form a verification flow. In particular, a single-step discrete cosine transform truncation (DCTT) module has been developed for modeling-simulation process. In DCTT, the response modeling problem is classified as a signal compression problem, wherein the system response can be represented by a truncated set of non-pole based DCT bases, and error can be analyzed through Parseval’s theorem. Practical examples are given to show the applicability of our proposed framework

Limits on Fundamental Limits to Computation

An indispensable part of our lives, computing has also become essential to industries and governments. Steady improvements in computer hardware have been supported by periodic doubling of transistor densities in integrated circuits over the last fifty years. Such Moore scaling now requires increasingly heroic efforts, stimulating research in alternative hardware and stirring controversy. To help evaluate emerging technologies and enrich our understanding of integrated-circuit scaling, we review fundamental limits to computation: in manufacturing, energy, physical space, design and verification effort, and algorithms. To outline what is achievable in principle and in practice, we recall how some limits were circumvented, compare loose and tight limits. We also point out that engineering difficulties encountered by emerging technologies may indicate yet-unknown limits.Comment: 15 pages, 4 figures, 1 tabl

Pembangunan Modul Pengajaran Kendiri (MPK) keusahawanan dalam topik isu keusahawanan bagi pelajar diploma di politeknik

Terdapat pelbagai kaedah pembelajaran yang telah diperkenalkan termasuklah kaedah pembelajaran yang menggunakan pendekatan pembelajaran bermodul secara kendiri. Kajian ini adalah bertujuan untuk mengkaji kesesuaian Modul Pengajaran Kendiri Keusahawanan dalam topik Isu Keusahawanan yang telah dihasilkan bagi pelajar yang mengikuti pengajian Diploma di Jabatan Perdagangan Politeknik. Antara aspek yang dikaji ialah untuk menilai sama ada rekabentuk modul yang dihasilkan dapat memenuhi ciri-ciri modul yang baik, MPK yang dihasilkan dapat membantu mencapai objektif pembelajaran, MPK ini bersifat mesra pengguna dan MPK yang dihasilkan membantu pensyarah menyampaikan pengajarannya dengan lebih berkesan. Kajian ini dilakukan ke atas 110 orang pelajar semester en am yang mengikuti pengajian diploma dan 4 orang pensyarah yang mengajar subjek Keusahawanan di Jabatan Perdagangan Politeknik Sultan Salahuddin Abdul Aziz Shah, Selangor. Kaedah analisa data yang digunakan dalam kajian ini ialah skor min dan peratus. Hasil daripada kajian ini menunjukkan bahawa rekabentuk modul yang dihasilkan memenuhi ciri-ciri modul yang baik, MPK ini membantu untuk mencapai objektif pembelajaran, MPK ini bersifat mesra pengguna dan MPK yang dihasilkan dapat membantu pensyarah menyampaikan pengajarannya dengan lebih berkesan. Ini bermakna secara keseluruhannya, hasil kajian menunjukkan bahawa modul yang dihasilkan oleh pengkaji adalah sesuai digunakan oleh pelajar-pelajar semester enam yang mengikuti pengajian diploma di Jabatan Perdagangan peringkat politeknik. Seterusnya, beberapa pandangan telah dikemukakan bagi meningkatkan rnutu dan kualiti MPK yang dihasilkan. Semoga kajian ini dapat memberi manfaat kepada mereka yang terlibat dalam bidang pendidikan

System configuration and executive requirements specifications for reusable shuttle and space station/base

System configuration and executive requirements specifications for reusable shuttle and space station/bas

Parallel symbolic state-space exploration is difficult, but what is the alternative?

State-space exploration is an essential step in many modeling and analysis problems. Its goal is to find the states reachable from the initial state of a discrete-state model described. The state space can used to answer important questions, e.g., "Is there a dead state?" and "Can N become negative?", or as a starting point for sophisticated investigations expressed in temporal logic. Unfortunately, the state space is often so large that ordinary explicit data structures and sequential algorithms cannot cope, prompting the exploration of (1) parallel approaches using multiple processors, from simple workstation networks to shared-memory supercomputers, to satisfy large memory and runtime requirements and (2) symbolic approaches using decision diagrams to encode the large structured sets and relations manipulated during state-space generation. Both approaches have merits and limitations. Parallel explicit state-space generation is challenging, but almost linear speedup can be achieved; however, the analysis is ultimately limited by the memory and processors available. Symbolic methods are a heuristic that can efficiently encode many, but not all, functions over a structured and exponentially large domain; here the pitfalls are subtler: their performance varies widely depending on the class of decision diagram chosen, the state variable order, and obscure algorithmic parameters. As symbolic approaches are often much more efficient than explicit ones for many practical models, we argue for the need to parallelize symbolic state-space generation algorithms, so that we can realize the advantage of both approaches. This is a challenging endeavor, as the most efficient symbolic algorithm, Saturation, is inherently sequential. We conclude by discussing challenges, efforts, and promising directions toward this goal