1997 - ACM Fellow For exceptional service to ACM and the computing profession, and for outstanding research contributions in data base systems and in computer/communication performance evaluation.
Distributed computing, Database, Data mining, Operating system and Parallel computing are his primary areas of study. Kenneth C. Sevcik has included themes like Layered queueing network, Queueing network models, G-network and Distributed concurrency control, Concurrency control in his Distributed computing study. His work on Query optimization as part of general Database research is frequently linked to Quality, bridging the gap between disciplines.
His Data mining research includes elements of Information bottleneck method, Mutual information, Cluster analysis and Bottleneck. Many of his research projects under Operating system are closely connected to Software design with Software design, tying the diverse disciplines of science together. His work in the fields of Computer multitasking overlaps with other areas such as Scalable parallelism, Dependency graph, Single parameter and Data parallelism.
His primary areas of investigation include Distributed computing, Parallel computing, Queueing theory, Scheduling and Data mining. His Distributed computing research includes themes of Variable bitrate, Multiprocessor scheduling, Concurrency control and Server. His Parallel computing study combines topics from a wide range of disciplines, such as Earliest deadline first scheduling and Round-robin scheduling.
In the subject of general Queueing theory, his work in Mean value analysis and Layered queueing network is often linked to Distribution, thereby combining diverse domains of study. His research in Scheduling focuses on subjects like Speedup, which are connected to Workload. His work in the fields of Data mining, such as Query optimization, intersects with other areas such as Spatial analysis.
Kenneth C. Sevcik mainly focuses on Variable bitrate, Data mining, Algorithm, Server and Scalability. His work deals with themes such as Distributed computing, Data striping and STREAMS, which intersect with Variable bitrate. Kenneth C. Sevcik has researched STREAMS in several fields, including Instruction prefetch and Parallel computing.
His work on Query optimization as part of his general Data mining study is frequently connected to Histogram matching, thereby bridging the divide between different branches of science. He interconnects Convergence, Queueing theory and Mean value analysis in the investigation of issues within Algorithm. His Server research incorporates elements of Scheduling and Bandwidth.
Kenneth C. Sevcik mostly deals with Query optimization, Set, Data mining, Online analytical processing and Data visualization. The study incorporates disciplines such as Cardinality, Column, Data set and Relational database in addition to Query optimization. The various areas that Kenneth C. Sevcik examines in his Data mining study include Data modeling, Scalability, Mutual information and Cluster analysis.
His Online analytical processing research overlaps with other disciplines such as View, IBM, Query by Example, Algorithm and Information extraction. His Data visualization studies intersect with other subjects such as Hierarchical database model, Overhead and Minimum description length.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The Grid File: An Adaptable, Symmetric Multikey File Structure
J. Nievergelt;Hans Hinterberger;Kenneth C. Sevcik.
ACM Transactions on Database Systems (1984)
The Grid File: An Adaptable, Symmetric Multikey File Structure
J. Nievergelt;Hans Hinterberger;Kenneth C. Sevcik.
ACM Transactions on Database Systems (1984)
Quantitative system performance: computer system analysis using queueing network models
Edward D. Lazowska;John Zahorjan;G. Scott Graham;Kenneth C. Sevcik.
Int. CMG Conference (1984)
Quantitative system performance: computer system analysis using queueing network models
Edward D. Lazowska;John Zahorjan;G. Scott Graham;Kenneth C. Sevcik.
Int. CMG Conference (1984)
Theory and Practice in Parallel Job Scheduling
Dror G. Feitelson;Larry Rudolph;Uwe Schwiegelshohn;Kenneth C. Sevcik.
job scheduling strategies for parallel processing (1997)
Theory and Practice in Parallel Job Scheduling
Dror G. Feitelson;Larry Rudolph;Uwe Schwiegelshohn;Kenneth C. Sevcik.
job scheduling strategies for parallel processing (1997)
Optimal Histograms with Quality Guarantees
H. V. Jagadish;Nick Koudas;S. Muthukrishnan;Viswanath Poosala.
very large data bases (1998)
Optimal Histograms with Quality Guarantees
H. V. Jagadish;Nick Koudas;S. Muthukrishnan;Viswanath Poosala.
very large data bases (1998)
The Method of Layers
J.A. Rolia;K.C. Sevcik.
IEEE Transactions on Software Engineering (1995)
The Method of Layers
J.A. Rolia;K.C. Sevcik.
IEEE Transactions on Software Engineering (1995)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Toronto
University of Saskatchewan
University of Toronto
Facebook (United States)
University of Michigan–Ann Arbor
University of Washington
University of Toronto
Carnegie Mellon University
William & Mary
University of Massachusetts Amherst
TU Wien
University of Waterloo
Federal Department of Defence, Civil Protection and Sports
Monash University
Centre national de la recherche scientifique, CNRS
Centro Internacional de Agricultura Tropical
Miami University
Institute of Cancer Research
United States Geological Survey
Cardiff University
Leiden University Medical Center
Ohio University - Lancaster
University of Sussex
University of California, Los Angeles
University of California, Los Angeles
York University