This Site is Full Of Entertainment


How to Jailbreak iOS 6.1.6 on iPhone 3GS, iPod Touch 4G with P0sixspwn

p0sixspwn – the untethered jailbreak for iPhone 3GS and iPod Touch 4G has been updated with iOS 6.1.6 support. Apple pushed iOS 6.1.6 firmware for iPhone 3Gs and iPod Touch 4G to fix some serious vulnerability related to SSL. Soon after its availability, p0sixspwn jailbreak tool also gets updated with iOS 6.1.6 support in Cydia. p0sixspwn has been created by iH8sn0w, Winocm and Squiffypwn.

If you’re running an older version of iOS on your iPhone 3GS or iPod Touch 4G, it’s highly recommended to update to iOS 6.1.6, as it patches a serious SSL vulnerability. And after the update, there’s no need to worry about the jailbreak, because p0sixspwn is available as an untethered iOS 6.1.6 solution.

p0sixspwn has not been released as a standalone jailbreak tool for iOS 6.1.6, rather it’s a Cydia package that converts a tethered jailbroken device into an untethered one. It means that before applying p0sixspwn, you will have to tether jailbreak your iPhone 3GS or iPod Touch 4G with RedSn0w and then install p0sixspwn from Cydia to achieve the untethered jailbreak.


Jailbreak iOS 6.1.6 on iPhone 3GS and iPod Touch 4G

Step 1 – Tether jailbreak
Since p0sixspwn is a Cydia package that converts an already tethered jailbroken device into an untethered one, first we’ll have to tether jailbreak the iPhone 3GS or iPod Touch 4G on iOS 6.1.6 with RedSn0w.

Simply follow these steps to tether

And make sure to tether boot it after the tether jailbreak

Step 2 – Install p0sixspwn 1.4-1

Once the device is tethered jailbroken, launch Cydia, search and  install p0sixspwn 1.4-1 package to convert the tethered jailbreak into an untethered jailbreak on iPhone 3GS or iPod Touch 4G.


p0sixspwn-ios 6.1.6-jailbreak

iH8Sn0w, in a tweet, has noted that the standalone p0sixspwn jailbreak tool is not a priority. So, for now, this is the only way to jailbreak iOS 6.1.6 on iPhone 3GS and iPod Touch 4G.



hadware lab


Short Code Service In India

What Are Short Codes?

Short codes are mobile numbers that are significantly shorter than regular mobile numbers (usually 10 digits) which are used for SMS, MMS and Interactive Voice Services. The idea behind short codes is to make them easy to remember. For example: Indiatimes has the short code 5-8888 in India, while Star India has 5-7825 (i.e. 5-STAR on a keypad). Messages sent to a short code can be toll free or – in most cases – more expensive than a regular SMS.

Short codes are used for buying content, interacting with a help menu, voting on TV programmes, listening to mobile radio, and a host of other services. Telecom operators, VAS service providers and TV channels use Short Codes for generating revenue.

Short Code Services In India

Short codes are owned by mobile operators, and those listed below have merely licensed the code from each operator. Which means, an operator can choose not to allow a short code to function on its network by simply not renewing the annual license.

51315 – Wisync Technologies
51515 – AOL Mobile
51516 – AOL Mobile
52121 – Future Telecom
52272 – Mobile2Win India
52424 – Living Media / Aaj Tak / India Today
52455 – Activemedia
52525 – Sony Entertainment Television
52580 – Verity Marketing
52622 – Television Eighteen

52626 – Nei Technologies
52727 – Elation Softnet
52742 – Cricinfo / Cricinfi India
52919 – Radio Indigo / Indigo Mass Communications
53003 – Cellcast / BID2WIN
53030 – One97 / Positive Comsol
53040 – Mumbai Traffic Police
53131 – Unisys Info
53366 – Onyx Mobile
53434 –
53456 – Mobile Teleshoppe
53536 – ACube Promotion
53636 – Activemedia
53650 – Mid Day
53776 – ESPN
53999 – A & M Communications (JustDial?)

53999 – Just Dial
54242 – Hindustan Times
54321 – Sakal Papers
54545 – Sify
54555 – TechShastra
54567 – DNA Networks
54646 – Hungama / Virtual Marketing
54664 – Google
54684 – Netxcell
54767 – Nano Wicore Labs
54848 – Deccan Herald
54959 – Net 4 Nuts
54999 – Tanla Solutions
55040 – J Four Source
55050 – Bharat Matrimony
55352 – Voicegate Technology

55435 – IndiaGames
55454 – BIG FM 92.7
55555 – Nokia India
55599 – Mkhoj
55627 – Inter Solutions
55678 – Handygo
55858 – SUN TV Ltd
56006 – WIFI Network
56060 – Techzone / 6060
56070 – ValueFirst
56161 – Air2Web India
56262 – Air2Web India
56263 – IMI Mobile
56300 – Cellebrum
56363 – Nazara Technology
56365 – Sybase 365
56388 – NDTV (Lifetree)
56397 – Hindu Publications
56545 – Suvidha
56555 – Orkut
56566 – Pyro Mobile
56569 – Anand Bazar Patrika
56633 – Tata Sky
56636 – ADCC Research & Computing Center
56644 – Cellcast / (Bid2Win)
56677 – Cellnext Solutions
56767 – ACL Wireless
5676744 – All India Radio
56776 – Malayala Manorama
56858 – Flight Raja / Via
56882 – MTV
56886 – Ebay (Lifetree)
56969 – Rajasthan Patrika
57007 – Mauj / People Infocomm
57070 – Verseas Marketing
57245 – IRCTC Ltd.
57272 – J9 Mobile / Jagran Prakashan
57333 – India
57337 – MAA Television
57474 – MSN
57575 – Cornershop Entertainment (ZeeTV & PLAY TV)
57777 – Symbiotic
57827 – STAR India
57886 –
58243 – Yahoo Web Services
58558 – Mobile2Win
58888 – Times Internet Ltd (Indiatimes)
58989 – Four Interactive / AskLaila
58990 – Neo Sports
59595 – GoBindas
59898 – MPOWER
59994 – blowurmind
59995 – UTV

