Review on the paper entitled “A Fast File System for UNIX”

This is the review for the paper entitled “A Fast File System for Unix” by Marshall Kirk McKusick et. al. of the Computer Systems Research Group of University of California, Berkeley, rewritten in 1984.


The paper discussed about their reimplementation of UNIX file system where they adapt the system to a wide range of peripheral and processor characteristics. The new implementation of the system is tested to have ten times faster file access rate compared to the traditional UNIX file system. Several improvements on the file system were also discussed such as advisory locks on files, filename extension across file systems, ability to use long file names, and administrative control of resource usage.


The two major contributions  of this paper are the modifications in the file system organization.


  1. The first modification is on the storage utilization. The study optimized the storage utilization by increasing the block size. Through this bigger file can be transferred in a single disk transaction, thereby greatly increasing the throughput. However, Unix file system is composed of many small files, therefore large block size increases the space wasted. To resolve this issue. A single block is further partitioned into one or more addressable fragment. Since these fragments are addressable, multiple small files can reside on one data block.


  1. The second modification is on the file system reparameterization. This modification is essential to the perform an optimal configuration-dependent block allocations. Each file system used are parameterized and adapted to the type of disk where it is placed. The parameters used are the speed of the processor, the hardware support for mass storage transfers, and the characteristics of the mass storage devices.


Although this paper significantly improved the data transfer, the time to read and write the file is almost similar to the reading rate of the older file system. The writing rate of the new file system is 50% slower than the older file system, because the kernel has to do twice as many disk allocations per second.


Review on the paper entitled “A History and Evaluation of System R”

The paper  written by Donald Chamberlin et. al. under IBM Research Lab entitled “A History and Evaluation of System R” was published July 1981. In their paper, they discussed about an experimental database system called System R, where they demonstrate the usability advantages of the relational data model. It also discussed the lessons learned from the development of System R about the design of relational database systems.

The two major contributions  of this paper are the following.

1. The relational database system implementation (System R) where it provides a high-level non-navigational user interface that can support different types of rapidly changing database environments with concurrent users and has the capability to be in a consistent state after a failure.

2. To develop a fully operational database system, researchers followed a three phase program where in the first phase is the development of SQL. A high-level data sublanguage that the System R used to compile database queries into machine level codes.

Based from the experiments done in phase 2 of the System R project, the performance of relational database system is not yet equal to the navigational system where in paths and pointers are used to navigate among data nodes. However, the study hopes for more use of the system in the years ahead since relational database is more likely to be able to adapt to a broad spectrum of unanticipated applications.

Review on the paper entitled “The Unix Time-Sharing System”

The paper  written by Dennis Ritchie and Ken Thompson under Bell Laboratories was published July 1964. In their paper, they discussed about about a simple, multi-user, and interactive operating system called Unix for the computer PDP-11/40 and 45. The paper was organized as follows.

The first part of the paper briefly discussed the implemented operating system where they compare it to existing larger operating systems. They also listed the number of functionalities that the operating system can support. These are  assembler, text editor based on QED, linking loader, symbolic debugger, compiler for a language resembling BCPL  with types and structures (C), interpreter for a dialect of BASIC, text formatting program, Fortran compiler, Snobol interpreter, top-down compiler- compiler (TMG),  bottom-up compiler-compiler (YACC), form letter generator, macro processor (M6), and permuted index program. The main advantage of Unix compared to the larger system is that it is simple, elegant, and easy to use.

In the second section, they discussed about the file system used. In unix there are three types of files, these are ordinary, directory, and special files. An ordinary file contains information as strings separated by a new line. A directory imposes a structure of the set of ordinary files. It lets the user to organize the ordinary files into a tree form. The tree structure was imposed by defining a root directory, where all searches start. Every directory has a parent directory and all directories is rooted at the root directory. One major contribution of this paper is on allowing  links which are not allowed in existing larger operating systems. Instead of the actual directory, links are pointers to a directory. What happens to a directory happens to all links that are pointed in that directory. The third type of file is called special files. These files are associated with I/O devices that are supported by UNIX, examples of which are mountable devices such as external memory drives. Treating I/O devices as files, according to the paper has threefold advantage.

