This article is an autobiography or has been extensively edited by the subject or by someone connected to the subject.(March 2024) |
Avi Silberschatz | |
---|---|
Alma mater | Stony Brook University Yale University The Hebrew Reali School |
Known for | database systems operating systems |
Awards | ACM Fellow IEEE Fellow AAAS Fellow IEEE Taylor L. Booth Education Award (2002) ACM Karl V. Karlstrom Outstanding Educator Award (1998) ACM SIGMOD Contribution Award (1997) 2019 VLDB Test of Time Award |
Scientific career | |
Fields | Computer Science |
Institutions | Yale University |
Doctoral advisor | Arthur Bernstein Richard Kieburtz |
Doctoral students | C. Mohan Raghu Ramakrishnan |
Website | http://www.cs.yale.edu/~avi/ |
Avi Silberschatz (born in Haifa, Israel) is an Israeli computer scientist and researcher. He finished high school at the Hebrew Reali School in Haifa, and graduated in 1976 with a Ph.D. in computer science from the State University of New York (SUNY) at Stony Brook. His research interests include database systems, operating systems, storage systems, and network management.
He held a professorship at the University of Texas at Austin, where he taught until 1993. He became a professor at Yale University in 2005, where he was the chair of the Computer Science department from 2005 to 2011. Prior to coming to Yale in 2003, Silberschatz worked at the Bell Labs.
Silberschatz was elected an ACM Fellow in 1996 and received the Karl V. Karlstrom Outstanding Educator Award in 1998. [1]
He was elected an IEEE fellow in 2000 [2] for contributions to the development of computer systems dealing with the efficient manipulation and processing of information. [3]
He received the IEEE Taylor L. Booth Education Award in 2002 for "teaching, mentoring, and writing influential textbooks in the operating systems and database systems areas". [4]
He was elected an AAAS fellow in 2009. [5]
Silberschatz is a member of the Connecticut Academy of Science and Engineering. [6]
Mainframe operating systems have an acquired dinosaur trope that even their manufacturers recognize. [7] Peter B. Galvin, co-author, notes that the series of books became informally known as the dinosaur book due to the illustrations on the front cover [8] depicting the various operating systems as actual dinosaurs. [9] [10]
Peter Gabriel Neumann is a computer-science researcher who worked on the Multics operating system in the 1960s. He edits the RISKS Digest columns for ACM Software Engineering Notes and Communications of the ACM. He founded ACM SIGSOFT and is a Fellow of the ACM, IEEE, and AAAS.
Hardware abstractions are sets of routines in software that provide programs with access to hardware resources through programming interfaces. The programming interface allows all devices in a particular class C of hardware devices to be accessed through identical interfaces even though C may contain different subclasses of devices that each provide a different hardware interface.
A process control block (PCB), also sometimes called a process descriptor, is a data structure used by a computer operating system to store all the information about a process.
Professor Sartaj Kumar Sahni is a computer scientist based in the United States, and is one of the pioneers in the field of data structures. He is a distinguished professor in the Department of Computer and Information Science and Engineering at the University of Florida.
nice
is a program found on Unix and Unix-like operating systems such as Linux. It directly maps to a kernel call of the same name. nice
is used to invoke a utility or shell script with a particular CPU priority, thus giving the process more or less CPU time than other processes. A niceness of -20 is the lowest niceness, or highest priority. The default niceness for processes is inherited from its parent process and is usually 0.
Charles Eric Leiserson is a computer scientist and professor at Massachusetts Institute of Technology (M.I.T.). He specializes in the theory of parallel computing and distributed computing.
In computer science, a multilevel feedback queue is a scheduling algorithm. Scheduling algorithms are designed to have some process running at all times to keep the central processing unit (CPU) busy. The multilevel feedback queue extends standard algorithms with the following design requirements:
In the mathematical discipline of graph theory, a feedback vertex set (FVS) of a graph is a set of vertices whose removal leaves a graph without cycles. Equivalently, each FVS contains at least one vertex of any cycle in the graph. The feedback vertex set number of a graph is the size of a smallest feedback vertex set. The minimum feedback vertex set problem is an NP-complete problem; it was among the first problems shown to be NP-complete. It has wide applications in operating systems, database systems, and VLSI chip design.
In computer science, The System Contention Scope is one of two thread-scheduling schemes used in operating systems. This scheme is used by the kernel to decide which kernel-level thread to schedule onto a CPU, wherein all threads in the system compete for the CPU. Operating systems that use only the one-to-one model, such as Windows, Linux, and Solaris, schedule threads using only System Contention Scope.
Yale Nance Patt is an American professor of electrical and computer engineering at The University of Texas at Austin. He holds the Ernest Cockrell, Jr. Centennial Chair in Engineering. In 1965, Patt introduced the WOS module, the first complex logic gate implemented on a single piece of silicon. He is a fellow of both the Institute of Electrical and Electronics Engineers and the Association for Computing Machinery, and in 2014 he was elected to the National Academy of Engineering.
In computer science, synchronization is the task of coordinating multiple of processes to join up or handshake at a certain point, in order to reach an agreement or commit to a certain sequence of action.
The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after the American computer scientist Donald E. Knuth.
David Gries is an American computer scientist at Cornell University, United States mainly known for his books The Science of Programming (1981) and A Logical Approach to Discrete Math.
Edward Joseph McCluskey was a professor at Stanford University. He was a pioneer in the field of Electrical Engineering.
A dirty bit or modified bit is a bit that is associated with a block of computer memory and indicates whether the corresponding block of memory has been modified. The dirty bit is set when the processor writes to (modifies) this memory. The bit indicates that its associated block of memory has been modified and has not been saved to storage yet. When a block of memory is to be replaced, its corresponding dirty bit is checked to see if the block needs to be written back to secondary memory before being replaced or if it can simply be removed. Dirty bits are used by the CPU cache and in the page replacement algorithms of an operating system.
A wait-for graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems.
In computer science for Operating systems, aging or ageing is a scheduling technique used to avoid starvation. Fixed priority scheduling is a scheduling discipline, in which tasks queued for utilizing a system resource are assigned a priority each. A task with a high priority is allowed to access a specific system resource before a task with a lower priority is allowed to do the same. A disadvantage of this approach is that tasks assigned with a lower priority may be starved when a large number of high priority tasks are queued. Aging is used to gradually increase the priority of a task, based on its waiting time in the ready queue.
This page is a glossary of Operating systems terminology.
Daniel P. Siewiorek is an American computer engineer and computer scientist, currently the Buhl University Professor Emeritus of Electrical and Computer Engineering and Computer Science at Carnegie Mellon University.
Henry Francis Korth is a professor of Computer Science and Engineering and co-director of the Computer Science and Business program at Lehigh University.
Peter Galvin has written up a very nice description