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
END:VTIMEZONE
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/
LOCATION:CA
CATEGORIES:Seminars at CECS
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/
LOCATION:CA
CATEGORIES:Seminars at CECS
END:VEVENT
END:VCALENDAR