Alternative of InsomniaT for disabling sleep function on lid closed situation

Hello.
I am finding the alternative method to let my MacBook Air not come to sleep mode while its lid is closed. Since installation of InsomniaT occures another problem. Usage of terminal command is OK. Please teach me.
Thank you very much.

I found it by myself. "No Sleep" app is available and it works fine.

Similar Messages

MBP keeps waking up (for a few seconds) with lid closed and in sleep.

My macbook pro, with the lid closed and hence in sleep, will periodically turn on. As in, ill be laying in bed trying to sleep, ill hear the sound of the fans and hd etc turn on, and then ill see the lcd light up.. itll do this for 4 secs, then go back to sleep. Every 20 mins or so it will do this.
What the hells wrong with it ?

Do you have any USB devices attached? Any Bluetooth devices tethered and nearby? Both of those can wake the MBP... Bluetooth can be set not to wake (System Preferences > Bluetooth), but for USB the only way is to unplug them before you close the lid. If you have Ethernet connected, uncheck the box to wake for ethernet administrator access in System Preferences > Energy Saver > Options tab (in Power adapter settings) .
Hope this helps...

Lenovo thinkpad 8 not entering sleep mode when lid closed

RECENTLY I BOUGHT THINKPAD 8. I HAVE A PROBLEM. IT CAN'T ENTER SLEEP MODE. I CLOSE THE LID AND THE SCREEN IS ON. AT POWER OPTION IT IS SELECTED WHEN I CLOSE THE LID TO GO TO SLEEP , ON BATTERY AND WHEN PLUGED IN. THANKS FOR ANY HELP.
Solved!
Go to Solution.

I am not certain what you mean. Are you saying that when you close the cover it does not sleep? Are you certain you have a cover with the magnets that will put it to sleep?

MacBook - stop going to sleep mode When lid closed

Hi ,
I am using handbrake to convert video files on macbook .
I want to close the laptop lid and still want the process to run in background .
Some one mentioned that if the laptop lid is closed and the system is running it gets heated rapidly .
I want to do this for 45 minutes ( commute between office and home ).
So , how do I close the lid ( display ) and not allow the system to go to standby/sleep.
Thanks
macbook Mac OS X (10.4.9)

You could also use InsomniaX.
I do not think that it's that bad for your macbook (heat generation); see this article: How to use your PowerBook G4, MacBook Pro or MacBook with the display closed.
I would not recommend picking your notebook up, though, since the hard disk's heads could scratch your hard disk... That's one of the things standby prevents.
By the way; why wouldn't you use standby? Your mac goes in standby rapidly, and wakes up even faster!

Scheduled system wakeup from a Sleep state while lid closed

I'm wanting to backup my Ti Power Book data using the .Mac Backup 3 (BU3) application at 2am each day.
On my desktop system which is a Power Mac G5 I perform a BU3 every day at around 2am. The Energy Saver is configured to wake my Power Mac from a sleep state at 2am and not go back to sleep until some 1 hr of inactivity. Shortly after 2am I have various scheduled BU3 Plans that execute. This is working flawlessly for me.
I now want to do the same thing for my Power Book - but with its lid/screen closed. I've tried the same setup as for my Power Mac and the Power Book will wakeup at 2am but very quickly returns to sleep mode because its lid is closed which stops the BU3 from executing. I do not want to leave the Power Book's lid open at night time.
Is there a way to meet my requirements ?

Hi, Barry. No, there isn't — unless you connect an external monitor, keyboard and display to the Powerbook as described in this article.

How to Switch off sleep mode when lids closed?!

Does anyone know if you can turn sleep mode off when the lid is shut on a Powerbook G4!? If so HOW!?
Cheers
MIKE MIKE MIKE

Look here:
http://docs.info.apple.com/article.html?artnum=300562
Joe

How to disable mac book sleep for when I close the lid. I have a monitor attached to the mac book and as soon as I close the lid on the mac book it goes toi sleep. Any way to disable the sleep mode? Thanks

Boss bought a new monitor for his mac book. We connected it but he rather keep the mac book lid closed in order to work on the bigger monitor screen. Soon as he closes the lid, the mac book goes to sleep mode.
Is there a free way to disable the sleep mode?

