Kinds of things.
Whaaaa? Where Am I?
This is Zacharias Stankiewicz's personal blog.
About The Author

Name: Your Name
Location: Anywhere

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nunc ut sapien. Nunc non massa. Sed venenatis. Vivamus pede dolor, vehicula non, laoreet et, dapibus non, est. Etiam tempus justo a lacus. Vestibulum lectus purus, aliquet vel, bibendum pellentesque, commodo eu, nisi.

tweets for the week 2011-03-25

by zach @ . March 25, 2011 . 3:59AM

Filed under: Packing Peanuts |
0 Comments

tweets for the week 2011-03-18

by zach @ . March 18, 2011 . 3:59AM

  • Cheap nerd joys: I bought it a month ago, and now its on sale for more than what I paid for it. #yeahitsjustamouse #
  • I've programmed in BASIC, Logo, C, Java, C#, and VB, and I still need a reference for CSS selectors. #
  • I guess I ought to put in for that new job that opened up over at Engadget. #
  • god damn it somebody just stole an hour of my life. #
  • Dude, getting this for my office: http://www.nmmprints.com/image.php?imgref=BHC2906 #
  • I don't know if anybody from my CS 3207 class follows me, but this useful: http://softpixel.com/~cwright/programming/threads/threads.c.php #
  • As one of the 8 people directly working for one researcher at Temple, I'm concerned about Corbett's plan to slash Temple funding. #temple #
  • I hope I can buy a dumb TV in five years. #
  • I actually had a reason to use BCC today. First time since I worked in BIG TELECOM. #
  • All the independent studies I've undertaken in the last few years about nuclear energy just makes me sad at the media. #goodjobmyself #
  • Who was that yelling at me at Richmond and Allegheny this morning? #
  • ebay just changed their pricing scheme to include shipping costs, to encourage cheaper shipping for auctions #aboutdamntime #
  • As time goes on, I'm actually kinda psyched for the Playbook – admittedly as odd as that sounds coming from a MacBook Pro/iPhone guy. #
  • @BriGuy72 Thanks Mr. Spam! Its a good idea, though, as you know what browser exploit to DPD me with. #
  • Would it be appros. to ever say a reflexive relation's reflexive closure is {}? #
  • Gizmodo/Lifehacker says to ditch the wi-fi and go all wired. #yeahdidthat3yearsagobutgoodadvice #
  • Math exam tomorrow. #
Filed under: Packing Peanuts |
0 Comments

CS3207 Quiz 4 Review

by Zacharias @ http://inexactitu.de . March 17, 2011 . 12:20PM

1. The test-and-set (TS) instruction and the swap instruction are part of the hardware support for process synchronization contained in modern CPUs.

True. Since test-and-set solutions rely on condition codes (stored in the PSW), the processor reads the previous instruction.

2. Although the spin-lock solution and the Peterson algorithm provide busy-waiting solutions to the critical section problem, only the spin-lock solution controls the order of entry for waiting processes.

False. Spin-locks don’t control order. Peterson’s is a busy-wait in software.

3. In class we discussed a bounded-waiting solution to the critical section problem using test-and-set. This solution works because a process exiting the critical section transferees control of entry to the next process in an ordered list awaiting entry.

True. Bounded-waiting Mutual Exclusion with TestandSet().

4. In the single producer – single consumer, multi-slot budder problem, the critical section is the manipulation of the count of the number of filled cells.

True.

5. The implementation of the operations P & V on binary semaphores only require block/wakeup, while these same operations on general semaphores require block/wakeup and counting.

False. We want this to happen at their own rate. We are looking at the count value.

6. When semaphores and semaphore operations are implemented in a non-preeemmptable kernel, we will not have any busy waiting.

True. We need to do this if the semaphore is implemented in user-space.

7. In the multiple producer, multiple consumer problem with a multi-slot buffer, we require mutual exclusion of the ‘deposit’ and ‘take’ to ensure proper order of entry.

False. This solution doesn’t provide proper order. This only provides only the ability to feed the consumer empty spaces and the consumer full spaces.

8. How many philosophers may eat simultaneously in the Dining Philosophers problem with only 4 philosophers?

Two. Draw a picture if this isn’t obvious.

9. The readers-writers problem discussed in class…

c… required that no reader will be kept waiting unless a writer has already obtained permission to use the shared database.

10. A monitor wait() operation always blocks.

True. Waiting signal can be implemented using semaphores. A monitor wait using a binary semaphore initialized to 0, whenever a process waits, it’s guaranteed to block.

Questions about how semaphores are implemented and conditions are implemented. This is very important to synchronization.

Filed under: College |
0 Comments

tweets for the week 2011-03-11

by zach @ . March 11, 2011 . 3:59AM

Filed under: Packing Peanuts |
0 Comments

tweets for the week 2011-03-04

by zach @ . March 4, 2011 . 3:59AM

Filed under: Packing Peanuts |
0 Comments