12.07.2015 Views

2003-2004 Department of Computer Science and Engineering

2003-2004 Department of Computer Science and Engineering

2003-2004 Department of Computer Science and Engineering

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

CSE <strong>2004</strong>Rida A. BazziAssociate Pr<strong>of</strong>essorE-mail: bazzi@asu.eduPhone: 480-965-2796Office: BY 430Ph.D. Georgia Institute <strong>of</strong> Technology, 1994Rida Bazzi joined ASU in August 1996. Priorto that he was an assistant pr<strong>of</strong>essor atFlorida International University, Miami, FL. In1995 he was a senior consultant at I-cube,Cambridge, MA.Principal Areas <strong>of</strong> Teaching <strong>and</strong> Research:Bazzi’s research focuses on distributedcomputing, s<strong>of</strong>tware engineering fordistributed systems, fault-tolerance algorithms,<strong>and</strong> computer vision.Honors <strong>and</strong> Distinctions:■ NSF CAREER AwardSelected Publications:R.A. Bazzi <strong>and</strong> G. Neiger, “Simplifying FaultTolerance: Providing the Abstraction <strong>of</strong> CrashFailures,” Journal <strong>of</strong> the ACM, vol. 48, no. 3,May 2001, pp. 499-554.R.A. Bazzi, “Access cost for asynchronousByzantine quorum systems,” DistributedComputing, vol. 14, no. 1, Jan. 2001, pp. 41-48R.A. Bazzi, “Planar Quorums,” Theoretical<strong>Computer</strong> <strong>Science</strong>, vol. 243, nos. 1-2, July2000, pp. 243-268.F. Karablieh, R.A. Bazzi, <strong>and</strong> M. Hicks,“Compiler-Assisted HeterogeneousCheckpointing,” Proc. 20th Symp. ReliableDistributed Systems (SRDS 2001).R.A. Bazzi, “The complexity <strong>of</strong> almost optimalcoordination,” Algorithmica, vol. 17, 1997, pp.308-321.Tom BoydLecturerE-mail: Thomas.A.Boyd@asu.eduPhone: 480-965-3689Office: BY 416Ph.D. Arizona State University, 2001Tom Boyd joined ASU in 2001. Before that heworked for more than 30 years in industriessuch as banking, telephony, manufacturing<strong>and</strong> insurance adjudication systems. He hashad experiences in s<strong>of</strong>tware <strong>and</strong> hardwaredesign, development, sales, support <strong>and</strong>management.Principal Areas <strong>of</strong> Teaching <strong>and</strong> Research:Boyd’s research interests include distributedcomputing, computing communities, processmigration, s<strong>of</strong>tware decay <strong>and</strong> failureprevention. He currently focuses on teachingcomputer science topics <strong>and</strong> researchings<strong>of</strong>tware failure prevention.Selected Publications:T. Boyd <strong>and</strong> P. Dasgupta, “Preemptive ModuleReplacement Using the Virtualizing OperatingSystem,” Workshop on Self-Healing (SHAMAN'02).T. Boyd <strong>and</strong> P. Dasgupta, “Process Migration:A Generalized Approach using a VirtualizingOperating System,” Proc. 22nd Int’l Conf. onDistributed Computing Systems (2002), pp.385-392.T. Boyd <strong>and</strong> P. Dasgupta, “Injecting DistributedCapabilities into Legacy Applications ThroughCloning <strong>and</strong> Virtualization,” Proc. Int’l Conf. onParallel <strong>and</strong> Distributed ProcessingTechniques <strong>and</strong> Applications (2000).T. Boyd <strong>and</strong> P. Dasgupta, “VirtualizingOperating Systems for Seamless DistributedEnvironments,” Proc. IASTED Int’l Conf.onParallel <strong>and</strong> Distributed Computing <strong>and</strong>Systems (2000), vol. 2, pp. 735-740.Hasan ÇamAssistant Pr<strong>of</strong>essorE-mail: hasan.cam@asu.eduPhone: 480-727-6348Office: BY 596Ph.D. Purdue University, 1992Hasan Cam joined ASU in 2001.Principal Areas <strong>of</strong> Teaching <strong>and</strong> Research:Çam’s research interests include wirelesscellular <strong>and</strong> sensor networks, computernetworks, low-power processor architectures,<strong>and</strong> interconnection networks.Honors <strong>and</strong> Distinctions:■ Editorial Board Member, "<strong>Computer</strong>Communications" <strong>and</strong> "International Journal<strong>of</strong> Communications Systems"Selected Publications:H. Çam, “Nonblocking OVSF Codes <strong>and</strong>Enhancing Network Capacity for 3G Wireless<strong>and</strong> Beyond Systems,” <strong>Computer</strong>Communications, vol. 26, no. 17, Nov. <strong>2003</strong>,pp. 1907-1917.H. Çam, “Rearrangeability <strong>of</strong> (2n-1)-StageShuffle-Exchange Networks,” SIAM Journal onComputing, vol. 32, no. 3, Mar. <strong>2003</strong>, pp. 557-585.H. Çam <strong>and</strong> J.A.B. Fortes, “Work-EfficientRouting Algorithms for RearrangeableSymmetrical Networks,” IEEE Transactions onParallel <strong>and</strong> Distributed Systems, vol. 10, no.7, July 1999, pp. 733-741.H. Çam <strong>and</strong> J.A.B. Fortes, “Frames: a simplecharacterization <strong>of</strong> permutations realized byfrequently used networks,” IEEE Transactionson <strong>Computer</strong>s, vol. 44, May 1995, pp. 695-697.H. Çam <strong>and</strong> J.A.B. Fortes, “A fast VLSIefficientself-routing permutation network,”IEEE Transactions on <strong>Computer</strong>s, vol. 44,March 1995, pp. 448-453.H. Çam, “A Multiclass Priority-Based Slotted-Ring Network for LAN-ATM Interworking,”<strong>Computer</strong> Communications, vol. 20, no. 13, 25Nov. 1997, pp. 1216-1224.30 COMPUTER SCIENCE & ENGINEERING

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!