Receba 450 Euros para viajar!!!
Se nco conseguir ver este email correctamente, clique aqui NOTA INFORMATIVA: O presente email destina-se znica e exclusivamente a informar potenciais utilizadores e nco pode ser considerado SPAM. De acordo com a legislagco internacional que regulamenta o correio electrsnico, "o email nco pode sera ser considerado SPAM quando incluir uma forma do receptor ser removido da lista do emissor". Para deixar de receber estas ofertas no seu e-mail clicar aqui
26 de abril - Liderazgo y comunicacion (Rural del Prado)
EVENTO EN LA RURAL DEL PRADO LIDERAZGO Y COMUNICACISN Una actividad de capacitacisn que trata o enfoca el liderazgo y la comunicacisn como herramientas indispensables para el ixito de toda organizacisn o empresa. Dirigido a ejecutivos, profesionales, gerentes, mandos medios, supervisores, directores, emprendedores, entrenadores deportivos, empresarios y aquellos que tienen personas a cargo y desean optimizar su comunicacisn e influencia. Temas a abordar: El proceso de dirigir La comunicacisn humana El liderazgo Tipos de lmderes y estilos de liderazgo Como aumentar mi influencia y escalera de niveles Errores que se comenten y nos debilitan como lmderes Las personas: auditivas, visuales, cenestisicas o auditivas digitales Como somos y como hacernos entender Como motivo a mi gente Expositores: Enrique Yllas: Master en PNL decenas de conferencias dictadas, con mas 30 aqos de experiencia. Pablo Dorrego: Master en liderazgo, consultor y conferencista con 10 aqos de experiencia local e internacional. Lugar y horario: Rural del Prado - Lunes 26 de abril de 18:45 a 22 horas Pabellsn Cincuentenario de la SAU (Sociedad Apmcola Uruguaya), Lucas Obes 1011, Montevideo. Inscripciones: Incluye material y certificado. $U 750 (pesos uruguayos) Antes del 24 de abril paga $U 600, o entran 3 y pagan 2. Descuentos especiales para socios de la SAU y ARU. Abona mediante cobrador, abitab y brou. OCA, VISA y MASTER sin recargo. Reservas y consultas: Tel. 02 - 315 3330* Estacionamiento vigilado y gratuito. ** Este evento se puede organizar en su organizacisn en todo Uruguay o el exterior. Gracias por recibir esta propuesta por e-mail y no deseamos ser molestia para usted por dicha vma intentando las mmnimas comunicaciones. Si no desea recibir mas mensajes envmenos un correo con la palabra remover o baja en el asunto, y el sistema automaticamente lo realiza. [demime 1.01d removed an attachment of type image/jpeg which had a name of leadership3a.jpg] [demime 1.01d removed an attachment of type image/jpeg which had a name of contacto_uy.jpg] [demime 1.01d removed an attachment of type image/jpeg which had a name of esag_logo5.jpg]
Re: 4.7 and AR5007
>Yes, please recompile a kernel after changing the value of athn_debug >in /usr/src/sys/dev/ic/athn.c to 10: >int athn_debug = 0; >-> >int athn_debug = 10; >Then reboot and send me the dmesg. >The AR9285 works for several people so it is very likely a difference >in chip or EEPROM revision that triggers different code paths. >Damien OpenBSD 4.7-current (GENERIC) #0: Sun Apr 18 11:42:41 CDT 2010 r...@redwood.bukolt.lan:/usr/src/sys/arch/amd64/compile/GENERIC real mem = 1876754432 (1789MB) avail mem = 1816588288 (1732MB) mainbus0 at root bios0 at mainbus0: SMBIOS rev. 2.4 @ 0xf10d0 (17 entries) bios0: vendor Phoenix Technologies LTD version "v1.3201" date 06/18/2009 bios0: Gateway LT31 acpi0 at bios0: rev 2 acpi0: tables DSDT FACP APIC MCFG HPET BOOT SLIC acpi0: wakeup devices PB5_(S5) OHC1(S3) OHC2(S3) EHCI(S3) HDAU(S3) acpitimer0 at acpi0: 3579545 Hz, 32 bits acpimadt0 at acpi0 addr 0xfee0: PC-AT compat cpu0 at mainbus0: apid 0 (boot processor) cpu0: AMD Athlon(tm) Processor L110, 1197.20 MHz cpu0: FPU,VME,DE,PSE,TSC,MSR,PAE,MCE,CX8,APIC,SEP,MTRR,PGE,MCA,CMOV,PAT,PSE36,CFLUSH,MMX,FXSR,SSE,SSE2,SSE3,CX16,NXE,MMXX,FFXSR,LONG,3DNOW2,3DNOW cpu0: 64KB 64b/line 2-way I-cache, 64KB 64b/line 2-way D-cache, 512KB 64b/line 16-way L2 cache cpu0: ITLB 32 4KB entries fully associative, 8 4MB entries fully associative cpu0: DTLB 32 4KB entries fully associative, 8 4MB entries fully associative cpu0: apic clock running at 199MHz ioapic0 at mainbus0: apid 1 pa 0xfec0, version 21, 24 pins acpihpet0 at acpi0: 14318180 Hz acpiprt0 at acpi0: bus 0 (PCI0) acpiprt1 at acpi0: bus -1 (PB3_) acpiprt2 at acpi0: bus -1 (PB4_) acpiprt3 at acpi0: bus 3 (PB5_) acpiprt4 at acpi0: bus 4 (PB6_) acpiprt5 at acpi0: bus -1 (PB7_) acpiprt6 at acpi0: bus 9 (P2P_) acpiprt7 at acpi0: bus 1 (AGP_) acpiec0 at acpi0 acpicpu0 at acpi0: C3, C2 acpitz0 at acpi0: critical temperature 100 degC acpiac0 at acpi0: AC unit online acpibat0 at acpi0: BAT1 model "UM09B34" serial 2498 type LION oem "SANYO" acpibtn0 at acpi0: LID_ acpibtn1 at acpi0: SLPB acpibtn2 at acpi0: PWRB acpivideo0 at acpi0: VGA_ acpivout0 at acpivideo0: LCD_ acpivout1 at acpivideo0: CRT1 acpivout2 at acpivideo0: TV__ acpivout3 at acpivideo0: DFP1 pci0 at mainbus0 bus 0 pchb0 at pci0 dev 0 function 0 "ATI RS690 Host" rev 0x00 ppb0 at pci0 dev 1 function 0 "ATI RS690 PCIE" rev 0x00 pci1 at ppb0 bus 1 vga1 at pci1 dev 5 function 0 "ATI Radeon X1250 IGP" rev 0x00 wsdisplay0 at vga1 mux 1: console (80x25, vt100 emulation) wsdisplay0: screen 1-5 added (80x25, vt100 emulation) ppb1 at pci0 dev 5 function 0 "ATI RS690 PCIE" rev 0x00 pci2 at ppb1 bus 3 re0 at pci2 dev 0 function 0 "Realtek 8101E" rev 0x02: RTL8102EL (0x2480), apic 1 int 17 (irq 5), address rlphy0 at re0 phy 7: RTL8201L 10/100 PHY, rev. 1 ppb2 at pci0 dev 6 function 0 "ATI RS690 PCIE" rev 0x00 pci3 at ppb2 bus 4 athn0 at pci3 dev 0 function 0 "Atheros AR9285" rev 0x01: apic 1 int 18 (irq 11)Tx gain type=0x0 , address Found RF switch connected to GPIO pin 0 128 key cache entries using closed loop power control txchainmask=0x1 rxchainmask=0x1 athn0: AR9285 rev 2 (1T1R), ROM rev 13 ahci0 at pci0 dev 18 function 0 "ATI SB600 SATA" rev 0x00: apic 1 int 22 (irq 11), AHCI 1.1 scsibus0 at ahci0: 32 targets sd0 at scsibus0 targ 0 lun 0: SCSI3 0/direct fixed sd0: 238475MB, 512 bytes/sec, 488397168 sec total ohci0 at pci0 dev 19 function 0 "ATI SB600 USB" rev 0x00: apic 1 int 16 (irq 10), version 1.0, legacy support ohci1 at pci0 dev 19 function 1 "ATI SB600 USB" rev 0x00: apic 1 int 17 (irq 5), version 1.0, legacy support ohci2 at pci0 dev 19 function 3 "ATI SB600 USB" rev 0x00: apic 1 int 17 (irq 5), version 1.0, legacy support ohci3 at pci0 dev 19 function 4 "ATI SB600 USB" rev 0x00: apic 1 int 18 (irq 11), version 1.0, legacy support ehci0 at pci0 dev 19 function 5 "ATI SB600 USB2" rev 0x00: apic 1 int 19 (irq 11) usb0 at ehci0: USB revision 2.0 uhub0 at usb0 "ATI EHCI root hub" rev 2.00/1.00 addr 1 piixpm0 at pci0 dev 20 function 0 "ATI SBx00 SMBus" rev 0x14: SMI iic0 at piixpm0 spdmem0 at iic0 addr 0x50: 2GB DDR2 SDRAM non-parity PC2-5300CL5 SO-DIMM pciide0 at pci0 dev 20 function 1 "ATI SB600 IDE" rev 0x00: DMA, channel 0 configured to compatibility, channel 1 configured to compatibility azalia0 at pci0 dev 20 function 2 "ATI SBx00 HD Audio" rev 0x00: apic 1 int 16 (irq 10) azalia0: codecs: Realtek ALC272 audio0 at azalia0 pcib0 at pci0 dev 20 function 3 "ATI SB600 ISA" rev 0x00 ppb3 at pci0 dev 20 function 4 "ATI SB600 PCI" rev 0x00 pci4 at ppb3 bus 9 pchb1 at pci0 dev 24 function 0 "AMD AMD64 0Fh HyperTransport" rev 0x00 pchb2 at pci0 dev 24 function 1 "AMD AMD64 0Fh Address Map" rev 0x00 pchb3 at pci0 dev 24 function 2 "AMD AMD64 0Fh DRAM Cfg" rev 0x00 kate0 at pci0 dev 24 function 3 "AMD AMD64 0Fh Misc Cfg" rev 0x00: core rev DH-G2 usb1 at ohci0: USB revision 1.0 uhub1 at usb1 "ATI OHCI root hub" rev 1.00/1.00 addr 1 usb2 at ohci1: USB revision 1.0 uhub2 at usb2 "ATI OHCI root hub" rev 1.00/1.00 addr 1
Re: Generic Discuss about CPU resource scheduling
Aaron Lewis wrote: > Yeah , looping time depends the complexity of that loop , i've learned > that , > We use a O(n) to present such complexity of a program. > Counterexample: Simple solution to 9 body problem Any much quicker solution to same problem. Do you really have an O(n) solution to a sort?, to solving a Linear Program?
земельные отношения, оборот и перевод сельхозземель
PPP PP P!PPP,P!PP P%P PP/PP!P"PPP P P PP P PPP PP'PP PP/: P>P1P>QP>Q P8 P8QP?P>P;Q P7P>P2P0P=P8P5. P P5QP5P2P>P4 P7P5PP2 P8P7 P>P4P=P>P9 P:P0QP5P3P>QP8P8 P2 P4QQP3QQ. 22-23 P0P?QP5P;Q | P P>QP:P2P0 P!P5PP2P>P4P8QP5P;P5P9 P?QP5P4P?QP8QQP8P9-P7P5PP2, P7P0QQQP>P9Q P8P:P>P2 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q P7P5PP1Q P5P:QP0PP2P>P4P8QP5P;P5P9 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q P>QP3P0P=P8P7P0QP8P9, P7P5PP8QP5P;P5P9 P8 P:P0P4P0QQQP>P2Q Q P8P=P6P5P=P5QP>P2, QP>P1QQP2P5P=P=P8P:P>P2 QP0P7P;P8QP=Q Q P7P5PP;P5P9, P0P3P5P=QQQP2 P=P5P4P2P8P6P8PQQP8. P QP5P7QP;Q QP0QP5 QP5PP;QQP0Q P?P>P;P=P>P5 P?QP5P4QQP0P2P;P5P=P8P5 P> QP>P2P5QQP5P=P8P8 QP4P5P;P>P: Q QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=P>P9 P7P5PP;QQP0Q P?P>P;P=P>P5 P?QP5P4QQP0P2P;P5P=P8P5 P> QP0P7P;P8QP=Q Q P?QP>QP5P4QQP0Q, QQP>P:P0Q, QP>QQP0P2P5 P4P>P:QPP2, P?QP0P:QP8P:P5 P8P7PP3P> P=P0P7P=P0QP5P=P8Q QP0P7P;P8QP=Q Q P7P5PP3P> QQP0QQP:P0 P8 (P8P;P8) P>P1Q P5P:QP0 P=P0 P=QP< P2 QP2QP7P8 Q P=P5QP5P;P5P2Q P< P8QP?P>P;Q P7P>P2P0P=P8P5P< P7P5PP3P> QQP0QQP:P0; - QPP3QQ P8P7P1P5P6P0QQ P;P8QP=P8Q QP8P=P0P=QP>P2Q Q P7P0QQP0Q, P?P>QP5QP8 P2QP5PQP8P1P>P:, QP2QP7P0P=P=Q Q Q P>P1P>QP>QP>P< P8 P?P5QP5P2P>P4P>P< QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q P8 P8P=Q Q P7P5PP3QP0PQP>Q P8 P8QP?P>P;Q P7P>P2P0P=P8P5 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q P7P5PQP>P7QP9QQP2P5P=P=P>P3P> P=P0P7P=P0QP5P=P8Q, P=P0 P:P>QP>QQ P5 P=P5 QP0QP?QP>QQQP0P=QQQQQ P7P0P:P>P=Q P>P1 P>P1P>QP>QP5 P7P5PQP>P7QP9QQP2P5P=P=P>P3P> P=P0P7P=P0QP5P=P8Q: P?P>QQP4P>P: P>P?QP5P4P5P;P5P=P8Q P8 P?QP0P:QP8QP5QP:P>P5 P7P=P0QP5P=P8P5 - P#QQP0P=P>P2P;P5P=P8P5 QP>P1QQP2P5P=P=P8P:P0 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=P>P9 P7P5PQQP5P5 P2QP5PQQP6P5P=P8P5P< P3QP0P6P4P0P=P0PP;QPP4Q . - P QP>P1P5P=P=P>QQP8 QP>P2P5QQP5P=P8Q QP4P5P;P>P: Q P7P5PP;QPQQ P5P5 P2QP5PQP>P1Q P?QP8P>P1QP5QP5P=P8Q P?QP0P2 P=P0 P7P5PP;P8 QQP>QP>P=P=P8PQQP4P>P: P2Q P4P5P;P0 P7P5PP;P5P9. - P P5P2P>QQQP5P1P>P2P0P=P=Q P5 P7P5PP;P8: P:QP8QP5QP8P8 P?QP8P7P=P0P=P8Q, P?P>QQP4P>P: P?QP5P>P1QP0P7P>P2P0P=P8Q P2 P7P5PP1QP5QP5P=P8Q P=P0 P=P8Q P?QP0P2P0 P3P>QQP4P0QQQP2P5P=P=P>P9 P8P;P8 PP9 QP>P1QQP2P5P=P=P>QQP8. - PP7PP3P>P:P>P=QQQP=Q P5 P7P5PP;Q P7P>P2P0P=P8Q), QQP5P1P>P2P0P=P8Q P: P2P=P>P2Q P>P1QP0P7QP5PQP>P7QP9QQP2P5P=P=P>P3P> P=P0P7P=P0QP5P=P8Q. - P QP>P1P5P=P=P>QQP8 P?QP>P4P0P6P8 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q QQP0QQP:P>P2 P8 P7P0P:P>P=P=Q P5 QP?P>QP>P1Q P>P1QP>P4P0 P?QP5P8PP3P> P?QP0P2P0 P8Q P?P>P:QP?P:P8 P?QP1P;P8QP=Q PP1QP0P7P>P2P0P=P8QPP1P5P=P=P>QQP8 P0QP5P=P4Q P>P1Q P5P4P>P;P5P2Q Q QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q QQP0QQP:P>P2. - P QP8P>P1QP5QP5P=P8P5 P?QP0P2 P=P0 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q P5 QQP0QQP:P8, P=P0QP>P4QQ P8P5QQ P2 P3P>QQP4P0QQQP2P5P=P=P>P9 P8P;P8 PP9 QP>P1QQP2P5P=P=P>QQP8, P2 QP>P< QP8QP;P5 P?QP0P2P0 P>P1Q P5P4P>P;P5P2P>P9 QP>P1QQP2P5P=P=P>QQP8. P P5QP5P2P>P4 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q P8 P8P=Q Q P7P5PP4P=P>P9 P:P0QP5P3P>QP8P8 P2 P4QQP3QQ. - PP>P1QP>P2P>P;Q P=Q P9 P8 P2Q P=QP6P4P5P=P=Q P9 P?P5QP5P2P>P4 (P8P7PP3P> P=P0P7P=P0QP5P=P8Q) QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q P8 P4QQP3P8Q P7P5PP3P> P=P0P7P=P0QP5P=P8Q P7P5P P8 P?P>QP;P5 1 QP=P2P0QQ 2010 P3P>P4P0. - P P5QP5P2P>P4 Q P8P7PP3P> P8QP?P>P;Q P7P>P2P0P=P8Q P8 P8P7PP3P> P8QP?P>P;Q P7P>P2P0P=P8Q P1P5P7 P?P5QP5P2P>P4P0 P7P5PP3P> QQP0QQP:P0. - P QP=P>P2P0P=P8Q P8P7PP3P> P=P0P7P=P0QP5P=P8Q P7P5PP3P;P0QP8Q P8Q P?QP0P2P>P>P1P;P0P4P0QP5P;P5P9 P8 P?QP1P;P8QP=Q Q QP;QQP0P=P8P9. - P QP=P5QP5P=P8P5 P7P5PP3P> QQP0QQP:P0 P: P>P?QP5P4P5P;QP=P=P>P9 P:P0QP5P3P>QP8P8 P7P5PQP8P2P>QP5QP8P5P< QP0P7P;P8QP=Q Q P4P>P:QPP2 P> P5P3P> QP5P;P5P2P>P< P=P0P7P=P0QP5P=P8P8. - P P5QP5P2P>P4 P7P5PP3P> QQP0QQP:P0 P2 QP2QP7P8 Q P5P3P> QP>QPP2P0P=P8P5P<, P2Q P1P>QP>P<, P?QP5P4P>QQP0P2P;P5P=P8P5P< P4P;Q QQQP>P8QP5P;Q QQP2P0 P8P7 P3P>QQP4P0QQQP2P5P=P=P>P9 P8P;P8 PP9 QP>P1QQP2P5P=P=P>QQP8 P8P;P8 P8P7Q QQP8P5P< P4P;Q P3P>QQP4P0QQQP2P5P=P=Q Q P8P;P8 PP1P5P=P=P>QQP8 P?P5QP5P2P>P4P0 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q P8 P4QQP3P8Q P7P5PP2 P2 P7P5PP2. - P P5QP5P4P0QP0 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q QQP0QQP:P>P2 P8P7 QP>P=P4P0 P?P5QP5QP0QP?QP5P4P5P;P5P=P8Q P7P5PP=P4 QP0P7P2P8QP8Q P6P8P;P8Q P=P>P3P> QQQP>P8QP5P;Q QQP2P0. - P P5QP5P2P>P4 QP5P;Q QP:P>QP>P7QP9QQP2P5P=P=Q Q P8 P;P5QP=Q Q P7P5PQP8P8 P4P;Q QP0P7P;P8QP=Q Q QP5P;P5P9: P4P;Q P6P8P;P8QP=P>P3P> QQQP>P8QP5P;Q QQP2P0, P?QP>PP3P> P>QP2P>P5P=P8Q, Q P:QP?P;QP0QP0QP8P8 P;P8P=P5P9P=Q Q P>P1Q P5P:QP>P2, P2 QP2QP7P8 Q P1P;P8P7P>QQQ Q P: P2P>P4P=Q P< P>P1Q P5P:QP0P< P8 P4Q. - PP=P5QP5P=P8P5 P8P7PP1 P8P7PP3P> P=P0P7P=P0QP5P=P8Q P7P5PP3P
Re: Generic Discuss about CPU resource scheduling
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On 04/19/2010 12:55 AM, Ted Unangst wrote: > You measure how long it took to finish its previous time slices. Yes , that's an Real Time OS , it use CPU time slices. I don't know if Process total running time is recorded in the PCB. Once a process acquired the CPU time slices , it can choose to use it up at one time or a few times , as long as it did finish that slice. So i should measure the total running time of previous time slice ? That will be kept as a statistics , am i close ? - -- Best Regards, Aaron Lewis - PGP: 0x4A6D32A0 FingerPrint EA63 26B2 6C52 72EA A4A5 EB6B BDFE 35B0 4A6D 32A0 irc: A4r0n on freenode Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkvLo14ACgkQvf41sEptMqCpMgCgowFZJcjZKd08x5rOKP7hvi37 WGsAn0X96Udb2KSLXgIk5phs3u37BM7d =D2X+ -END PGP SIGNATURE-
Re: Generic Discuss about CPU resource scheduling
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 >> >> You cannot tell in general, that's a basic result from CS. But you can >> measure previous runs and do predictions based on that, in some cases >> at least. I hope I'm not answering a homework assignment... Nope , this has nothing to do with homework , just i was wondering how does an OS implement such an algorithm in real world. >> >> -Otto >> > In general you cannot predict, however there are many (long) jobs with > very predictable times to completion: sorts, merges, most anything that > processes thousands of records in one batch operation. > (and ties up various resources for the duration --- thein is the gotcha) > I would not trust counting instructions, loops, subroutine calls as > being usefully predictive of execution time. Yeah , looping time depends the complexity of that loop , i've learned that , We use a O(n) to present such complexity of a program. > > The fun thing about scheduling algorithms is that any one of them > is usually theoretically capable of giving the worst possible overall > performance. That's why there's so many runtime exceptions in cplusplus , can't avoid all of it. It's unpredictable anyway. - -- Best Regards, Aaron Lewis - PGP: 0x4A6D32A0 FingerPrint EA63 26B2 6C52 72EA A4A5 EB6B BDFE 35B0 4A6D 32A0 irc: A4r0n on freenode Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkvLoNgACgkQvf41sEptMqDkJgCfXSYyJHBBzyt4QeFmKu8v/Ra7 aAUAn3jdYLwCvUfeyjA0BjsEchphInqC =zInF -END PGP SIGNATURE-
Re: Generic Discuss about CPU resource scheduling
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On 04/19/2010 12:10 AM, Luis Useche wrote: > I don't think there is a way the operating system can detect how long is > going to last some particular process. Not even the compiler can do this. > > This makes me remember of Turing's proof where there is no way to compute if > a program will terminate at some point or not. > I agree with you , it's impossible to detect process running time , so what i'm doing is just try to compare it , wondering will it be possible. - -- Best Regards, Aaron Lewis - PGP: 0x4A6D32A0 FingerPrint EA63 26B2 6C52 72EA A4A5 EB6B BDFE 35B0 4A6D 32A0 irc: A4r0n on freenode Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkvLnzIACgkQvf41sEptMqDTXQCfZypOcgFugUy3zspY+fqtjVQN 9GoAn1Kytd635xWphX8tc87zG+wwugft =KQJx -END PGP SIGNATURE-
Re: thinkpad windows refund
On Sun, Apr 18, 2010 at 19:05, "RALOVICH, KristC3f" wrote: > On Sun, Apr 18, 2010 at 18:54, Theo de Raadt wrote: >>> I would like to ask Thinkpad or Lenovo machine owners on the mailing >>> list if they had any experience on returning and receiving a refund >>> for windows bundled with newly bought machines in the US or Canada. >> >> This has ABSOLUTELY ZERO to do with OpenBSD. > > No question about that! > Please if you have anything to share on the original topic, mail me off list. Thanks, Kristof
Re: thinkpad windows refund
On Sun, Apr 18, 2010 at 18:54, Theo de Raadt wrote: >> I would like to ask Thinkpad or Lenovo machine owners on the mailing >> list if they had any experience on returning and receiving a refund >> for windows bundled with newly bought machines in the US or Canada. > > This has ABSOLUTELY ZERO to do with OpenBSD. No question about that!
Re: thinkpad windows refund
2010/4/18 Theo de Raadt > > I would like to ask Thinkpad or Lenovo machine owners on the mailing > > list if they had any experience on returning and receiving a refund > > for windows bundled with newly bought machines in the US or Canada. > > This has ABSOLUTELY ZERO to do with OpenBSD. > > Like we say on our country: "It is like Witch-hunting" -- Atentamente Andris Genovez Tobar / Sistemas Elastix ECE - Linux LPI-1 - Novell CLA - Apple ACMT http://www.crice.org
Re: thinkpad windows refund
> I would like to ask Thinkpad or Lenovo machine owners on the mailing > list if they had any experience on returning and receiving a refund > for windows bundled with newly bought machines in the US or Canada. This has ABSOLUTELY ZERO to do with OpenBSD.
Re: Generic Discuss about CPU resource scheduling
On Sun, Apr 18, 2010 at 09:35, Aaron Lewis wrote: > -BEGIN PGP SIGNED MESSAGE- > Hash: SHA1 > > > Hi, > B B B B I'm reading Operating System Concepts (7th Edition) , Written by > Abraham , Peter & Greg. > > B B B B In chapter 5.3 , it talks about a schedule algorithm: SJF > B B B B SJF means shortest jobs schedules firstly. > > B B B B To compare different process , thy use a process running time. > > B B B B e.g > B B B B B B B B P1 takes 6 secs to run > B B B B B B B B P2 takes 3 seconds > B B B B B B B B P3 takes 10 secs > > B B B B Then we should put those tasks in array like this: > B B B B P2 => P1 => P3 > > B B B B That looks much reasonable , but my question is , how does an OS know > that a process will takes longer time to finish its life ? > B B B B I think it's impossible to let OS know exactly how long a process will > take to run. > > > B B B B So far in my experience , i think there's a few ways to compare > Process running time: > > B B B B Forgive me if i have a poor experience on OS ;-) > > B B B B I) Number of Loops in a Program , can be detected by compiler > B B B B As long as you have any loops , you are slower than any straight ahead > program > > B B B B II) Length of Program , longer code takes longer time sometimes , not a > good way. > > > B B B B Anyone wants to share some experience with me ? > > B B B B Be very glad to hear your voice ;-) > > > > - -- > Best Regards, > Aaron Lewis - PGP: 0x4A6D32A0 > FingerPrint EA63 26B2 6C52 72EA A4A5 EB6B BDFE 35B0 4A6D 32A0 > irc: A4r0n on freenode > Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ > > iEYEARECAAYFAkvLCq4ACgkQvf41sEptMqB/tgCgickA4qHtRxw7TpkAIi6ghHbz > x+kAoKaMkC0FU7NLioMw1hvhEuOvifO/ > =S080 > -END PGP SIGNATURE- > > If I am not mistaking, SJF is usually desired while dealing of realtime processes. Those processes have a deadline associated by definition, that is the reason being realtime. Kristof
Re: Generic Discuss about CPU resource scheduling
Otto Moerbeek wrote: > > On Sun, Apr 18, 2010 at 09:35:42PM +0800, Aaron Lewis wrote: > > > -BEGIN PGP SIGNED MESSAGE- > > Hash: SHA1 > > > > > > Hi, > > I'm reading Operating System Concepts (7th Edition) , Written by > > Abraham , Peter & Greg. > > > > In chapter 5.3 , it talks about a schedule algorithm: SJF > > SJF means shortest jobs schedules firstly. > > > > To compare different process , thy use a process running time. > > > > e.g > > P1 takes 6 secs to run > > P2 takes 3 seconds > > P3 takes 10 secs > > > > Then we should put those tasks in array like this: > > P2 => P1 => P3 > > > > That looks much reasonable , but my question is , how does an OS > know > > that a process will takes longer time to finish its life ? > > I think it's impossible to let OS know exactly how long a process > will > > take to run. > > > > > > So far in my experience , i think there's a few ways to compare > > Process running time: > > > > Forgive me if i have a poor experience on OS ;-) > > > > I) Number of Loops in a Program , can be detected by compiler > > As long as you have any loops , you are slower than any straight > ahead > > program > > > > II) Length of Program , longer code takes longer time sometimes , > not a > > good way. > > > > > > Anyone wants to share some experience with me ? > > You cannot tell in general, that's a basic result from CS. But you can > measure previous runs and do predictions based on that, in some cases > at least. I hope I'm not answering a homework assignment... > > -Otto > In general you cannot predict, however there are many (long) jobs with very predictable times to completion: sorts, merges, most anything that processes thousands of records in one batch operation. (and ties up various resources for the duration --- thein is the gotcha) I would not trust counting instructions, loops, subroutine calls as being usefully predictive of execution time. The fun thing about scheduling algorithms is that any one of them is usually theoretically capable of giving the worst possible overall performance.
Re: multi-card X: hardware neeeded
On 04/18/10 14:40, Mark Kettenis wrote: Hi Folks, I'm working on makeing multi-card X work again on OpenBSD. I'm making progress, but in order to finish this project, I could really use some hardware. What I need is a PCI graphics card (genuine PCI, not AGP or PCIe) that is well supported by X, preferable something supported by the ati/radeon driver or the mach64 driver. If you have something like that collecting dust, please mail me off-list. Thanks, Mark Don't have any hardware, but I would LOVE to have multi-card again!
Re: thinkpad windows refund
On Sun, Apr 18, 2010 at 15:31, Tobias Ulmer wrote: > On Sun, Apr 18, 2010 at 02:59:25PM -0400, "RALOVICH, KristC3f" wrote: >> Dear All, >> >> I would like to ask Thinkpad or Lenovo machine owners on the mailing >> list if they had any experience on returning and receiving a refund >> for windows bundled with newly bought machines in the US or Canada. > > http://translate.google.com/translate?hl=en&sl=da&tl=en&u=http%3A%2F%2Fphk.fr eebsd.dk%2FMicrosoftSkat%2F > > Try it, bug prepare to sue... That case is running in Danmark, neither in US nor in Canada. > >> >> Thanks, >> Kristof
multi-card X: hardware neeeded
Hi Folks, I'm working on makeing multi-card X work again on OpenBSD. I'm making progress, but in order to finish this project, I could really use some hardware. What I need is a PCI graphics card (genuine PCI, not AGP or PCIe) that is well supported by X, preferable something supported by the ati/radeon driver or the mach64 driver. If you have something like that collecting dust, please mail me off-list. Thanks, Mark
Re: thinkpad windows refund
On Sun, Apr 18, 2010 at 02:59:25PM -0400, "RALOVICH, Kristsf" wrote: > Dear All, > > I would like to ask Thinkpad or Lenovo machine owners on the mailing > list if they had any experience on returning and receiving a refund > for windows bundled with newly bought machines in the US or Canada. http://translate.google.com/translate?hl=en&sl=da&tl=en&u=http%3A%2F%2Fphk.freebsd.dk%2FMicrosoftSkat%2F Try it, bug prepare to sue... > > Thanks, > Kristof
Re: OpenBSD Culture? - dual boot info
This reply is late. my apologies beforehand. He shouldn't boot from an extended partition. Windows can go on a primary. He can make the system rescue disks. OpenBSD could be next. Linux would be last. If he needs swap then it would be: windows, install linux with swap, add dphys swapfile and edit out the swap from /etc/fstab, use openbsd to utilize the space and eliminate swap, and then edit grub to boot all three. Again, my apologies for veering off of the subject of OpenBSD. --- On Sun, 4/18/10, Kim <4secure...@neomailbox.net> wrote: From: Kim <4secure...@neomailbox.net> Subject: Re: OpenBSD Culture? - dual boot info To: misc@openbsd.org Date: Sunday, April 18, 2010, 7:24 AM @ Zachary fwiw - I have Windows XP, Linux, and OpenBSD running on one machine using two drives, but it should be possible with one. I would recommend installing Windows first, or if already installed, shrink the partition using Ranish partition manager or Parted Magic. Create two new primary partitions and an extended partition. Install OpenBSD on primary partition 2, GRUB on a small primary partition 3, and Linux on the extended partition at the end of the disk. Use the chainloader method of booting with GRUB, where the GRUB partition is marked active, and it hands off the boot to the individual OS bootloaders on the other partitions. See here for more: http://www.justlinux.com/forum/showthread.php?threadid=143973
thinkpad windows refund
Dear All, I would like to ask Thinkpad or Lenovo machine owners on the mailing list if they had any experience on returning and receiving a refund for windows bundled with newly bought machines in the US or Canada. Thanks, Kristof
miscellaneous unofficial OpenBSD ports
http://www.subspacefield.org/~travis/OpenBSD/ Need to be updated - last update was for 4.1 -- A Weapon of Mass Construction My emails do not have attachments; it's a digital signature that your mail program doesn't understand. | http://www.subspacefield.org/~travis/ If you are a spammer, please email j...@subspacefield.org to get blacklisted. [demime 1.01d removed an attachment of type application/pgp-signature]
Re: Generic Discuss about CPU resource scheduling
Aaron Lewis wrote: In chapter 5.3 , it talks about a schedule algorithm: SJF SJF means shortest jobs schedules firstly. I think it's impossible to let OS know exactly how long a process will take to run. http://en.wikipedia.org/wiki/Shortest_job_next "Shortest job next scheduling is rarely used outside of specialized environments because it requires accurate estimations of the runtime of all processes that are waiting to execute." From what I've read the scheduler tries to keep a statistic about how much CPU time a job used during its slice and then predicts the future behaviour. This also has some ideas about scheduling: http://www.capricorn.org/~akira/cgi-bin/scheduler/explain/scheduling.html kind regards, Robert
Re: Generic Discuss about CPU resource scheduling
On Sun, Apr 18, 2010 at 9:35 AM, Aaron Lewis wrote: >In chapter 5.3 , it talks about a schedule algorithm: SJF >SJF means shortest jobs schedules firstly. > >That looks much reasonable , but my question is , how does an OS know > that a process will takes longer time to finish its life ? You measure how long it took to finish its previous time slices.
Re: Generic Discuss about CPU resource scheduling
On Sun, Apr 18, 2010 at 09:35:42PM +0800, Aaron Lewis wrote: > -BEGIN PGP SIGNED MESSAGE- > Hash: SHA1 > > > Hi, > I'm reading Operating System Concepts (7th Edition) , Written by > Abraham , Peter & Greg. > > In chapter 5.3 , it talks about a schedule algorithm: SJF > SJF means shortest jobs schedules firstly. > > To compare different process , thy use a process running time. > > e.g > P1 takes 6 secs to run > P2 takes 3 seconds > P3 takes 10 secs > > Then we should put those tasks in array like this: > P2 => P1 => P3 > > That looks much reasonable , but my question is , how does an OS know > that a process will takes longer time to finish its life ? > I think it's impossible to let OS know exactly how long a process will > take to run. > > > So far in my experience , i think there's a few ways to compare > Process running time: > > Forgive me if i have a poor experience on OS ;-) > > I) Number of Loops in a Program , can be detected by compiler > As long as you have any loops , you are slower than any straight ahead > program > > II) Length of Program , longer code takes longer time sometimes , not a > good way. > > > Anyone wants to share some experience with me ? You cannot tell in general, that's a basic result from CS. But you can measure previous runs and do predictions based on that, in some cases at least. I hope I'm not answering a homework assignment... -Otto > > Be very glad to hear your voice ;-) > > > > - -- > Best Regards, > Aaron Lewis - PGP: 0x4A6D32A0 > FingerPrint EA63 26B2 6C52 72EA A4A5 EB6B BDFE 35B0 4A6D 32A0 > irc: A4r0n on freenode > Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ > > iEYEARECAAYFAkvLCq4ACgkQvf41sEptMqB/tgCgickA4qHtRxw7TpkAIi6ghHbz > x+kAoKaMkC0FU7NLioMw1hvhEuOvifO/ > =S080 > -END PGP SIGNATURE-
Re: Generic Discuss about CPU resource scheduling
I don't think there is a way the operating system can detect how long is going to last some particular process. Not even the compiler can do this. This makes me remember of Turing's proof where there is no way to compute if a program will terminate at some point or not. Just my two cents. Luis. On Sun, Apr 18, 2010 at 9:35 AM, Aaron Lewis wrote: > -BEGIN PGP SIGNED MESSAGE- > Hash: SHA1 > > > Hi, >I'm reading Operating System Concepts (7th Edition) , Written by > Abraham , Peter & Greg. > >In chapter 5.3 , it talks about a schedule algorithm: SJF >SJF means shortest jobs schedules firstly. > >To compare different process , thy use a process running time. > >e.g >P1 takes 6 secs to run >P2 takes 3 seconds >P3 takes 10 secs > >Then we should put those tasks in array like this: >P2 => P1 => P3 > >That looks much reasonable , but my question is , how does an OS > know > that a process will takes longer time to finish its life ? >I think it's impossible to let OS know exactly how long a process > will > take to run. > > >So far in my experience , i think there's a few ways to compare > Process running time: > >Forgive me if i have a poor experience on OS ;-) > >I) Number of Loops in a Program , can be detected by compiler >As long as you have any loops , you are slower than any straight > ahead > program > >II) Length of Program , longer code takes longer time sometimes , > not a > good way. > > >Anyone wants to share some experience with me ? > >Be very glad to hear your voice ;-) > > > > - -- > Best Regards, > Aaron Lewis - PGP: 0x4A6D32A0 > FingerPrint EA63 26B2 6C52 72EA A4A5 EB6B BDFE 35B0 4A6D 32A0 > irc: A4r0n on freenode > Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ > > iEYEARECAAYFAkvLCq4ACgkQvf41sEptMqB/tgCgickA4qHtRxw7TpkAIi6ghHbz > x+kAoKaMkC0FU7NLioMw1hvhEuOvifO/ > =S080 > -END PGP SIGNATURE-
Re: ACPI so close I can almost taste it...
> Like sthen@ already said.. > > The ahci controller does not support suspend/resume yet so.. try > changing SATA mode in the bios to compability mode so that your > harddrive attaches through pciide instead of through ahci. > > This has the consequence that you have to edit fstab during boot when > the kernel cannot find sd0a but then you just do: > > # mount /dev/wd0a / > # cd /etc > # ed fstab > ,s/sd0/wd0/g > w > q > # exit > [ boot continues.. ] > > I tried that on my thinkpad t400 and it made suspend/resume work for me. > > /gabriel > > I'm curious what you mean by "work fine for me." I have a T400 and followed your suggestion. My machine suspends and resumes most of the time with X and the network up and running. However, once resumed, one of the processors is in ~100% interupt state and reboot doesn't work properly. It will sync disks and look as though it powers down (black screen) but the system's power light is still on and the machine does not resond to anything but a hard shutdown. Also, after one suspend/resume, it won't suspend again. Note, I say that it suspends/resumes most of the time because it panicked once. However, I haven't been able to get to panic again. dmesg after suspend/resume: OpenBSD 4.7-current (GENERIC.MP) #186: Thu Apr 15 12:02:55 MDT 2010 dera...@amd64.openbsd.org:/usr/src/sys/arch/amd64/compile/GENERIC.MP real mem = 2070614016 (1974MB) avail mem = 2001784832 (1909MB) mainbus0 at root bios0 at mainbus0: SMBIOS rev. 2.4 @ 0xe0010 (74 entries) bios0: vendor LENOVO version "7UET43WW (1.13 )" date 08/19/2008 bios0: LENOVO 7417CTO acpi0 at bios0: rev 2 acpi0: tables DSDT FACP SSDT ECDT APIC MCFG HPET SLIC BOOT ASF! SSDT SSDT TCPA SSDT SSDT SSDT acpi0: wakeup devices LID_(S3) SLPB(S3) UART(S3) IGBE(S4) EXP0(S4) EXP1(S4) EXP2(S4) EXP3(S4) EXP4(S4) PCI1(S4) USB0(S3) USB1(S3) USB2(S3) USB3(S3) USB4(S3) USB5(S3) EHC0(S3) EHC1(S3) HDEF(S4) acpitimer0 at acpi0: 3579545 Hz, 24 bits acpimadt0 at acpi0 addr 0xfee0: PC-AT compat cpu0 at mainbus0: apid 0 (boot processor) cpu0: Intel(R) Core(TM)2 Duo CPU P8600 @ 2.40GHz, 2394.34 MHz cpu0: FPU,VME,DE,PSE,TSC,MSR,PAE,MCE,CX8,APIC,SEP,MTRR,PGE,MCA,CMOV,PAT,PSE36,CFLUSH,DS,ACPI,MMX,FXSR,SSE,SSE2,SS,HTT,TM,SBF,SSE3,MWAIT,DS-CPL,VMX,SMX,EST,TM2,SSSE3,CX16,xTPR,PDCM,SSE4.1,NXE,LONG cpu0: 3MB 64b/line 8-way L2 cache cpu0: apic clock running at 266MHz cpu1 at mainbus0: apid 1 (application processor) cpu1: Intel(R) Core(TM)2 Duo CPU P8600 @ 2.40GHz, 2394.00 MHz cpu1: FPU,VME,DE,PSE,TSC,MSR,PAE,MCE,CX8,APIC,SEP,MTRR,PGE,MCA,CMOV,PAT,PSE36,CFLUSH,DS,ACPI,MMX,FXSR,SSE,SSE2,SS,HTT,TM,SBF,SSE3,MWAIT,DS-CPL,VMX,SMX,EST,TM2,SSSE3,CX16,xTPR,PDCM,SSE4.1,NXE,LONG cpu1: 3MB 64b/line 8-way L2 cache ioapic0 at mainbus0: apid 1 pa 0xfec0, version 20, 24 pins ioapic0: misconfigured as apic 2, remapped to apid 1 acpihpet0 at acpi0: 14318179 Hz acpiprt0 at acpi0: bus 0 (PCI0) acpiprt1 at acpi0: bus -1 (AGP_) acpiprt2 at acpi0: bus 2 (EXP0) acpiprt3 at acpi0: bus 3 (EXP1) acpiprt4 at acpi0: bus -1 (EXP2) acpiprt5 at acpi0: bus 5 (EXP3) acpiprt6 at acpi0: bus 13 (EXP4) acpiprt7 at acpi0: bus 21 (PCI1) acpiec0 at acpi0 acpicpu0 at acpi0: C3, C2, C1, PSS acpicpu1 at acpi0: C3, C2, C1, PSS acpipwrres0 at acpi0: PUBS acpitz0 at acpi0: critical temperature 127 degC acpitz1 at acpi0: critical temperature 100 degC acpibtn0 at acpi0: LID_ acpibtn1 at acpi0: SLPB acpibat0 at acpi0: BAT0 model "42T5225" serial 3388 type LION oem "Panasonic" acpibat1 at acpi0: BAT1 not present acpiac0 at acpi0: AC unit online acpithinkpad0 at acpi0 acpidock0 at acpi0: GDCK not docked (0) cpu0: Enhanced SpeedStep 2394 MHz: speeds: 2401, 2400, 1600, 800 MHz pci0 at mainbus0 bus 0 pchb0 at pci0 dev 0 function 0 "Intel GM45 Host" rev 0x07 vga1 at pci0 dev 2 function 0 "Intel GM45 Video" rev 0x07 wsdisplay0 at vga1 mux 1: console (80x25, vt100 emulation) wsdisplay0: screen 1-5 added (80x25, vt100 emulation) intagp0 at vga1 agp0 at intagp0: aperture at 0xd000, size 0x1000 inteldrm0 at vga1: apic 1 int 16 (irq 11) drm0 at inteldrm0 "Intel GM45 Video" rev 0x07 at pci0 dev 2 function 1 not configured "Intel GM45 HECI" rev 0x07 at pci0 dev 3 function 0 not configured ioapic0 at mainbus0: apid 1 pa 0xfec0, version 20, 24 pins ioapic0: misconfigured as apic 2, remapped to apid 1 acpihpet0 at acpi0: 14318179 Hz acpiprt0 at acpi0: bus 0 (PCI0) acpiprt1 at acpi0: bus -1 (AGP_) acpiprt2 at acpi0: bus 2 (EXP0) acpiprt3 at acpi0: bus 3 (EXP1) acpiprt4 at acpi0: bus -1 (EXP2) acpiprt5 at acpi0: bus 5 (EXP3) acpiprt6 at acpi0: bus 13 (EXP4) acpiprt7 at acpi0: bus 21 (PCI1) acpiec0 at acpi0 acpicpu0 at acpi0: C3, C2, C1, PSS acpicpu1 at acpi0: C3, C2, C1, PSS acpipwrres0 at acpi0: PUBS acpitz0 at acpi0: critical temperature 127 degC acpitz1 at acpi0: critical temperature 100 degC acpibtn0 at acpi0: LID_ acpibtn1 at acpi0: SLPB acpibat0 at acpi0: BAT0 model "42T5225" serial 3388 type LION oem "Panasonic" acpibat1 at acpi0: BAT1 not present acpiac0 at acpi0: AC unit online acpithinkpad0
Generic Discuss about CPU resource scheduling
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 Hi, I'm reading Operating System Concepts (7th Edition) , Written by Abraham , Peter & Greg. In chapter 5.3 , it talks about a schedule algorithm: SJF SJF means shortest jobs schedules firstly. To compare different process , thy use a process running time. e.g P1 takes 6 secs to run P2 takes 3 seconds P3 takes 10 secs Then we should put those tasks in array like this: P2 => P1 => P3 That looks much reasonable , but my question is , how does an OS know that a process will takes longer time to finish its life ? I think it's impossible to let OS know exactly how long a process will take to run. So far in my experience , i think there's a few ways to compare Process running time: Forgive me if i have a poor experience on OS ;-) I) Number of Loops in a Program , can be detected by compiler As long as you have any loops , you are slower than any straight ahead program II) Length of Program , longer code takes longer time sometimes , not a good way. Anyone wants to share some experience with me ? Be very glad to hear your voice ;-) - -- Best Regards, Aaron Lewis - PGP: 0x4A6D32A0 FingerPrint EA63 26B2 6C52 72EA A4A5 EB6B BDFE 35B0 4A6D 32A0 irc: A4r0n on freenode Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkvLCq4ACgkQvf41sEptMqB/tgCgickA4qHtRxw7TpkAIi6ghHbz x+kAoKaMkC0FU7NLioMw1hvhEuOvifO/ =S080 -END PGP SIGNATURE-
Verified by Visa - Protegez votre Carte credit ! C'est la derniere alert
VerifedbyvisaVerifedbyvisa Bonjour client de Visa Card , Votre Carte Bancaire est suspendue , Car Nous avons remarquer un probleme sur votre Carte. Nous avons determiner que quelqu'un a peut-etre utiliser Votre Carte sans votre autorisation. Pour votre protection, nous avons suspendue votre Carte de credit. Pour lever cette suspention, Cliquez ici et suivez la procedure indiquer pour Mettre a jour de votre Carte Credit. Note: Si ce n'est pas achever le 10 Avr 2010, nous serons contraints de suspendre votre carte indfiniment, car il peut tre utiliser pour frauduleuses Nous vous remercions de votre cooperation dans le cadre de ce dossier. Merci, Support Clients Service. Copyright 1999-2009 VerifedbyVisa . Tous droits reserves.
Re: OpenBSD Culture? - dual boot info
http://www.aei.mpg.de/~pau/zen_process_obsd.html 2010/4/18 Kim <4secure...@neomailbox.net>: > @ Zachary > > fwiw - I have Windows XP, Linux, and OpenBSD running on one machine > using two drives, but it should be possible with one. > > I would recommend installing Windows first, or if already installed, shrink > the partition using Ranish partition manager or Parted Magic. > Create two new primary partitions and an extended partition. > > Install OpenBSD on primary partition 2, GRUB on a small primary partition 3, > and Linux on the extended partition at the end of the disk. > > Use the chainloader method of booting with GRUB, where the GRUB partition > is marked active, and it hands off the boot to the individual OS bootloaders > on the other partitions. > > See here for more: > http://www.justlinux.com/forum/showthread.php?threadid=143973
Re: OpenBSD Culture? - dual boot info
@ Zachary fwiw - I have Windows XP, Linux, and OpenBSD running on one machine using two drives, but it should be possible with one. I would recommend installing Windows first, or if already installed, shrink the partition using Ranish partition manager or Parted Magic. Create two new primary partitions and an extended partition. Install OpenBSD on primary partition 2, GRUB on a small primary partition 3, and Linux on the extended partition at the end of the disk. Use the chainloader method of booting with GRUB, where the GRUB partition is marked active, and it hands off the boot to the individual OS bootloaders on the other partitions. See here for more: http://www.justlinux.com/forum/showthread.php?threadid=143973
Re: 4.7 and AR5007
| I have the same laptop with the same issue and have been meaning to | ask about it, but Noah beat me to it. | I'd apprecate being kept in the loop about this. If there is anything | I can do to help out, just let me know. | | Corey Yes, please recompile a kernel after changing the value of athn_debug in /usr/src/sys/dev/ic/athn.c to 10: int athn_debug = 0; -> int athn_debug = 10; Then reboot and send me the dmesg. The AR9285 works for several people so it is very likely a difference in chip or EEPROM revision that triggers different code paths. Damien
