arungeek
Hacks and Tweaks



Uncategorized

October 6, 2009

How to Increase Hard Disk Speed

More articles by »
Written by: arunenigma


To speed up your hard disk we need to configure a special buffer in the computer’s memory in order to enable it to better deal with interrupts made from the disk.

This tip is only recommended if you have 256MB RAM or higher.

Follow these steps:

Run SYSEDIT.EXE from the Run command.

Expand the system.ini file window.

Scroll down almost to the end of the file till you find a line called [386enh]

Press Enter to make one blank line, and in that line type

Irq14=4096

Note: This line IS CASE SENSITIVE !!

Click on the File menu, then choose Save.

Close SYSEDIT and reboot your computer.

Speed improvement will be noticed after the computer reboots.

Update: The most speed improvement is visible with IDE drives, however there are reports that this tweak also does good for SCSI disks. In any case, it won’t harm your system, so why not try it yourself and let me know what you find.



About the Author

arunenigma
Computer Science Graduate Student @ Case Western Reserve University, Cleveland, USA




 
 

 
Factory_1

Python Factory Design Patterns using Switch Case

I googled for Factory Method Design Pattern in Python but couldn’t find a good resource. So, I  am sharing an example program to demonstrate this design pattern in Python which I frequently use. The factory method pattern is...
by arunenigma
 

 
 
Gospers_glider_gun

Conway’s Game of Life Implemetation in Python with cool patterns

he Game of Life (or simply Life) is not a game in the conventional sense. There are no players, and no winning or losing. Once the “pieces” are placed in the starting position, the rules determine everything that ha...
by arunenigma
 

 
 
bin-tree

Python AVL Tree Implementation with ASCII visualization

n computer science, an AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any tim...
by arunenigma
 

 

 
bst

Binary Search Tree in Python with ASCII art visualization

Binary search tree implementation in Python with: in, post and pre-order traversals. Also includes methods for insertion, deletion and search of nodes. Deletion is fairly complex and is made possible by keeping track of parents...
by arunenigma
 

 
 
fibonacci

Python, Memoization, Dynamic Programming, Fibonacci Series and some Fun!

ython can implement the recursive formulation directly, caching return values. Memoization is a method where if a call is made more than once with the same arguments, and the result is returned directly from the cache. For exam...
by arunenigma
 

 




0 Comments


Be the first to comment!


You must be logged in to post a comment.