The advantages are the following.  “File and device I/O are as similar as possible; file and device names have the same syntax and meaning, so that a program expecting a file name as a parameter can be passed as device name; finally, special files are subject to the same protection mechanism as regular files.”

Aside from the three different versions of files, the paper also discussed about  file protection. i.e. control scheme used by UNIX. Where capability to read, write, or execute is controlled by a 7 bit information about the file.

The paper also discussed about I/O calls, from files in the main memory or from a mountable device. Files in mountable devices when mounted will be a subtree  of the file system from the root. Links between two separated memory drives are not allowed. They also discussed the implementation of the file system. In their implementation, each file has the following description.

1. Its owner.

2. Its protection bits.

3. The physical disk or tape addresses for the file contents.

4. Its size.

5. Time of last modification

6. The number of links to the file, that is, the number of times it appears in a directory.

7. A bit indicating whether the file is a directory.

8. A bit indicating whether the file is a special file.

9. A bit indicating whether the file is “large” or “small.”

A file is represented by an i-node where all information about the file is stored, the list of all files are called i-list.

Sections 5 and 6 of the paper discussed about the functionality of the operating system. In particular, how processes are called and executed. The paper also introduced the shell. It is a program that is responsible for interpreting commands from the user. Statistics on the performance of the operating system were also presented in the paper. However, interpretations of the statistics were not presented.

Sections 5 and 6 of the paper discussed about the functionality of the operating system. In particular, how processes are called and executed. The paper also introduced the shell. It is a program that is responsible for interpreting commands from the user. Statistics on the performance of the operating system were also presented in the paper. However, interpretations of the statistics were not presented.

One major flaw I have read in the paper is the number of hardware faults experienced by the PDP-11 where it has references to nonexistent of memory or unimplemented instructions.



You are invited to a Special Lecture on







Gary G. Yen, Fellow IEEE, Fellow IET

Oklahoma State University

School of Electrical and Computer Engineering


November 23, 2012 (Friday), 2:00 – 3:00 pm

Accenture Ideas Room, Department of Computer Science

Alumni Engineers Centennial Hall, UP Diliman



Evolutionary computation is the study of biologically motivated computational paradigms which exert novel ideas and inspiration from natural evolution and adaptation.  The applications of population-based heuristics in solving multiobjective optimization problems have been receiving a growing attention.  To search for a family of Pareto optimal solutions based on nature-inspiring problem solving paradigms, Evolutionary Multiobjective Optimization Algorithms (EMOs) have been successfully exploited to solve optimization problems in which the fitness measures and even constraints are uncertain and changed over time.

In this talk, I will overview the state of the art in the areas of Computational Intelligence and Evolutionary Multiobjective Optimization, aiming at the graduate students and researchers without much exposure to these growing technical fields.


About the Speaker

Gary G. Yen received the Ph.D. degree in electrical and computer engineering from the University of Notre Dame in 1992.  He is currently a Professor in the School of Electrical and Computer Engineering, Oklahoma State University.  His research interest includes intelligent control, computational intelligence, evolutionary multiobjective optimization, conditional health monitoring, signal processing and their industrial/defense applications.

Gary was an associate editor of the IEEE Transactions on Neural Networks and IEEE Control Systems Magazine during 1994-1999, and of the IEEE Transactions on Control Systems Technology, IEEE Transactions on Systems, Man and Cybernetics and IFAC Journal on Automatica and Mechatronics during 2000-2010.  He is currently serving as an associate editor for the IEEE Transactions on Evolutionary Computation.  Gary served as Vice President for the Technical Activities, IEEE Computational Intelligence Society in 2004-2005 and is the founding editor-in-chief of the IEEE Computational Intelligence Magazine, 2006-2009.  He was the President of the IEEE Computational Intelligence Society in 2010-2011 and is elected to be a Distinguished Lecturer for the term 2012-2014.  He received Regents Distinguished Research Award from OSU in 2009, 2011 Andrew P Sage Best Transactions Paper award from IEEE Systems, Man and Cybernetics Society, and 2013 Meritorious Service award from IEEE Computational Intelligence Society.  He is a Fellow of IEEE and IET.







