Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

James T. Wilkes

dblp:27/6556 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 3Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 87% High-performance computing · 13%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Operating systems › resource management
memory management
0.011991
Exploiting Operating System Support for Dynamic Page Placement on a NUMA Shared Memory Multiprocessor · PPoPP 1991
Memory systems › page placement
dynamic page placement
0.011991
Exploiting Operating System Support for Dynamic Page Placement on a NUMA Shared Memory Multiprocessor · PPoPP 1991
Memory systems › memory management
NUMA memory management
0.011991
Exploiting Operating System Support for Dynamic Page Placement on a NUMA Shared Memory Multiprocessor · PPoPP 1991
High-performance computing › scientific computing
scientific computing application
0.011991
Exploiting Operating System Support for Dynamic Page Placement on a NUMA Shared Memory Multiprocessor · PPoPP 1991

Methods — techniques the papers use, named apart from their topics

case study · 0.0
YearPublicationVenuePosition
2002 Scientific experimentation via the matching game
abstract
In traditional computer science curricula, students view program implementation as the end product and not the means to obtaining some further result. All too often students complete an implementation at the last minute, perform a minimal amount of testing and call the assignment done! This paper discusses an approach we have taken in our courses to have students use and develop programs as part of a scientific inquiry. In addition to causing students to perform more thorough testing, our approach also improves empirical and critical thinking skills.
James B. Fenwick Jr., Cindy Norris, James T. Wilkes
SIGCSE3
1999 Computer systems "conference" for teaching communication skills
abstract
In an effort to improve the communication skills of students, many universities are requiring computer science educators to include writing and speaking components in their courses. This paper describes an alternative to the classic term paper assignment. A "student conference" approach has been successfully employed in a junior-level computer systems course for five semesters. Each student performs an implementation and experimental study, then writes a research-style technical paper on this work. Students also participate in an anonymous review process, revise their own papers, and make oral presentations of their work. The structure of this conference approach, representative assignments, and observations are presented.
Cindy Norris, James T. Wilkes
SIGCSE2
1997 Application-based modules using apprentice learning for CS 2
abstract
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; large programming projects; and more advanced object-oriented concepts. Integrating these topics into assignments is a challenging task; educators often duplicate work done by others in re-inventing such assignments. At the same time, these assignments and large programs take time to develop and are often changed from semester to semester to preclude cheating. We report on a project that provides modules containing many kinds of programming and lab assignments which can be re-used across semesters with accessible and exciting application-oriented materials. Our project is a collaboration between a research and teaching oriented private university, a teaching oriented public university, and a teaching oriented historically black university. This helps ensure that the modules will be accessible to nearly all student populations. The modules developed are available electronically as hyper-text documents.
Owen L. Astrachan, Robert F. Smith, James T. Wilkes
SIGCSE3
1991 Exploiting Operating System Support for Dynamic Page Placement on a NUMA Shared Memory Multiprocessor
abstract
Shared memory multiprocessors are attractive because they are programmed in a manner similar to uniprocessors. The UMA class of shared memory multiprocessors is the most attractive, from the programmer's point of view, since the programmer need not be concerned with the placement of code and data in the physical memory hierarchy. Scalable shared memory multiprocessors, on the other hand, tend to present at least some degree of non-uniformity of memory access to the programmer, making the NUMA class an important one to consider. In this paper, we investigate the role that DUnX, an operating system supporting dynamic page placement on a BBN GP1000, might play in simplifying the memory model presented to the applications programmer. We consider a case study of psolu, a real scientific application originally targeted for a NUMA architecture. We find that dynamic page placement can dramatically improve the performance of a simpler implementation of psolu targeted for an UMA memory architec...
Richard P. LaRowe Jr., James T. Wilkes, Carla Schlatter Ellis
PPoPP2