When the MacBook goes to sleep just hit a key on your external keyboard and the monitor will come back on.
http://support.apple.com/kb/HT3131

Anyway to selectivily enable/disable bluetooth function for selected apps like papago in iphone.

Hi,
Anyway to selectively enable/disable bluetooth function for selected apps like papago navigator in iphone.
I want to maintain bluetooth connectivity to car headset for handsfree driving while papago navigator on ky iphone continuously guide me on the road using the iphone speaker. So when someone called me on the phone, it will use the car headset. is there such as apps?
Rgds,
Kpk

Hi,
In pageflow definition, "Train Stop-->Skip" property controls the enable/disable state.
If Skip value is true (it can be controlled with EL expression) than related link and button in train components are disabled.
They are enabled other If Skip value is false (It is default).

Permanent fix for disabling safe sleep?

I am frustrated with my MacBook Pro's safe sleep 'feature'. I found the standard way of de-activating it (with the pmset commands), and this works in the short term, but within a few days, either through changing the energy settings or other ways, it always reverts to the original setting of having safe sleep activated.
I found SmartSleep, which allows one to turn off safe sleep without typing the pmset commands, but no luck - after a few days, it will revert to safe sleep.
This is very frustrating, and I'm not sure how to permanently disable this. I have read people suggesting writing a startup script, but I hardly ever reboot my laptop (the only times I have are after typing the pmset commands!) so this wouldn't really solve the problem.
Does anyone know of a permanent fix for this?
Thanks!

The terminal commands are the most permanent way you'll find.
Here's the issue: If you launch Energy Saver and choose ANY of Apple's pre-defined settings like "longer battery life," safe sleep is automatically turned on. To avoid this, you must avoid selecting any of the default power configurations. You can still manually set the sleep and display timers, you just can't use Apple's predefined profiles.
Make sure you delete the virtual memory space reserved for safe sleep after you disable it, too. Here's the link:
http://www.macosxhints.com/article.php?story=20070302210328928

Disable Delete Function for Assets

Hi all,
Is it possible to block the Delete function from ALL assets for specific user roles only while still allowing other specific user roles to use it?

Hi,
Try below exits :
EXIT_SAPLCOIH_006 : PM Order: Customer Enhancement for Exclusion of Function Codes
Function code for Delete is : LOEA.
Kindly check.

Need help in using sleep function in pl/sql

Hi,
need help:
I have a condition where i want to validate total_pass=total_fail and
I want to use the sleep function in a pl/sql where i want to wait for 2 minutes ie.checking
whether total_pass=total_fail based upon class_id .
I have the data in the table as:
CLASS_ID TOT_PASS TOT_FAIL
1 10 10
2 5 4
3 6 6
4 7 5
Any help will be needful for me

I'm not quite sure what you are lookg for here, but whatever it is, your code as posted won't do it. You will never break out of the WHILE r_Class.Tot_Pass = r_Class.Tot_Fail loop, since these values will never change because you never get the next record form the cursor.
From your original data, it looks like your cursor will return multiple rows which implies to me that you want to fetch the first row from the cursor, check if tot_pass = tot_fail, if they are equal, sleep for two minutes then get the next row. This does not make sense to me. Once the select in the cursor is executed, the data it returns will not change due to Oracle's read consistency model, so there seems to me no point in the sleep.
The other alternative I can see is that you want to check all the returned rows, and if tot_pass = tot_fail for one of the rows (or possibly for all of the rows), then you want to sleep and try again.
If you can explain in words what it is you are trying to accomplish, someone will be able to point you to a solution.
John

External FW/USB Western Digital, Seagate Disk Drives and 'Sleep' function

As you are aware, most external disk drives be they FW or USB (and irrespective of the manufacturer, save for LaCie) have a 'sleep' function built into their Firmware. In the case of the Western Digital and Seagate Ext FW drives I have, this function cannot be disabled and this per both WD and Seagate.
Unfortunately this is extremely annoying if using Photoshop and Bridge...it takes about ten seconds for each disk to spin up while the latter programs search the drives. (In Windows this can be enabled/disabled. Not so with the Mac O/S I have been told). Multiply this by six of the aforementioned drives and it can be quite time consuming.
Is there an OS-X workaround for this?
Thanks again,
Lyman

I always avoid vendor cases. Might want to look at an Oxford 912 etc, or better yet, why use Firewire when eSATA works so well?