Alphanumeric Short Codes

As per TRAI guidelines, SMS’s are sent according to the following alphanumeric format: XY-SenderName, where X refers to the service provider and Y refers to the service area.

If you receive an SMS from AD-MEDIANAMA, that means that the SMS has been sent by MEDIANAMA, originating on Airtel’s network, from the Delhi service area. The codes mandated by TRAI are as follows:

Service Provider Codes (X):

A: Bharti Airtel and Bharti Hexacom
C: Datacom
D: Aircel and Dishnet Wireless
E: Reliance Telecom
I: Idea Cellular, Aditya Birla Telecom
L: Loop Telecom and BPL
P: Spice Communications
R: Reliance Communications
S: S. Tel Ltd
T: Tata Teleservices, Tata Teleservices Maharashtra
U: Unitech Group of Companies (Telenor)
V: Vodafone Group of Companies
W: Swan Telecom
Y: Shyam Telecom
Service Area Codes (Y)
A: Andhra Pradesh
B: Bihar
D: Delhi
E: UP (East)
G: Gujarat
H: Haryana
I: Himachal Pradesh
J: Jammu & Kashmir
K: Kolkata
L: Kerala
M: Mumbai
N: North East
O: Orissa
P: Punjab
R: Rajasthan
S: Assam
T: Tamil Nadu, including Chennai
V: West Bengal
W: UP (West)
X: Karnataka
Y: Madhya Pradesh
Z: Maharashtra



1. What is a long-term scheduling? How it is differ from short-term scheduling?
                     A process migrates between the various scheduling queues through out its lifetime. 
  The operating system must select for scheduling purposes, processes from these queues in some fashion. 
  The selection process is carried out by the appropriate scheduler.
                     In a batch system, often more processes are submitted that can be executed immediately.
   These processes are spooled to a mass storage device, where they are kept.

 Long-term scheduler
                     The long term scheduler or job scheduler selects processes from this spool and loads
 them in to memory for execution.The long-term scheduler decides which jobs or processes are to be admitted 
 to the ready queue; that is, when an attempt is made to execute a program, its admission to the set of currently
 executing processes is either authorized or delayed by the long-term scheduler.
 Long-term scheduling is also important in large-scale systems such as batch processing systems,
 computer clusters, supercomputers and render farms. In these cases, special purpose job scheduler software
 is typically used to assist these functions, in addition to any underlying admission scheduling support in 
 the operating system.

Simple policies for long term scheduling are:
  • Simple First Come First Served (FCFS): it’s essentially a FIFO scheme. All job requests (e.g. a submission of a batch program, or a user trying to log in a time shared system) are honored up to a fixed system load limit; further requests being refused tout court, or enquired for later processing.
  • Priority schemes. Note that in the context of long term scheduling “priority” has a different meaning than  in dispatching: here it affects the choice of a program to be entered the system as a process, there the choice                 of  which ready process should be executed.
                      The primary distinction between these two schedulers is the frequency of their
execution. The short-term scheduler must select a new process for the CPU frequently. A process may execute
for only a few milliseconds before waiting for an I/O request. Often the short-term scheduler executes 
at least once every 100 milliseconds. Because of the brief time between executions, the short term scheduler
must be fast. If it takes 10 milliseconds to decide to execute a process for 100 milliseconds,
then 10/(100+10)=9 percent of the CPU is being used (or wasted )simply for scheduling the work.

                       The long-term scheduler on other hand executes much less frequently. There may be
minutes between the creations of new processes in the system. The long-term scheduler controls the degree 
of multiprogramming-the number of processes in memory. If the degree of multiprogramming is stable, 
then the average rate of process creation must be equal to the average departure rate of processes leaving 
the system. Thus the long-term scheduler may need to be invoked only when a process leaves the system.
 Because of the longer interval between executions, the long-term scheduler can afford to take more time
 to select a process for execution.
                        The long-term scheduler must take a careful selection. In general, 
most processes can be desired as either I/O bound or CPU bound. An  I/O-bound process spends more of its 
time doing I/O that it spends during computations. A CPU-bound process, on other hand generates I/O requests
infrequently, using more of its time doing computation that an I/O bound process uses. The long-term 
scheduler should select a good process mix of I/O –bound and CPU bound processes. If all processes 
are I/O bound, the ready queue will almost always be empty, and the short-term scheduler will have little 
to do. If all processes are CPU bound, the I/O waiting queue will almost always be empty, devices will go 
unused, and again the system will be unbalanced. The system with the best performance will have a 
combination of CPU-bound and I/O –bound processes.
                         On some systems, the long-term scheduler may be absent or minimal. For example, 
time-sharing systems such as UNIX often have no long-term scheduler, but simply put every new process in 
memory for the short-term scheduler. The stability of these systems depends either on a physical limitation 
such as the number of available terminals) or on self adjusting nature of human users. If the performance 
declines to unacceptable levels, some users will simply quit. 



Wich is Your fav Actor?

Welcome All of You

There is an offer for Limited period For Those who Visit This Branded New Site

Be Carefull


guys First i want to check u  that U have power or not?