(SMACS 2012)

4 – 8 DECEMBER 2012

La Carmela Hotel


organized by

The Computing Society of the Philippines

SIG-Mathematical Aspects of Computer Science




About the Symposium…

SMACS 2012 is the sixth meeting on the mathematical aspects of computer science that will be held in the Philippines organized by the Computing Society of the Philippines. The first was in 1997 (UPCB), the second was in 2004 (UP-Baguio), the third was in 2006 (AUP, Cavite), the fourth was in 2008 (UP Cebu Colleges), and the fifth was in 2010 (UP Lon Banos, Laguna).


This year’s SMACS will be divided into two parts, workshop (4-6 December 2012) and seminar (7-8 December 2012). The workshop is designed such that researchers and instructors/lecturers of computing and mathematical sciences could interact on selected topics. Topics of the workshop will be tutorial in character which would lead to possible research collaboration. This year’s topics are:


    1. Computer Security and Cryptography

    2. Parallel Algorithms

    3. Coding Theory


The seminar will consist of paper presentations on researches in the mathematical aspects of computer science. There will be invited talks on the current and still potent area of mathematical aspects of computer science.


SMACS provides a venue for teachers, researchers and graduate students of Computer Science, Computing, and Mathematics to share and upgrade knowledge on areas of Computer Science which are mathematical or theoretical in character.


Topics of Interest (but not limited to):

Computability, Automata Theory and Formal Languages, Complexity Theory, Theory of Algorithms, Parallel Algorithms, Numerical Analysis, Combinatorial Optimization, Network Theory, Mathematical Modeling and Simulation, Logic and Logic Programming, Theory of Programming Languages, Coding Theory, Cryptography and Computer Security, Discrete Mathematics for Computer Science, Computational Mathematics, BioInformatics, Natural Computing


Submission and Proceedings:

Paper to be submitted must be written in English and must be at most 12 pages including title page; if appropriate, proofs should be attached in an appendix. We highly recommend electronic submission using the SMACS submission webpage submission of papers or submission of previously submitted papers to any other conference with published proceedings are not allowed.


Proceedings of the Seminar will be available during the Symposium. Selected papers from the symposium will be published in a special issue of the Philippine Computing Journal, the Official journal of the Computing Society of the Philippines.


Organizing Committee: Jimmy D.L. Caro, UPD, Chair 

Program Committee:  Allan A. Sioson, ADNU, Co-Chair, Henry N. Adorna, UPD, Co-Chair


Important Dates:

Deadline of Paper Submission ………… 15 October 2012 (extended)

Notification of Acceptance …………….. 15 November 2012

Submission of Revised Paper ………….. 30 November 2012

Conference Date …………………………. 4-8 December 2012

How to reset the motherboard

Resetting the BIOS or the motherboard may fix CHECKSUM ERROR.

To do this, try resetting the jumper on the motherboard.

This will change the BIOS setup to factory setting.

Please see the following description for more information.


Jumper pins

Jumpers are small pins on the board with plastic or metal devices that go over the pins. This device is called a bridge or a jumper cap. When the bridge is connected to any two pins via a shorting link, it completes the circuit and a certain configuration has been achieved.

Jumper cap

A metal bridge that closes an electrical circuit. Typically, a jumper consists of a plastic plug that fits over a pair of protruding pins. Jumpers are sometimes used to configure expansion boards. By placing a jumper plug over a different set of pins, you can change a board’s parameters.