BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CECS - ECPv6.18.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CECS
X-ORIGINAL-URL:https://www.cecs.uci.edu
X-WR-CALDESC:Events for CECS
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20030406T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20031026T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20040404T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20041031T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20050403T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20051030T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20060402T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20061029T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20070311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20071104T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20060216T150000
DTEND;TZID=America/Los_Angeles:20060216T160000
DTSTAMP:20231011T183322Z
CREATED:20231011T183322Z
LAST-MODIFIED:20231011T183322Z
UID:14294-1140102000-1140105600@www.cecs.uci.edu
SUMMARY:Kilo-Instruction Processors: Overcoming the Memory Wall
DESCRIPTION:Kilo-Instruction Processors: Overcoming the Memory Wall\n\n\n\n\nSpeaker\n\n\nProfessor Mateo Valero\nComputer Architecture Dep. of the Polytechnical University of Catalunia\nCatalunia\, Spain\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nComputer Science 432\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nFebruary 16\, 2006\nRefreshments at 10:30am\, followed by Lecture\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nToday’s systems have a very large and growing gap between processor and (DRAM) memory speeds\, which results in very long memory latency and loss of performance. Many different techniques have been proposed to address this problem: cache memories\, prefetching and other latency hiding techniques\, and multithreading\, to name a few. We proposed a different approach to solving this problem: a new type of out-of-order superscalar processor called the Kilo-Instruction Processor. Our design can have thousands of in-flight instructions using a scalable multi-check pointing mechanism. This allows memory access to be overlapped with the execution of a large number of other instructions and significantly improves performance. Kilo-Instruction Processors also offer advantages in multiprocessor systems\, where the average memory latency is even longer. They enable implementation of other very desirable features via their check-pointing mechanism. For example\, we can implement a multiprocessor transactional memory in hardware using checkpoints\, which enables an effective implementation of sequential consistency. This talk will describe the main ideas of our work on Kilo-instruction processors\, efficient\nimplementation options for this type of processors\, and their use in the design of multiprocessor systems.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n\nMateo Valero obtained his PhD at UPC in 1980. He is a Professor in the Computer Architecture Department of the Polytechnical University of Catalunia (UPC) in Spain and the director of the Barcelona Supercomputing Center\, the National Supercomputing Center of Spain. His research interests are in the area of high performance computer architecture. He has published over 400 papers in this field. Dr. Valero is a Fellow of the IEEE\, an Intel Distinguished Research Fellow and a Fellow of the ACM. He is a Correspondent Academic Member of the Spanish Royal Academy of Sciences. He is a winner of the “King Jaime I” award by the Generalitat Valenciana and the Spanish national award “Julio Rey Pastor” for his research in IT technologies. He is very proud that his home town of Alfamen named its Public College after him.
URL:https://www.cecs.uci.edu/event/kilo-instruction-processors-overcoming-the-memory-wall/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20060207T190000
DTEND;TZID=America/Los_Angeles:20060207T190000
DTSTAMP:20231011T180118Z
CREATED:20231011T180118Z
LAST-MODIFIED:20231011T180118Z
UID:14200-1139338800-1139338800@www.cecs.uci.edu
SUMMARY:Professor Daniel Gajski Receives Honorary Doctorate
DESCRIPTION:Professor Daniel Gajski has been presented with an Honorary Doctorate from the University of Oldenburg\, Germany in recognition of his contributions in the areas of Embedded Systems and Design Science. In the early 1980s\, Dr. Gajski invented key concepts for the design of custom processors which are now widely used in the EDA industry. Later\, he made seminal contributions for the synthesis and verification of multi-processor embedded systems. Dr. Gajski is currently the Henry Samueli “Turing” Endowed Chair and Director of the Center for Embedded Computer Systems at the University of California\, Irvine.
URL:https://www.cecs.uci.edu/event/professor-daniel-gajski-receives-honorary-doctorate/
CATEGORIES:Awards
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20060201T150000
DTEND;TZID=America/Los_Angeles:20060201T160000
DTSTAMP:20231011T184446Z
CREATED:20231011T184446Z
LAST-MODIFIED:20231011T184446Z
UID:14338-1138806000-1138809600@www.cecs.uci.edu
SUMMARY:Compiler-in-the-Loop Exploration of Programmable Embedded Systems
DESCRIPTION:Compiler-in-the-Loop Exploration of Programmable Embedded Systems\nby Aviral Shrivastava \nEmbedded Systems are characterized by strict\, multi-dimensional design constraints such as power\, performance\, and time-to-market. Increasingly\, embedded processors are being employed for the flexibility of programmable solutions for embedded systems. However\, in order to satisfy all the design constraints simultaneously\, such embedded processors use many idiosyncratic architectural features (e.g.\, partial register renaming and partial bypassing)\, which in turn complicates the task of efficient software generation for the embedded processors. \nThe challenge in developing compilers for embedded processors is not only in developing compiler technology to exploit the idiosyncratic design feature\, but also to perofrm the required analysis in the limited resources present in embedded systems. When the compiler is able to exploit the idiosyncratic design feature\, it often has significant impact on the overall system characteristics. In such cases\, the compiler effects cannot be ignored while searching for the optimal processor design. Traditionally exploration to find an optimal processor is performed by simulating the same application binary over different processor variations. The variation that faresbest on the cost metric is chosen. Compiler effects in such an exploration scheme are typically accounted for\, using ad-hoc methods\, like hand-tuning the application binary\, or scaling the simluation results. Such ad-hoc methods miss many interesting design options\, and may even result in incorrect decisions being made during architectural exploration. \nMy thesis proposes a Compiler-in-the-Loop (CIL) Design Space Exploration (DSE) methodology to systematically include compiler effects in the search for an optimal embedded processor. In this talk I will demonstrate the need and usefulness of CIL DSE at several levels of design abstractions: the micro-architectural level\, the architectural level\, memory level\, and at the processor-memory-interface level. The CIL DSE approach results in a more meaningful exploration of the design space\, and allows embedded system designers to efficiently evaluate architectural options with respect to system constraints quickly\, reliably and early in the design process.
URL:https://www.cecs.uci.edu/event/compiler-in-the-loop-exploration-of-programmable-embedded-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20060124T170000
DTEND;TZID=America/Los_Angeles:20060124T170000
DTSTAMP:20231011T180118Z
CREATED:20231011T180118Z
LAST-MODIFIED:20231011T180118Z
UID:14202-1138122000-1138122000@www.cecs.uci.edu
SUMMARY:Sudeep Pasricha and Professor Nikil Dutt Receive Best Paper Award
DESCRIPTION:Graduate student Sudeep Pasricha and Professor Nikil Dutt\, proudly receive their Best Paper Award at the Asia and South Pacific Design Automation Conference 2006 (ASPDAC 2006) which took place in Yokohama\, Japan on January 24\, 2006. Their award winning technical paper is entitled “Constraint-driven Bus Matrix Synthesis for MPSoC.”download pdf
URL:https://www.cecs.uci.edu/event/sudeep-pasricha-and-professor-nikil-dutt-receive-best-paper-award/
CATEGORIES:Awards
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20051209T150000
DTEND;TZID=America/Los_Angeles:20051209T160000
DTSTAMP:20231011T190252Z
CREATED:20231011T190252Z
LAST-MODIFIED:20231011T190252Z
UID:14380-1134140400-1134144000@www.cecs.uci.edu
SUMMARY:CECS Holiday Gathering
DESCRIPTION:
URL:https://www.cecs.uci.edu/event/cecs-holiday-gathering/
CATEGORIES:Other Events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20051202T150000
DTEND;TZID=America/Los_Angeles:20051202T160000
DTSTAMP:20231011T184446Z
CREATED:20231011T184446Z
LAST-MODIFIED:20231011T184446Z
UID:14339-1133535600-1133539200@www.cecs.uci.edu
SUMMARY:Functional Verification of System Level Model Refinements
DESCRIPTION:Functional Verification of System Level Model Refinements\nby Samar Abdi \nWith continuous improvement in process technology\, designers have more resources than ever available for implementing their systems. As applications become larger\, the modeling abstraction has to rise to keep the complexity manageable. This has given rise to modeling at abstractions above the register transfer and cycle accurate levels. Verification becomes an even greater challenge as designers try to develop more models to evaluate their implementation choices. In this dissertation we present our verification strategy to alleviate the problems resulting from the move to system level. We argue our case for a system level modeling and verification methodology where detailed models are refined from abstract models. The models are represented formally using Model Algebra and the refinements are proved to be functionality preserving\, using the rules of Model Algebra. We define the objects and composition rules of Model Algebra and show how system level models are represented as expressions in this formalism. The formal execution semantics of such models are discussed and a notion for functional equivalence of models is also presented. We then define transformation rules that syntactically modify a model algebraic expression\, while keeping its functionality intact. Then we present key refinements that are commonly encountered in system level design and prove the correctness of those refinements using the transformation rules of Model Algebra. As a proof of concept\, we implemented a tool that automatically checks if the refinements were performed correctly on SpecC models. As a result\, the designer needs to perform the costly and time consuming property verification on the first model only. All step wise refinements from the original model are proven to produce functionally equivalent models.
URL:https://www.cecs.uci.edu/event/functional-verification-of-system-level-model-refinements/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20051202T150000
DTEND;TZID=America/Los_Angeles:20051202T160000
DTSTAMP:20231011T184446Z
CREATED:20231011T184446Z
LAST-MODIFIED:20231011T184446Z
UID:14340-1133535600-1133539200@www.cecs.uci.edu
SUMMARY:Cache Power-Performance Optimization
DESCRIPTION:Cache Power-Performance Optimization\nby Dan Nicolaescu \nThe speed gap between the memory and processor continues to increase. As a consequence the cache system becomes more and more important for bridging this speed gap in order to obtain good performance. As the cache size and associativity increase\, its energy consumption becomes a higher part of the total processor energy budget. The high energy consumption is a major problem for current processors\, and given the predictions for the semiconductor industry\, it will further increase in the future. The traditional way of reducing energy consumption through decreasing the feature size is running out of steam. Therefore solutions need to be found at other levels in the design hierarchy. This dissertation studies the performance and energy consumption of the cache system and proposes and proves effective low complexity\, yet highly effective solutions for reducing the cache energy consumption and increasing the processor performance at the architectural level. \nThe cache energy consumption can be reduced by reducing the number of cache accesses. This can be achieved by using a new architectural component called Cached Load/Store Queue which also allows for a performance improvement by reducing average cache access latency. The energy consumption of highly associative CAM based caches can be improved by using a predictor and changing the way the access is performed. The Way Cache is a novel component that can be used to improve the dynamic and static energy consumption of associative caches by reducing the number of tag and data ways accessed for each cache access.
URL:https://www.cecs.uci.edu/event/cache-power-performance-optimization/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20051115T150000
DTEND;TZID=America/Los_Angeles:20051115T160000
DTSTAMP:20231011T192654Z
CREATED:20231011T180420Z
LAST-MODIFIED:20231011T192654Z
UID:14232-1132066800-1132070400@www.cecs.uci.edu
SUMMARY:PIE: Programmable Internet Environment
DESCRIPTION:Abstract \nPIE: Programmable Internet Environment\nclick on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/pie-programmable-internet-environment/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20051014T150000
DTEND;TZID=America/Los_Angeles:20051014T160000
DTSTAMP:20231011T190252Z
CREATED:20231011T190252Z
LAST-MODIFIED:20231011T190252Z
UID:14381-1129302000-1129305600@www.cecs.uci.edu
SUMMARY:CECS Potluck Party
DESCRIPTION:click on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/cecs-potluck-party/
CATEGORIES:Other Events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050617T150000
DTEND;TZID=America/Los_Angeles:20050617T160000
DTSTAMP:20231011T192041Z
CREATED:20231011T180434Z
LAST-MODIFIED:20231011T192041Z
UID:14233-1119020400-1119024000@www.cecs.uci.edu
SUMMARY:Cutpoints for Formal Equivalence Verification of Embedded Software
DESCRIPTION:Cutpoints for Formal Equivalence Verification of Embedded Software\n\n\n\n\nSpeaker\n\n\nDr. Alan Hu\nDepartment of Computer Science\nUniversity of British Colombia\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nIERF Conference Room 432\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nJune 17 \, 2005\nTalk begins at 9:30am\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nLike hardware\, embedded software faces stringent design constraints\, undergoes extremely aggressive optimization\, and therefore has a similar need for verifying the functional equivalence of two versions of a design\, e.g.\, before and after an optimization. The concept of cutpoints was a breakthrough in the formal equivalence verification of combinational circuits and is the key enabling technology behind its successful commercialization. We introduce an analogous idea for formally verifying the equivalence of structurally similar\, “combinational” software\, i.e.\, software routines that compute a result and return/terminate\, rather than executing indefinitely. We have implemented a proof-of-concept cutpoint approach in our prototype verification tool for the TI C6x family of VLIW DSPs\, and our experiments show large improvements in runtime and memory usage.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n \nAlan Hu received his BS and PhD degrees from Stanford University . He is an associate professor and associate head of the Department of Computer Science at the University of British Columbia . For the past15 years\, his main research focus has been automated\, practical techniques for formal verification. He has served on the program committees of most major CAD and formal verification conferences\, and chaired or co-chaired CAV (1998)\, HLDVT (2003)\, and FMCAD (2004). He was also a Technical Working Group Key Contributor on the 2001 International Technology Roadmap for Semiconductors.
URL:https://www.cecs.uci.edu/event/cutpoints-for-formal-equivalence-verification-of-embedded-software/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050614T160000
DTEND;TZID=America/Los_Angeles:20050614T160000
DTSTAMP:20231011T180133Z
CREATED:20231011T180133Z
LAST-MODIFIED:20231011T180133Z
UID:14203-1118764800-1118764800@www.cecs.uci.edu
SUMMARY:Payam Heydari Receives Best Paper Award
DESCRIPTION:Payam Heydari\, Assistant Professor ofthe Department of Electrical Engineering and Computer Science\, won the 2005 Darlington Best Paper Award from the IEEE Circuits and Systems Society for his journal paper entitled “Analysis of the PLL Jitter Due to Power/Ground and Substrate Noise” published in the IEEE Transactions on Circuits and Systems \, vol. 51\, no. 12\, pages 2404-2416\, December 2004.\nThe Darlington Award is given in honor of Dr. Sidney Darlington\, a Bell Labs scientist who pioneered the design of electronic circuits and systems. The award is given in recognition of the best paper bridging the gap between theory and practice published in IEEE Transactions on Circuits and Systems \, which is published in two separate monthly volumes over the past 2 years. The award is based on the general quality\, originality\, contributions\, subject matter and timeliness. Over 900 papers\, all of which have been peer-reviewed and published during the last two years\, were eligible to receive the award. \nPayam Heydari is the sole author of this paper and the youngest faculty among past recipients of this award. He will receive the award and a cash prize at the opening session of the 2005 Design Automation Conference on June 14 th \, 2005 in Anaheim Convention Center \, California . \nThe Circuits and Systems Society is one of the largest societies within the Institute for Electronics and Electrical Engineers\, commonly referred to as IEEE.
URL:https://www.cecs.uci.edu/event/payam-heydari-receives-best-paper-award/
CATEGORIES:Awards
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050609T150000
DTEND;TZID=America/Los_Angeles:20050609T160000
DTSTAMP:20231011T183322Z
CREATED:20231011T183322Z
LAST-MODIFIED:20231011T183322Z
UID:14295-1118329200-1118332800@www.cecs.uci.edu
SUMMARY:VLSI Design Methodologies Considering Fabrication Variability
DESCRIPTION:VLSI Design Methodologies Considering Fabrication Variability\n\n\n\n\nSpeaker\n\n\nProfessor Shrivastava \nDepartment of Electrical and Computer Engineering\nUniversity of Maryland\n\n\n\n\n\n\n\n\n\n\nCECS Host\n\n\nProfessor Elaheh Bozorgzadeh\neli@ics.uci.edu\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nIERF Conference Room 127\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nJune 9\, 2005\nRefreshments at 2:30pm\, Lecture begins at 3:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nIn the past few years\, it has become clear that fabrication variability is one of the most important challenge that needs to be addressed for keeping the semiconductor industry profitable. Fabrication variability imposes an underlying uncertainty on the design process of VLSI chips making several parameters random. Therefore\, the old way of doing design needs to be overhauled for considering this randomness. This implies that VLSI CAD needs to incorporate probabilistic models for capturing uncertainty and stochastic optimization for controlling the design decision variables. Several challenges need to be addressed before this is made possible…\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n\nAnkur Srivastava received the B.S. degree from the Indian Institute of Technology\, Delhi\, the M.S. degree from Northwestern University\, Evanston\, IL\, and the Ph.D. degree from the University of California Los Angeles (UCLA) in 1998\, 2000\, and 2002. Since fall 2002 he has been an Assistant Professor with the University of Maryland\, College Park. His research interests include all aspects of design automation including logic and high-level synthesis\, low-power issues and predictability\, and low-power issues pertaining to sensor networks. Dr. Srivastava received the outstanding Ph.D. Award from the Computer Science Department of UCLA in 2002. He is a member of ACM and IEEE.
URL:https://www.cecs.uci.edu/event/vlsi-design-methodologies-considering-fabrication-variability/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050513T150000
DTEND;TZID=America/Los_Angeles:20050513T160000
DTSTAMP:20231011T192748Z
CREATED:20231011T180435Z
LAST-MODIFIED:20231011T192748Z
UID:14234-1115996400-1116000000@www.cecs.uci.edu
SUMMARY:Practical Considerations for Power-Aware Real-Time Scheduling
DESCRIPTION:Continuous Compilation for Aggressive and Adaptive\nCode Transformation\n\n\n\n\nSpeaker\n\n\nDr. Bruce Childers\nDepartment of Computer Science\nUniversity of Pittsburgh\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nIERF Conference Room 127\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nMay 13 \, 2005\nRefreshments at 2:30pm\, Lecture begins at 3:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nOver the past several decades\, the compiler research community has developed a number of sophisticated and powerful algorithms for a variety of code improvements. Although there are still promising directions for particular aspects of code optimization\, research on optimizations is nearing the point of diminishing returns and other approaches are needed to achieve further performance improvements. Our research aims to address this challenge by investigating and developing an innovative framework and system for continuously and adaptively applying code improvements. Our system\, the Continuous Compiler ( CoCo )\, determines “optimization plans” at compile-time that describe the best way in which to apply both static and dynamic code transformations. The plans consider program and machine context\, interaction among optimizations\, and performance profit. Through such planning\, CoCo can tailor and adapt its decisions to more synergistically apply a whole suite of code transformations.  \nThis talk will describe the Continuous Compilation approach and present initial results. These results include novel analytic models that can accurately predict the performance benefit (profit) of applying an optimization without actually doing it or running the resulting program code. Using the analytic models\, we have developed several planners that can guide a static optimizer. Initial results are very encouraging and show that optimizations can be effectively directed by planning. The talk will conclude with a brief discussion of CoCo ‘s run-time system\, including its dynamic code translator\, instrumentation optimizer\, and source-level debugger for dynamically translated code.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n \nBruce Childers is an Assistant Professor in the Department of Computer Science at the University of Pittsburgh. Dr. Childers received a BS degree (Computer Science\, 1991) from the College of William and Mary\, and a PhD degree (Computer Science\, 2000) from the University of Virginia. His research interests are compilers and software development tools\, computer architecture\, and embedded systems. Current projects include continuous compilation to synergistically apply both static and dynamic code optimizations\, debugging for dynamically translated code\, power-aware real-time systems\, and demand-driven software testing.
URL:https://www.cecs.uci.edu/event/practical-considerations-for-power-aware-real-time-scheduling-2/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050509T150000
DTEND;TZID=America/Los_Angeles:20050509T160000
DTSTAMP:20231011T183322Z
CREATED:20231011T183322Z
LAST-MODIFIED:20231011T183322Z
UID:14296-1115650800-1115654400@www.cecs.uci.edu
SUMMARY:Customizable Embedded Processor Architectures
DESCRIPTION:Customizable Embedded Processor Architectures\n\n\n\n\nSpeaker\n\n\nProfessor Orailoglu \nDepartment of Computer Science and Engineering\nUniversity of California\, San Diego\, CA\n\n\n\n\n\n\n\n\n\n\nCECS Host\n\n\nProfessor Jean-Luc Gaudiot\ngaudiot@ics.uci.edu\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nMcDonnell Douglas Auditorium\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nApril 14\, 2005\nRefreshments at 3:30 pm\, Lecture begins at 4:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nRecent advances in VLSI technology are resulting in ever more complex system-on-a-chip designs. Reduced time-to-market and low product cost requirements have been placing increased pressure upon designers to shift as much as possible of the system functionality onto a set of available microprocessor cores so as to reduce the hardware cost of the system and achieve faster time-to-market. Yet one of the fundamental difficulties in implementing larger parts of SOC functionality in software is the stringent timing constraints of the critical modules; methods need to be developed for matching such stringent constraints if embedded processor cores are to be widely used. Low-cost\, application-specific microarchitecture customizations promise to be an efficient solution to this problem. The basic advantage of microprocessor cores versus ASICs is the intrinsic reconfiguration capability of the processor by means of software. In order to preserve this fundamental advantage\, application-specific features added to the microarchitecture need to be implemented as reprogrammable hardware. Post-manufacturing customization capability can thus provide seamless migration to new applications possibly due to late specification changes or market requirements\, while delivering superior levels of performance. In this talk\, we outline the incorporation of application specific properties into the processor microarchitecture\, thus increasing performance and reducing power consumption. The fundamental approach is the identification of application properties during compile time and their dynamic exploitation during program execution by the processor. The basic characteristic of these properties is that their existence can be statically identifiable by the compiler\, and that they can lead to significant improvements in performance when exploiting their behavior dynamically. Such properties may consist of the control structure of the algorithm\, the run-time data values and the code manipulating some data structures; for example\, an array access\, its stride\, or its control structure. Microarchitectural features that can be enhanced with such application-specific information include the branch predictor\, the cache subsystem\, and the processor communication infrastructure; techniques aimed at all three are outlined in this talk.\ndownload pdf\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n\nAlex Orailoglu received his BS Degree cum laude from Harvard University in Applied Mathematics and his M.S. and Ph.D. degrees in Computer Science from the University of Illinois \, Urbana-Champaign. Alex Orailoglu is currently a Professor of Computer Science and Engineering at the University of California \, San Diego . His research interests include Embedded Systems and Processors\, digital and analog test\, fault tolerant computing\, Computer-Aided Design\, and nanoelectronics.\n\n\n\nCustomizable Embedded Processor Architectures\nclick on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/customizable-embedded-processor-architectures/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050414T150000
DTEND;TZID=America/Los_Angeles:20050414T160000
DTSTAMP:20231011T183322Z
CREATED:20231011T183322Z
LAST-MODIFIED:20231011T183322Z
UID:14297-1113490800-1113494400@www.cecs.uci.edu
SUMMARY:Multiple Objective Behavioural Synthesis
DESCRIPTION:Multiple Objective Behavioural Synthesis\n\n\n\n\nSpeaker\n\n\nProfessor Zwolinski \nSchool of Electronics and Computer Science\nUniversity of Southampton\, UK\n\n\n\n\n\n\n\n\n\n\nCECS Host\n\n\nProfessor Ian Harris\nharris@ics.uci.edu\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nICS 432\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nApril 14\, 2005\nRefreshments at 10:30am\, Lecture begins at 11:00am\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nFor a number of years\, the Electronic Systems Design Group in the School of Electronics and Computer Science\, University of Southampton has been working on a behavioral synthesis tool – MOODS (Multiple Objective Optimization in control and Data path Synthesis). Unlike many other high-level synthesis tools\, MOODS optimizes designs by a series of small\, localized transforms to the data and control paths. This approach has some significant advantages over other techniques\, most notably that a number of different objectives can be specified\, without knowing the relationship between those objectives. Initially\, optimization was performed in terms of area and critical path delay\, but this has been extended (through a succession of PhD projects) to include power\, testability and reconfigurability. In this talk\, the techniques used and results achieved will be discussed\, together with future research directions.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n\nDr. Mark Zwolinski is a Reader (Associate Professor) in the School of\nElectronics and Computer Science at the University of Southampton UK. He\ncompleted his BS in Electronic Engineering and PhD in Electronics at\nthe University of Southampton\, too. He was appointed as a lecturer\n(Assistant Professor) in 1990. His PhD was on the topic of electronic\ncircuit simulation\, but he has since developed research interests in\nanalog and mixed-signal test\, high-level synthesis and verification. He\nhas published over 100 refereed conference and journal papers and is the\nauthor of two books.
URL:https://www.cecs.uci.edu/event/multiple-objective-behavioural-synthesis/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050320T150000
DTEND;TZID=America/Los_Angeles:20050320T160000
DTSTAMP:20231011T193551Z
CREATED:20231011T185235Z
LAST-MODIFIED:20231011T193551Z
UID:14361-1111330800-1111334400@www.cecs.uci.edu
SUMMARY:B#: A Battery Emulator and Power-Profiling Instrument
DESCRIPTION:Release Date: March\, 2005Download pdf: http://www.ece.uci.edu/~chou/battDT-layout.pdf \nB# (B sharp) is a programmable power supply that emulates battery behavior. It measures current load\, calls a battery simulation program to compute voltage in real time\, and controls a linear regulator to mimic a battery’s voltage output. The instrument enables validation of battery-aware power optimization techniques with accurate\, controllable\, reproducible results.
URL:https://www.cecs.uci.edu/event/b-a-battery-emulator-and-power-profiling-instrument/
CATEGORIES:Other Events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050315T150000
DTEND;TZID=America/Los_Angeles:20050315T150000
DTSTAMP:20231011T180133Z
CREATED:20231011T180133Z
LAST-MODIFIED:20231011T180133Z
UID:14204-1110898800-1110898800@www.cecs.uci.edu
SUMMARY:Henry T. Nicholas\, III Research Fellowships
DESCRIPTION:The Center for Embedded Computer Systems (CECS) at the University of California\, Irvine (UCI) announces that it is receiving graduate student applications for two Henry T. Nicholas\, III Research Fellowships for the 2005-2006 academic year. These research fellowships will provide a graduate student stipend plus the payment of tuition and fees for one academic year including summer support. Applicants must satisfy the following requirements: \n\nApplicant must have passed PhD examination at University of California\, Irvine\nApplicant’s thesis advisor must be a member of the Center for Embedded Computer Systems\nApplicant’s should submit a 2 page research description to include: succinct discussion of interdisciplinary research novelty\, proposed extensions of interdisciplinary research\, and be able to demonstrate prototype or proof of concept\nResearch projects described on the CECS web site will be given priority\n\nApplications must be submitted to the Selection Committee Chair by March 15\, 2005: \nRobert P. Larsen\, Chair\nAssociate Director\nCenter for Embedded Computer Systems\nUniversity of California\, Irvine \nThe two Henry T. Nicholas\, III Research Fellows will be announced May 15\, 2005.
URL:https://www.cecs.uci.edu/event/henry-t-nicholas-iii-research-fellowships/
CATEGORIES:Awards
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050207T140000
DTEND;TZID=America/Los_Angeles:20050207T140000
DTSTAMP:20231011T180133Z
CREATED:20231011T180133Z
LAST-MODIFIED:20231011T180133Z
UID:14205-1107784800-1107784800@www.cecs.uci.edu
SUMMARY:Chou & Heydari Win NSF CAREER Awards
DESCRIPTION: \nProfessors Pai H. Chou and Payam Heydari\, Department of Electrical Engineering and Computer Science at the Henry Samueli School of Engineering\, have been named recipients of the National Science Foundation (NSF) Faculty Early Career Development (CAREER) Award. Professor Chou’s research proposal was titled Design Optimization and Quantitative Evaluation of Wireless Embedded Sensing Systems. Professor Heydari’s research proposal was titled Analysis and Design of Silicon-Based Performance-Optimized Integrated Circuits for High-Frequency Wideband Wireless Communication Systems. Each professor received an award of $400\,000 covering a 5 year duration. \nThe CAREER award is the NSF’s most prestigious award to new faculty members. The CAREER program recognizes and supports the early career-development of those teacher-scholars who are most likely to become academic leaders of the 21 st century. CAREER awardees are selected on the basis of creative\, career-development plans that effectively integrate research and education within the context of the mission of their institution. The CAREER award plans should build a firm foundation for a lifetime of integrated contributions to research and education. \nCECS extends congratulations to Professor Chou and Professor Heydari on receiving this prestigious NSF CAREER award and the accompanying recognition. \n  \n\nProfessor Payam Heydari at his reseach station.\nview larger image \n\nA screenshot of some of Professor Heydari’s research:\na novel broadband non-uniform distributed amplifier.\nview larger image \n\nProfessor Masanobu Shinozuka and Professor Pai H. Chou\npresenting a piece from their network vibration sensor network research.\nview larger image
URL:https://www.cecs.uci.edu/event/chou-heydari-win-nsf-career-awards/
CATEGORIES:Awards
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20050125T130000
DTEND;TZID=America/Los_Angeles:20050125T130000
DTSTAMP:20231011T180133Z
CREATED:20231011T180133Z
LAST-MODIFIED:20231011T180133Z
UID:14206-1106658000-1106658000@www.cecs.uci.edu
SUMMARY:Dr. Mishra wins 2004 EDAA Outstanding Dissertation Award
DESCRIPTION:Dr. Prabhat Mishra won the EDAA outstanding dissertation award for the topic “New Directions in Embedded System Design Automation.” His paper is titled\, “Specification-Driven Validation of Programmable Embedded Systems.”
URL:https://www.cecs.uci.edu/event/dr-mishra-wins-2004-edaa-outstanding-dissertation-award/
CATEGORIES:Awards
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20041209T150000
DTEND;TZID=America/Los_Angeles:20041209T160000
DTSTAMP:20231011T183336Z
CREATED:20231011T183336Z
LAST-MODIFIED:20231011T183336Z
UID:14298-1102604400-1102608000@www.cecs.uci.edu
SUMMARY:Technological Challenges to Computer Architecture Innovation
DESCRIPTION:Video Introduction (Windows Media Player) \n  \nTechnological Challenges to Computer Architecture Innovation\n\n\n\n\nSpeaker\n\n\nDr. Faye Briggs\nIntel Corporation\n\n\n\n\n\n\n\n\n\n\nCECS Host\n\n\nAlex Veidenbaum\nalexv@cecs.uci.edu\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nMcDonnell Douglas Auditorium\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nDecember 9 \, 2004\nRefreshments at 2:30pm\, Lecture begins at 3:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nComputer architecture has evolved significantly over the last 30 years. With a major dependence on technology\, we have been able to keep up with Moore’s law. We are beginning to face enormous constraints in technology\, and these create significant challenges for computer architecture advancement. The goal of this talk is to provide an overview of many of the variables and constraints that will challenge traditional computer architecture innovations. The intent is to highlight these challenges with the expectation of triggering more research and potential breadkthroughs to sustain innovation in computer architecture.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n\n \nDr. Faye Briggs is Sr. Principal Engineer and Director of Platform Performance Architecture\, Enterprise Products Group at Intel Corporation. Dr. Briggs led the architecture & engineering teams that develop the Intel AE 870 for 2-16P Itanium AE servers. He was a co-founder and CTO of Axil Computers. While at Sun Microsystems\, he coarchitected the first SPARC-V8\, and led the architecture team to develop multiprocessor SPARCserver2000. Faye Briggs also served on the faculties of Purdue and Rice Universities. He has co-authored a popular textbook on Computer Architecture and Parallel Processing\, and published over 40 technical papers. He received his MSEE from Stanford\, and Ph.D. ECE from the University of Illinois. \n\n\n\n\n\nTechnological Challenges to Computer Architecture Innovation\nclick on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/technological-challenges-to-computer-architecture-innovation/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20041025T150000
DTEND;TZID=America/Los_Angeles:20041025T160000
DTSTAMP:20231011T184638Z
CREATED:20231011T184638Z
LAST-MODIFIED:20231011T184638Z
UID:14347-1098716400-1098720000@www.cecs.uci.edu
SUMMARY:Extreme Makeover of Design Automation
DESCRIPTION:Extreme Makeover of Design Automation \n\n\n\n\nSpeaker\n\n\nProfessor Gajski \nElectrical Engineering and Computer Science\nUniversity of California at Irvine\n\n\n\n \n\n\n \n\n\n\nLocation\n\n\nUniversity Club\, UC Irvine\n\n\n\n \n\n\n \n\n\n\nDate & Time\n\n\nOctober 25\, 2004\nSocial Hour at 6:00pm\, Presentation begins at 7:00pm\n\n\n\n \n\n\n \n\n\n\nAbstract\n\n\nWith complexities of Systems-on-Chip rising almost daily\, the design community has been searching for new vision that can handle given complexities with increased productivity and decreased times-to-market. The obvious solution\, such as increasing levels of abstraction\, introducing variety of IPs or offering new design languages will not solve the problem but only prolong the present status of inefficiency and confusion. What is needed is a drastic change in design automation for complex systems that consist of software and hardware. In order to design such systems efficiently\, we need a new approach with a new design flow\, with new models with well defined semantics and a new formalism that will support system synthesis and verification of software and hardware. \nIn order to find the solution\, we will look first at the system gap between SW and HW designs and derive requirements for the design flow that includes software as well as hardware. In order to enable new EDA tools for model generation\, simulation\, synthesis and verification\, the design flow has to be well defined with unique abstraction levels\, model semantics and model transformations corresponding to design decisions made by the designers. We will introduce the concept of model algebra that supports this approach and can serve as an enabler for the extreme makeover of EDA. We will support this concept with hard data and finish with a prediction and a roadmap toward the final goal of increasing productivity by several orders of magnitude while reducing expertise level needed for design of complex systems to the basic principles of design science only.\n\n\n\n \n\n\n \n\n\n\nBiography\n\n\n  \n\n \n\nProfessor Gajski directs the UCI Center for Embedded Computer Systems\, with a research mission to incorporate embedded systems into automotive\, communications\, and medical applications. He has authored over 300 papers and seven textbooks\, including Principles of Digital Design (Englewood Cliffs\, NJ: Prentice Hall\, 1997) that has been translated into several languages. \nHe holds Dipl. Ing. and M.S. degrees in electrical engineering from the University of Zagreb\, Croatia\, and a doctoral degree in computer and information sciences from the University of Pennsylvania\, Philadelphia. After 10 years as Professor at University of Illinois he has joined UCI\, where he presently holds The Henry Samueli Endowed Chair in Computer System Design.
URL:https://www.cecs.uci.edu/event/extreme-makeover-of-design-automation/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20041004T120000
DTEND;TZID=America/Los_Angeles:20041004T120000
DTSTAMP:20231011T180133Z
CREATED:20231011T180133Z
LAST-MODIFIED:20231011T180133Z
UID:14207-1096891200-1096891200@www.cecs.uci.edu
SUMMARY:Dutt\, Reshadi\, Mishra and Bansal Receive Best Paper Award at CODES+ISSS 2003
DESCRIPTION:Professor Nikil Dutt and graduate students Mehrdad Reshadi\, Prabhat Mishra\, and Nikhil Bansal\, pictured below\, proudly display their Best Paper Awards received at the First IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (Codes + ISSS 2003) held at the Marriott Hotel and Tennis Club\, Newport Beach\, CA on October 1-3\, 2003. Their award winning technical paper was titled An Efficient Retargetable Framework for Instruction-Set Simulation. They also received a $1\,000 award in addition to their plaques. \n\nview larger image
URL:https://www.cecs.uci.edu/event/dutt-reshadi-mishra-and-bansal-receive-best-paper-award-at-codesisss-2003/
CATEGORIES:Awards
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040831T150000
DTEND;TZID=America/Los_Angeles:20040831T160000
DTSTAMP:20231011T190252Z
CREATED:20231011T190252Z
LAST-MODIFIED:20231011T190252Z
UID:14382-1093964400-1093968000@www.cecs.uci.edu
SUMMARY:Prof. Dutt Presents Keynote Speech
DESCRIPTION:Professor Nikil Dutt presented the Keynote Speech at the EUROMICRO Symposium on Digital System Design. The symposium was held at Rennes\, France.EUROMICRO Web Site
URL:https://www.cecs.uci.edu/event/prof-dutt-presents-keynote-speech/
CATEGORIES:Other Events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040817T150000
DTEND;TZID=America/Los_Angeles:20040817T160000
DTSTAMP:20231011T183336Z
CREATED:20231011T183336Z
LAST-MODIFIED:20231011T183336Z
UID:14299-1092754800-1092758400@www.cecs.uci.edu
SUMMARY:Taming Pointers – A Symbolic Approach
DESCRIPTION:Taming Pointers – A Symbolic Approach\n\n\n\n\nSpeaker\n\n\nProfessor Jianwen Zhu \nDepartment of Electrical and Computer Engineering\nUniversity of Toronto\, Canada\n\n\n\n\n\n\n\n\n\n\nCECS Host\n\n\nProfessor Daniel Gajski\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nMcDonnell Douglas Auditorium\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nTuesday\, August 17\, 2004\nRefreshments at 2:30pm\, Seminar begins at 3:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nThe silicon real estate available in systems-on-chip (SOC) has given hope for the massive-parallel\, high-performance implementation of complex applications. However\, new efforts in silicon compilers that synthesize applications in C into SOC cannot dodge an old problem\, called pointer analysis\, which has been actively pursued in the programming language and compiler community for two decades. The challenges of precise pointer analysis stem from the need to explore an exponential number of program execution paths\, and the need to maintain program state for every program point under all such paths. In this talk\, I will introduce a new method for constructing scalable graph algorithms (ICCAD’02\, PLDI’04)\, called superposition\, which solves different problem instances in an aggregate fashion. Applying this method to pointer analysis\, different program states under different execution paths are combined into a single Boolean function\, and solved together using the efficient\, BDD-based image computation operator developed by the formal verification community. Experimental results show that context-sensitive\, flow-insensitive analysis on programs with billions of different calling paths can be performed\, and benchmarks as large as GCC (200KLOC) can be completed in seconds. The subject of this talk can be of interest to researchers in CAD\, compiler\, software engineering and security.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n\n \nJianwen Zhu received the B.S degree in electrical engineering from the Tsinghua University\, Beijing\, China\, and the M.S. and Ph.D. degrees in computer science from the University of California\, Irvine\, in 1993\, 1996 and 1999 respectively. He is currently an assistant professor in the Department of Electrical and Computer Engineering\, University of Toronto\, Canada. He is the coauthor of the book SpecC: Specification Language and Methodology (Kluwer-Academic\, 2000). His research interest includes hardware/software codesign\, high-level synthesis for high-performance circuits and retargetable compilation. \n\n\n\n\n\nTaming Pointers – A Symbolic Approach\nclick on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/taming-pointers-a-symbolic-approach/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040808T150000
DTEND;TZID=America/Los_Angeles:20040808T160000
DTSTAMP:20231011T190302Z
CREATED:20231011T190302Z
LAST-MODIFIED:20231011T190302Z
UID:14383-1091977200-1091980800@www.cecs.uci.edu
SUMMARY:CECS ISLPED Open House
DESCRIPTION:
URL:https://www.cecs.uci.edu/event/cecs-islped-open-house/
CATEGORIES:Other Events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040630T150000
DTEND;TZID=America/Los_Angeles:20040630T160000
DTSTAMP:20231011T190302Z
CREATED:20231011T190302Z
LAST-MODIFIED:20231011T190302Z
UID:14384-1088607600-1088611200@www.cecs.uci.edu
SUMMARY:CECS End of the Year BBQ
DESCRIPTION:click on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/cecs-end-of-the-year-bbq/
CATEGORIES:Other Events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040604T110000
DTEND;TZID=America/Los_Angeles:20040604T120000
DTSTAMP:20231011T192748Z
CREATED:20231011T180419Z
LAST-MODIFIED:20231011T192748Z
UID:14229-1086346800-1086350400@www.cecs.uci.edu
SUMMARY:Practical Considerations for Power-Aware Real-Time Scheduling
DESCRIPTION:Lecture Slides \nPractical Considerations for Power-Aware Real-Time Scheduling\n\n\n\n\nSpeaker\n\n\nProfessor Sharon Hu\nDepartment of Computer Science and Engineering\nUniversity of Notre Dame\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nMcDonnell Douglas Auditorium\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nJune 4 \, 2004\nRefreshments at 10:30am\, Lecture begins at 11:00am\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nReal-time embedded systems are prevalent in many applications such as computing and communication appliances\, various transportation vehicles\, and medical instruments. A common feature of these systems is that their performance is largely dependent on how well the timing constraints are met. Besides timing requirements\, power consumption is becoming a major consideration in real-time embedded system design as VLSI technology continues its remarkable advances. Techniques to minimize power/energy consumption while satisfying the stringent timing constraints are critical to successful deployment of such systems.The focus of this talk is on the scheduling aspect of hard real-time systems implemented on processors with dynamic voltage scaling (DVS) capabilities. Scheduling to guarantee real-time demands can be a difficult problem. DVS processors introduce a new dimension to the problem. Including realistic considerations\, such as the overhead of transitioning from one voltage level\nto another\, brings yet more challenges. Research results in this area have largely ignored the limitations of practical DVS processors. This talk will discuss several recent results on dealing with non-ideal features of DVS processors for hard real-time systems.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n\n \nXiaobo Sharon Hu is an associate professor in the department of Computer Science and Engineering at the University of Notre Dame\, Notre Dame\, Indiana. She also holds a joint appointment in the department of Electrical Engineering at the same university. Her research interests include hardware-software codesign\, real-time embedded systems\, low-power system design\, VLSI design algorithms\, and computer-aided radiation treatment planning. She has published more than 80 papers in these areas and obtained a number research grants from both government and private industry. She was the Technical Program Co-Chair of the 9th International Symposium on Hardware/Software Codesign (CODES’2001) and the General Co-Chair of the same conference in 2002. She has been invited to serve on the program committees of a number of conferences in the electronic design automation field such as DAC\, ICCAD\, DATE\, ICCD\, CODES\, CASES\, etc. In 1997\, she received the NSF’s Faculty Early Career Development (CAREER) Award. A paper co-authored by Sharon Hu and her student received the Best Paper Award from the 38th ACM/IEEE Design Automation Conference in 2001.\n\n\n\nPractical Considerations for Power-Aware Real-Time Scheduling\nclick on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/practical-considerations-for-power-aware-real-time-scheduling/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040601T150000
DTEND;TZID=America/Los_Angeles:20040601T160000
DTSTAMP:20231011T190302Z
CREATED:20231011T190302Z
LAST-MODIFIED:20231011T190302Z
UID:14385-1086102000-1086105600@www.cecs.uci.edu
SUMMARY:Prof. Gajski Receives Mentor Award
DESCRIPTION:Professor Daniel D. Gajski received the first ever 2004 Graduate Mentor of the Year Award from the Donald Bren School of Information and Computer Sciences. This award was given in recognition of his devotion to graduating 4 PhD students in 2004 and 4 PhD students in 2003.
URL:https://www.cecs.uci.edu/event/prof-gajski-receives-mentor-award/
CATEGORIES:Other Events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040524T150000
DTEND;TZID=America/Los_Angeles:20040524T160000
DTSTAMP:20231011T193148Z
CREATED:20231011T180420Z
LAST-MODIFIED:20231011T193148Z
UID:14230-1085410800-1085414400@www.cecs.uci.edu
SUMMARY:Towards Better Compilers & Bug Finding for Sensor Networks
DESCRIPTION:Lecture Slides \nTowards Better Compilers & Bug Finding for Sensor Networks\n\n\n\n\nSpeaker\n\n\nProfessor Jens Palsberg\nComputer Science Department\nUniversity of California\, Los Angeles\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nMcDonnell Douglas Auditorium\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nMay 24\, 2004\nRefreshments at 2:30pm\, Lecture begins at 3:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nSensor-network programmers face tough challenges. They must maximize the network life time while managing resource tradeoffs among energy consumption\, stack space\, code size\, response time\, and throughput. For example\, a programmer can choose to inline a call and thereby decrease the response time and decrease the stack space\, but also increase the code size. \nAdditionally\, a programmer can choose to do more computation locally\non a sensor node and thereby decrease communication and the energy consumption\, but also increase the code size. Such tradeoffs make programming difficult and error prone. Most current compilers don’t help with making resource tradeoffs and there are few tools for finding resource bugs such as stack overflow. Can we design better compilers and bug-finding tools that will help out sensor-network programmers? \nIn this talk Jens Palsberg will examine the state of the art (TinyOS\, NesC\, TOSSIM)\, survey recent results on stack analysis and deadline analysis\, and give an overview of the UCLA compiler group’s project on building compiler and bug-finding tools for NesC and the Berkeley Mote sensor node platform.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n \nJens Palsberg is a Professor of Computer Science at UCLA. His research interests span the areas of compilers\, embedded systems\, programming languages\, software engineering\, and information security. He has authored over 70 technical papers\, co-authored the book Object-Oriented Type Systems\, and co-authored the 2002 revision of Appel’s textbook on Modern Compiler Implementation in Java. He is the recipient of National Science Foundation CAREER and ITR awards\, a Purdue University Faculty Scholar award\, and an Okawa Foundation research award. His research has also been supported by DARPA\, IBM\, Intel\, and British Telecom. He is an associate editor of ACM Transactions of Programming Languages and Systems\, a member of the editorial board of Information and Computation\, and a former member of the editorial board of IEEE Transactions on Software Engineering. He is serving as the general chair of the ACM Symposium on Principles of Programming Languages in 2005.\n\n\n\nTowards Better Compilers & Bug Finding for Sensor Networks\nclick on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/towards-better-compilers-bug-finding-for-sensor-networks/
CATEGORIES:Seminars at CECS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20040513T150000
DTEND;TZID=America/Los_Angeles:20040513T160000
DTSTAMP:20231011T192253Z
CREATED:20231011T180420Z
LAST-MODIFIED:20231011T192253Z
UID:14231-1084460400-1084464000@www.cecs.uci.edu
SUMMARY:Frequent Value Locality and its Applications
DESCRIPTION:Lecture Slides \nFrequent Value Locality and its Applications\n\n\n\n\nSpeaker\n\n\nProfessor Rajiv Gupta\nComputer Science Department\nUniversity of Arizona\n\n\n\n\n\n\n\n\n\n\nLocation\n\n\nMcDonnell Douglas Auditorium\n\n\n\n\n\n\n\n\n\n\nDate & Time\n\n\nMay 13\, 2004\nRefreshments at 2:30pm\, Lecture begins at 3:00pm\n\n\n\n\n\n\n\n\n\n\nAbstract\n\n\nBy studying the behavior of programs in the SPEC95 benchmark suite we have observed the frequent value phenomenon according to which a few values appear very frequently in memory locations and are therefore involved in a large fraction of memory accesses. Moreover we have observed that the set of frequent values remains stable over the execution of the program and these values are distributed fairly uniformly across the memory. In addition to describing the frequent value phenomenon I will describe two applications of the phenomenon. In the first application\, by transmitting values belonging to a dynamically changing set of frequent values in encoded form\, we greatly reduce the switching activity on a CPU’s external data bus. In the second application\, by storing values belonging to a fixed set of frequent values in compressed encoded form\, we significantly reduce energy consumed by the data cache.\n\n\n\n\n\n\n\n\n\n\nBiography\n\n\n  \n \nRajiv Gupta is a Professor of Computer Science at The University of Arizona. His areas of research interest include profile guided code optimization and program analysis; software tools; and performance\, power\, and memory issues in superscalar and embedded processors. Rajiv has published over 170 articles in refereed conferences and journals\, he holds 7 US patents\, and has supervised 12 PhD dissertations. Papers coauthored by him have been selected for: inclusion in 20 Years of PLDI (1979-1999)\, distinguished paper award in ICSE 2003\, most original paper award in ICPP 2003\, and outstanding paper award in ICECCS 1996. Rajiv received the NSF’s Presidential Young Investigator Award in 1991. He served as the Program Chair for PLDI’03 and HPCA’03 conferences. He has also been appointed as the Co-General Chair for CGO’05 and the Program Chair for LCTES’05 conferences. He serves as an Associate Editor for ACM Transactions on Architecture and Code Optimization\, Parallel Computing journal\, and Journal of Embedded Computing.\n\n\n\nFrequent Value Locality and its Applications\nclick on the thumbnails to view the full-sized images
URL:https://www.cecs.uci.edu/event/frequent-value-locality-and-its-applications/
CATEGORIES:Seminars at CECS
END:VEVENT
END:VCALENDAR