Sleep Function in PL/SQL

Hi Guys,
I am creating a procedure which will check for the fileld in the database and if it returns NULL should go to sleep for 15 minutes and then will again check for the field. I am planning to use DBMS_LOCK.SLEEP function. Please can you suggest if the same is fine or advise if in case there is any other specific function which I require to use as I have read that the mentioned function is not accurate in calculating the SLEEP time.
[http://asktom.oracle.com/pls/asktom/f?p=100:11:0::::P11_QUESTION_ID:6019886867656]
Best Regards,
Shaz

Summary of DBMS_LOCK Subprograms
Table 53-3 DBMS_LOCK Package Subprograms
Subprogram Description
ALLOCATE_UNIQUE Procedure
Allocates a unique lock ID to a named lock.
CONVERT Function
Converts a lock from one mode to another.
RELEASE Function
Releases a lock.
REQUEST Function
Requests a lock of a specific mode.
SLEEP Procedure
Puts a procedure to sleep for a specific time.
PL/SQL lock timer
Definition: This Wait-Event represents the amount of time a user or application has “slept” through the USER_LOCK.SLEEP or DBMS_LOCK.SLEEP procedures.
When investigating Oracle Wait-Events, the lion's share of time is spent looking at those events where applications consume precious system resources or are in direct contention with other users or applications. These resource waits revolve around excessive CPU, memory, or disk usage. Events that spin for Oracle internal structures such as latches or enqueues can also be of concern. As their name suggests, Wait-Events DO ‘wait’ on some event to complete before a user or application can continue with its work. Contention for system resources will overwhelm Oracle’s ability to immediately process the SQL and ultimately cause applications to accumulate time in resource specific Wait-Events.
On the flip-side of resource waits there are what are called idle events. These events do not wait for any specific resource but record the time Oracle is waiting for a work request from the application. Many practitioners of Oracle performance will not even look at these idle events because they do not consume resources and are not limiting what Oracle can do at any given point in time. Some will even go so far as to state that the idle events have no meaningful information. This is not necessarily true. Take for instance the idle event ‘SQL*Net message from client’. This idle event is not inhibiting the database server from performing work but, as many agree, is an indication of poor response from client to database server. While idle events are not the result of direct resource contention, they are an accurate measure of accumulated delays in the application imposed by Oracle.
The ‘idle’ event “PL/SQL lock timer” is worth watching because it points us in the direction of application response, throughput, and possible coding issues. The PL/SQL lock timer event is, as the command that issues it states, a sleep mandated by the application code. The application is idle and doing nothing. This means that if the application sleeps for a combined interval of 5 minutes, the response to the user or complete run of the application will take at least 5 minutes longer.
While this event does not require resources and thus is not an Oracle resource contention issue, it is our job to provide the quickest response to users and push applications through our system to increase the user’s perceived performance.
Most often, sleeps are put into an application for serialization of transactional events or spinning on queues until something happens. When the event occurs or a queue is populated, then the application continues its work. We should ask ourselves why an application is sleeping for any amount of time and provide alternatives if necessary to reduce this idle event. You will gain quicker responses if you trigger an action instead of the action waiting for an event.
How to look at the PL/SQL lock timer event
To initiate a sleep for the current session for five seconds.
SQL> execute sys.dbms_lock.sleep(5);
To take a look at current sessions that are using the SLEEP command. Notice that the column P1 in V$SESSION does not represent the amount of time the session has slept but in fact represents the duration this session will sleep. Also note that this column is in centiseconds and as such the five seconds issued for a sleep has been translated in to 500 centiseconds.
SQL> select osuser,event,p1 from v$session where event = 'PL/SQL lock timer'
OSUSER EVENT P1
Johnny Smith PL/SQL lock timer 500

Since I installed Lion on my macbook the LED light does not pulse when I close the screen - the sleep function does not work.

Since I installed Lion on my macbook the LED light does not pulse when I close the screen - the sleep function does not work neither when chosen after pressing the button nor chosen in the apple menu..

I have had the same problem but on another forum it was suggested that disabling internet sharing would solve this. This fix seems to work on my machine - why it works I do not understand

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

Alternative of InsomniaT for disabling sleep function on lid closed situation

Similar Messages

Maybe you are looking for